Amos Beimel

View Scopus Profile

Amos Beimel

Professor

 https://orcid.org/0000-0002-6572-4195
1992 …2024

Research activity per year

Search results

  • 2024

    Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions

    Beimel, A., Malkin, T. & Mazor, N., 1 Jan 2024, Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Reyzin, L. & Stebila, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 459-488 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14924 LNCS).

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

  • 2023

    Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

    Abram, D., Beimel, A., Ishai, Y., Kushilevitz, E. & Narayanan, V., 1 Jan 2023, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Rothblum, G. & Wee, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 286-315 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14369 LNCS).

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

    1 Scopus citations

  • Improved Polynomial Secret-Sharing Schemes

    Beimel, A., Farràs, O. & Lasri, O., 1 Jan 2023, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Rothblum, G. & Wee, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 374-405 32 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14370 LNCS).

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

  • Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs

    Beimel, A., 1 Jul 2023, 4th Conference on Information-Theoretic Cryptography, ITC 2023. Chung, K.-M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 267).

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

    1 Scopus citations

  • Quadratic Secret Sharing and Conditional Disclosure of Secrets

    Beimel, A., Othman, H. & Peter, N., 17 Jul 2023, In: IEEE Transactions on Information Theory. 69, 11, p. 7295-7316 22 p.

    Research output: Contribution to journal › Article › peer-review

    1 Scopus citations

  • Succinct Computational Secret Sharing

    Applebaum, B., Beimel, A., Ishai, Y., Kushilevitz, E., Liu, T. & Vaikuntanathan, V., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1553-1566 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    3 Scopus citations

  • Three Party Secure Computation with Friends and Foes

    Alon, B., Beimel, A. & Omri, E., 1 Jan 2023, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Rothblum, G. & Wee, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 156-185 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14370 LNCS).

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

  • 2022

    Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds

    Beimel, A., Kaplan, H., Mansour, Y., Nissim, K., Saranurak, T. & Stemmer, U., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 1671-1684 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
    17 Scopus citations

  • Linear Secret-Sharing Schemes for Forbidden Graph Access Structures

    Beimel, A., Farras, O., Mintz, Y. & Peter, N., 1 Mar 2022, In: IEEE Transactions on Information Theory. 68, 3, p. 2083-2100 18 p.

    Research output: Contribution to journal › Article › peer-review

    2 Scopus citations

  • Secret Sharing, Slice Formulas, and Monotone Real Circuits

    Applebaum, B., Beimel, A., Nir, O., Peter, N. & Pitassi, T., 1 Jan 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 215).

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

    5 Scopus citations

  • TIGHTER BOUNDS ON MULTIPARTY COIN FLIPPING VIA AUGMENTED WEAK MARTINGALES AND DIFFERENTIALLY PRIVATE SAMPLING

    Beimel, A., Haitner, I., Makriyannis, N. & Omri, E., 1 Jan 2022, In: SIAM Journal on Computing. 51, 4, p. 1126-1171 46 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    2 Scopus citations
  • 2021

    Learning Privately with Labeled and Unlabeled Examples

    Beimel, A., Nissim, K. & Stemmer, U., 1 Jan 2021, In: Algorithmica. 83, 1, p. 177-215 39 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations

  • Quadratic Secret Sharing and Conditional Disclosure of Secrets

    Beimel, A., Othman, H. & Peter, N., 1 Jan 2021, Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings. Malkin, T. & Peikert, C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 748-778 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12827 LNCS).

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

    3 Scopus citations
  • 2020

    1/p -Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds

    Beimel, A., Lindell, Y., Omri, E. & Orlov, I., 1 Oct 2020, In: Journal of Cryptology. 33, 4, p. 1659-1731 73 p.

    Research output: Contribution to journal › Article › peer-review

    4 Scopus citations

  • Better secret sharing via robust conditional disclosure of secrets

    Applebaum, B., Beimel, A., Nir, O. & Peter, N., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 280-293 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    23 Scopus citations

  • Closure Properties for Private Classification and Online Prediction

    Alon, N., Beimel, A., Moran, S. & Stemmer, U., 1 Jan 2020, In: Proceedings of Machine Learning Research. 125, p. 119-152 34 p.

    Research output: Contribution to journal › Conference article › peer-review

    13 Scopus citations

  • Evolving ramp secret sharing with a small gap

    Beimel, A. & Othman, H., 1 Jan 2020, Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Canteaut, A. & Ishai, Y. (eds.). Springer, p. 529-555 27 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12105 LNCS).

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

    7 Scopus citations

  • On the round complexity of the shuffle model

    Beimel, A., Haitner, I., Nissim, K. & Stemmer, U., 1 Jan 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 683-712 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12551 LNCS).

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

    Open Access
    4 Scopus citations

  • The power of synergy in differential privacy: Combining a small curator with local randomizers

    Beimel, A., Korolova, A., Nissim, K., Sheffet, O. & Stemmer, U., 1 Jun 2020, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Kalai, Y. T., Smith, A. D. & Wichs, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 163).

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

    6 Scopus citations

  • The share size of secret-sharing schemes for almost all access structures and graphs

    Beimel, A. & Farràs, O., 1 Jan 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 499-529 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12552 LNCS).

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

    6 Scopus citations
  • 2019

    Characterizing the sample complexity of pure private learners

    Beimel, A., Nissim, K. & Stemmer, U., 1 Sep 2019, In: Journal of Machine Learning Research. 20

    Research output: Contribution to journal › Article › peer-review

    19 Scopus citations

  • Exploring differential obliviousness

    Beimel, A., Nissim, K. & Zaheri, M., 1 Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 65. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

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

    2 Scopus citations

  • Private center points and learning of halfspaces

    Beimel, A., Moran, S., Nissim, K. & Stemmer, U., 2019, Proceedings of Machine Learning Research : 32nd Annual Conference on Learning Theory. Beygelzimer, A. & Hsu, D. (eds.). Vol. 99. p. 269-282

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

  • Private Center Points and Learning of Halfspaces

    Beimel, A., Moran, S., Nissim, K. & Stemmer, U., 1 Jan 2019, In: Proceedings of Machine Learning Research. 99, p. 269-282 14 p.

    Research output: Contribution to journal › Conference article › peer-review

    19 Scopus citations

  • Secret-Sharing from Robust Conditional Disclosure of Secrets

    Beimel, A. & Peter, N., May 2019, (Cryptology ePrint Archive).

    Research output: Working paper/Preprint › Preprint

  • Secret-sharing schemes for general and uniform access structures

    Applebaum, B., Beimel, A., Farràs, O., Nir, O. & Peter, N., 1 Jan 2019, Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Ishai, Y. & Rijmen, V. (eds.). Springer Verlag, p. 441-471 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11478 LNCS).

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

    26 Scopus citations
  • 2018

    Evolving ramp secret-sharing schemes

    Beimel, A. & Othman, H., 1 Jan 2018, Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings. Catalano, D. & De Prisco, R. (eds.). Springer Verlag, p. 313-332 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11035 LNCS).

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

    11 Scopus citations

  • Optimal linear multiparty conditional disclosure of secrets protocols

    Beimel, A. & Peter, N., 1 Jan 2018, Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Peyrin, T. & Galbraith, S. (eds.). Springer Verlag, p. 332-362 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11274 LNCS).

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

    9 Scopus citations

  • Preface

    Beimel, A. & Dziembowski, S., 1 Jan 2018, Theory of Cryptography: 16th International Conference, TCC 2018, Proceedings, Part II. Beimel, A. & Dziembowski, S. (eds.). Springer, p. v-vi (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11240).

    Research output: Chapter in Book/Report/Conference proceeding › Foreword/postscript

  • Preface

    Beimel, A. & Dziembowski, S., 1 Jan 2018, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 11239 LNCS, p. V-VI

    Research output: Contribution to journal › Editorial

  • Privacy Preserving Multi-Agent Planning with Provable Guarantees

    Beimel, A. & Brafman, R. I., Nov 2018, arXiv.

    Research output: Working paper/Preprint › Preprint

  • The complexity of multiparty PSM protocols and related models

    Beimel, A., Kushilevitz, E. & Nissim, P., 1 Jan 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 287-318 32 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10821 LNCS).

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

    17 Scopus citations

  • Theory of Cryptography: 16th International Conference, TCC 2018, Panaji, India, November 11–14, 2018, Proceedings, Part I

    Beimel, A. (Editor) & Dziembowski, S. (Editor), Nov 2018, 1 ed. Springer Cham. 720 p. (Lecture Notes in Computer Science; vol. 11239)

    Research output: Book/Report › Book › peer-review

  • Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling

    Beimel, A., Haitner, I., Makriyannis, N. & Omri, E., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). Institute of Electrical and Electronics Engineers, p. 838-849 12 p. 8555162. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

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

    Open Access
    16 Scopus citations
  • 2017

    Ad hoc PSM protocols: Secure computation without coordination

    Beimel, A., Ishai, Y. & Kushilevitz, E., 1 Jan 2017, Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Coron, J.-S. & Nielsen, J. B. (eds.). Springer Verlag, p. 580-608 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10212 LNCS).

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

    7 Scopus citations

  • Linear secret-sharing schemes for forbidden graph access structures

    Beimel, A., Farràs, O., Mintz, Y. & Peter, N., 1 Jan 2017, Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings. Kalai, Y. & Reyzin, L. (eds.). Springer Verlag, p. 394-423 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10678 LNCS).

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

    21 Scopus citations
  • 2016

    Distribution design

    Beimel, A., Gabizon, A., Ishai, Y. & Kushilevitz, E., 14 Jan 2016, ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. Association for Computing Machinery, Inc, p. 81-92 12 p. (ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science).

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

    Open Access
    7 Scopus citations

  • Private learning and sanitization: Pure vs. approximate differential privacy

    Beimel, A., Nissim, K. & Stemmer, U., 1 Jan 2016, In: Theory of Computing. 12, 890.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    44 Scopus citations

  • Secret sharing schemes for dense forbidden graphs

    Beimel, A., Farràs, O. & Peter, N., 1 Jan 2016, Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings. De Prisco, R. & Zikas, V. (eds.). Springer Verlag, p. 509-528 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9841 LNCS).

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

    6 Scopus citations

  • Secret-Sharing Schemes for Very Dense Graphs

    Beimel, A., Farràs, O. & Mintz, Y., 1 Apr 2016, In: Journal of Cryptology. 29, 2, p. 336-362 27 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    31 Scopus citations
  • 2015

    Complete characterization of fairness in secure two-party computation of Boolean functions

    Asharov, G., Beimel, A., Makriyannis, N. & Omri, E., 1 Jan 2015, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Dodis, Y. & Nielsen, J. B. (eds.). Springer Verlag, p. 199-228 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9014).

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

    Open Access
    30 Scopus citations

  • Learning privately with labeled and unlabeled examples

    Beimel, A., Nissim, K. & Stemmer, U., 1 Jan 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. Association for Computing Machinery, p. 461-477 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

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

    Open Access
    18 Scopus citations

  • Protocols for Multiparty Coin Toss with a Dishonest Majority

    Beimel, A., Omri, E. & Orlov, I., 12 Jul 2015, In: Journal of Cryptology. 28, 3, p. 551-600 50 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    22 Scopus citations
  • 2014

    Bounds on the sample complexity for private learning and private data release

    Beimel, A., Brenner, H., Kasiviswanathan, S. P. & Nissim, K., 1 Mar 2014, In: Machine Learning. 94, 3, p. 401-437 37 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    74 Scopus citations

  • Choosing, Agreeing, and Eliminating in Communication Complexity

    Beimel, A., Ben Daniel, S., Kushilevitz, E. & Weinreb, E., 1 Mar 2014, In: Computational Complexity. 23, 1, p. 1-42 42 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    6 Scopus citations

  • Multi-linear secret-sharing schemes

    Beimel, A., Ben-Efraim, A., Padró, C. & Tyomkin, I., 1 Jan 2014, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, Proceedings. Springer Verlag, p. 394-418 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8349 LNAI).

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

    Open Access
    30 Scopus citations

  • Non-interactive secure multiparty computation

    Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S. & Paskin-Cherniavsky, A., 1 Jan 2014, Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 2 ed. Springer Verlag, p. 387-404 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8617 LNCS, no. PART 2).

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

    Open Access
    60 Scopus citations

  • On the cryptographic complexity of the worst functions

    Beimel, A., Ishai, Y., Kumaresan, R. & Kushilevitz, E., 1 Jan 2014, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, Proceedings. Springer Verlag, p. 317-342 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8349 LNAI).

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

    Open Access
    55 Scopus citations
  • 2013

    Characterizing the sample complexity of private learners

    Beimel, A., Nissim, K. & Stemmer, U., 11 Feb 2013, ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science. p. 97-109 13 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
    53 Scopus citations

  • Private learning and sanitization: Pure vs. approximate differential privacy

    Beimel, A., Nissim, K. & Stemmer, U., 15 Oct 2013, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. p. 363-378 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8096 LNCS).

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

    79 Scopus citations