No photo of Dana Ron-Goldreich

View Scopus Profile

Dana Ron-Goldreich

Professor

Former affiliation
 https://orcid.org/0000-0001-6576-7200
1993 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2024

    Testing Ck-Freeness in Bounded-Arboricity Graphs

    Eden, T., Levi, R. & Ron, D., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 60. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

  • 2023

    Sample-Based Distance-Approximation for Subsequence-Freeness

    Cohen-Sidon, O. & Ron, D., Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 44. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

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

  • 2022

    Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

    Eden, T., Ron, D. & Rosenbaum, W., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 56. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).

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

    2 Scopus citations

  • Approximating the Arboricity in Sublinear Time

    Eden, T., Mossel, S. & Ron, D., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 2404-2425 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

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

    Open Access
    2 Scopus citations

  • Testing Distributions of Huge Objects

    Goldreich, O. & Ron, D., 1 Jan 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 78. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 215).

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

    4 Scopus citations

  • The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity

    Nakar, Y. & Ron, D., 2022, Cellular Automata - 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Proceedings. Chopard, B., Arabi Haddad, M., Bandini, S. & Dennunzio, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 63-72 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13402 LNCS).

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

    2 Scopus citations
  • 2021

    On efficient distance approximation for graph properties

    Fiat, N. & Ron, D., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 1618-1637 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    7 Scopus citations

  • Optimal Distribution-Free Sample-Based Testing Of subsequence-freeness

    Ron, D. & Rosin, A., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 337-356 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    2 Scopus citations

  • Testing dynamic environments: Back to basics

    Nakar, Y. & Ron, D., 1 Jul 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, 98. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

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

    2 Scopus citations
  • 2020

    Almost optimal distribution-free sample-based testing of k-modality

    Ron, D. & Rosin, A., 1 Aug 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, APPROX27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

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

    4 Scopus citations

  • Faster sublinear approximation of the number of k-cliques in low-arboricity graphs

    Eden, T., Ron, D. & Seshadhri, C., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1467-1478 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

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

    19 Scopus citations
  • 2019

    The arboricity captures the complexity of sampling edges

    Eden, T., Ron, D. & Rosenbaum, W., 1 Jul 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, 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

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

    12 Scopus citations

  • The subgraph testing model

    Goldreich, O. & Ron, D., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

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

  • 2018

    On approximating the number of k-Cliques in sublinear time

    Eden, T., Ron, D. & Seshadhri, C., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). Association for Computing Machinery, p. 100-113 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
    31 Scopus citations

  • On the testability of graph partition properties

    Nakar, Y. & Ron, D., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 53. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

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

    7 Scopus citations

  • Property testing of planarity in the CONGEST model

    Levi, R., Medina, M. & Ron, D., 23 Jul 2018, PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 347-356 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    Open Access
    3 Scopus citations

  • Provable and practical approximations for the degree distribution using sublinear graph samples

    Eden, T., Jain, S., Pinar, A., Ron, D. & Seshadhri, C., 10 Apr 2018, The Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018. Association for Computing Machinery, Inc, p. 449-458 10 p. (The Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018).

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

    Open Access
    29 Scopus citations

  • Testing bounded arboricity

    Eden, T., Levi, R. & Ron, D., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 2081-2092 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    9 Scopus citations

  • Tolerant junta testing and the connection to submodular optimization and function isomorphism

    Blais, E., Canonne, C. L., Eden, T., Levi, A. & Ron, D., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 2113-2132 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    8 Scopus citations
  • 2017

    Sublinear time estimation of degree distribution moments: The degeneracy connection

    Eden, T., Ron, D. & Seshadhri, C., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

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

    22 Scopus citations
  • 2016

    A local algorithm for constructing spanners in minor-free graphs

    Levi, R., Ron, D. & Rubinfeld, R., 1 Sep 2016, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Jansen, K., Mathieu, C., Rolim, J. D. P. & Umans, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 60).

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

    6 Scopus citations
  • 2015

    Approximately Counting Triangles in Sublinear Time

    Eden, T., Levi, A., Ron, D. & Seshadhri, C., 11 Dec 2015, Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. IEEE Computer Society, p. 614-633 20 p. 7354418. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2015-December).

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

    Open Access
    42 Scopus citations

  • Distributed maximum matching in bounded degree graphs

    Even, G., Medina, M. & Ron, D., 4 Jan 2015, ICDCN 2015 - Proceedings of the 16th International Conference on Distributed Computing and Networking. Association for Computing Machinery, (ACM International Conference Proceeding Series; vol. 04-07-January-2015).

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

    Open Access
    2 Scopus citations

  • On sample-based testers [extended abstract]

    Goldreich, O. & Ron, D., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. Association for Computing Machinery, Inc, p. 337-345 9 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).

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

    10 Scopus citations
  • 2014

    Deterministic stateless centralized local algorithms for bounded degree graphs

    Even, G., Medina, M. & Ron, D., 2014, Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag, p. 394-405 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8737 LNCS).

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

    24 Scopus citations

  • Local algorithms for sparse spanning graphs

    Levi, R., Ron, D. & Rubinfeld, R., 1 Sep 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Moore, C., Devanur, N. R. & Rolim, J. D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 826-842 17 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

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

    20 Scopus citations

  • On learning and testing dynamic environments

    Goldreich, O. & Ron, D., 7 Dec 2014, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, p. 336-343 8 p. 6979018. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

  • Testing equivalence between distributions using conditional samples

    Canonne, C., Ron, D. & Servedio, R. A., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 1174-1192 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    22 Scopus citations
  • 2013

    A quasi-polynomial time partition oracle for graphs with an excluded minor

    Levi, R. & Ron, D., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 709-720 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

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

    8 Scopus citations

  • A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support

    Dutta, A., Levi, R., Ron, D. & Rubinfeld, R., 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. p. 113-122 10 p. 6543047. (Data Compression Conference Proceedings).

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

    Open Access
    13 Scopus citations

  • Exponentially improved algorithms and lower bounds for testing signed majorities

    Ron, D. & Servedio, R. A., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 1319-1336 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    6 Scopus citations

  • On the possibilities and limitations of pseudodeterministic algorithms

    Goldreich, O., Goldwasser, S. & Ron, D., 2013, ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. p. 127-137 11 p. (ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science).

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

    Open Access
    21 Scopus citations
  • 2012

    A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size

    Onak, K., Ron, D., Rosen, M. & Rubinfeld, R., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 1123-1131 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    67 Scopus citations

  • Testing similar means

    Levi, R., Ron, D. & Rubinfeld, R., 2012, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1 ed. p. 629-640 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7391 LNCS, no. PART 1).

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

  • 2011

    Approximating the influence of monotone boolean functions in O(√n) query complexity

    Ron, D., Rubinfeld, R., Safra, M. & Weinstein, O., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 664-675 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

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

    7 Scopus citations

  • On approximating the number of relevant variables in a function

    Ron, D. & Tsur, G., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 676-687 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

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

    1 Scopus citations

  • Testing Properties of Collections of Distributions.

    Levi, R., Ron, D. & Rubinfeld, R., 1 Jan 2011, Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS). Vol. 17. p. 179-194 16 p.

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

  • 2010

    Algorithmic aspects of property testing in the dense graphs model

    Goldreich, O. & Ron, D., 2010, Property Testing - Current Research and Surveys. p. 295-305 11 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 proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Comparing the strength of query types in property testing: The case of testing k-colorability

    Ben-Eliezer, I., Kaufman, T., Krivelevich, M. & Ron, D., 2010, Property Testing - Current Research and Surveys. p. 253-259 7 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 proceeding › Conference contribution › peer-review

  • Counting stars and other small subgraphs in sublinear time

    Gonen, M., Ron, D. & Shavitt, Y., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 99-116 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    Open Access
    11 Scopus citations

  • Distribution-free testing algorithms for monomials with a sublinear number of queries

    Dolev, E. & Ron, D., 2010, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. p. 531-544 14 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 proceeding › Conference contribution › peer-review

  • Testing computability by width-2 OBDDs where the variable order is unknown

    Ron, D. & Tsur, G., 2010, Algorithms and Complexity - 7th International Conference, CIAC 2010, Proceedings. p. 131-142 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6078 LNCS).

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

    2 Scopus citations

  • Testing properties of sparse images

    Tsur, G. & Ron, D., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 468-477 10 p. 5671244. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    6 Scopus citations
  • 2009

    Algorithmic aspects of property testing in the dense graphs model

    Goldreich, O. & Ron, D., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 520-533 14 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 proceeding › Conference contribution › peer-review

    3 Scopus citations

  • On proximity oblivious testing

    Goldreichy, O. & Ron, D., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 141-150 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    6 Scopus citations

  • Testing computability by width two OBDDs

    Ron, D. & Tsur, G., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 686-699 14 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 proceeding › Conference contribution › peer-review

    6 Scopus citations
  • 2008

    Comparing the strength of query types in property testing: The case of testing k-colorability

    Ben-Eliezer, I., Kaufman, T., Krivelevich, M. & Ron, D., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1213-1222 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    13 Scopus citations
  • 2007

    Finding a dense-core in jellyfish graphs

    Gonen, M., Ron, D., Weinsberg, U. & Wool, A., 2007, Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings. Springer Verlag, p. 29-40 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4863 LNCS).

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

    2 Scopus citations

  • On the benefits of adaptivity in property testing of dense graphs

    Gonen, M. & Ron, D., 2007, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, p. 525-539 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).

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

    12 Scopus citations

  • Property testing: A learning theory perspective

    Ron, D., 2007, Learning Theory - 20th Annual Conference on Learning Theory, COLT 2007, 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. 4539 LNAI).

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

    1 Scopus citations