Yuval Emek

Assoc. Prof.

Former affiliation
    • 1220
      Citations
    20052024

    Research activity per year

    Search results

    • 2016

      Space-constrained interval selection

      Emek, Y., Halldórsson, M. M. & Rosén, A., Sep 2016, In: ACM Transactions on Algorithms. 12, 4, 51.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • 2015

      How many ants does it take to find the food?

      Emek, Y., Langner, T., Stolz, D., Uitto, J. & Wattenhofer, R., 1 Dec 2015, In: Theoretical Computer Science. 608, p. 255-267 13 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • The price of matching with metric preferences

      Emek, Y., Langner, T. & Wattenhofer, R., 2015, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Bansal, N. & Finocchi, I. (eds.). p. 459-470 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2014

      Anonymous networks: Randomization = 2-hop coloring

      Emek, Y., Pfister, C., Seidel, J. & Wattenhofer, R., 2014, PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing. p. 96-105 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Biological distributed computing

      Emek, Y., 2014, Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings. p. XV-XVI (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8576 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Computability in anonymous networks: Revocable vs. irrecovable outputs

      Emek, Y., Seidel, J. & Wattenhofer, R., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2 ed. p. 183-195 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8573 LNCS, no. PART 2).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Economical Graph Discovery

      Alon, N., Emek, Y., Feldman, M. & Tennenholtz, M., 1 Dec 2014, In: Operations Research. 62, 6, p. 1236-1246

      Research output: Contribution to journalArticlepeer-review

    • How many ants does it take to find the food?

      Emek, Y., Langner, T., Stolz, D., Uitto, J. & Wattenhofer, R., 2014, Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings. p. 263-278 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8576 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Semi-streaming set cover

      Emek, Y. & Rosén, A., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. p. 453-464 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • Semi-Streaming Set Cover - (Extended Abstract)

      Emek, Y. & Rosén, A., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Vol. 8572. p. 453-464 12 p. (Lecture Notes in Computer Science).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Signaling schemes for revenue maximization

      Emek, Y., Feldman, M., Gamzu, I., Paes Leme, R. & Tennenholtz, M., Jun 2014, In: ACM Transactions on Economics and Computation. 2, 2, 5.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • Solving the ANTS problem with asynchronous finite state machines

      Emek, Y., Langner, T., Uitto, J. & Wattenhofer, R., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2 ed. p. 471-482 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8573 LNCS, no. PART 2).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2013

      Adversarial Leakage in Games

      Alon, N., Emek, Y., Feldman, M. & Tennenholtz, M., 1 Jan 2013, In: SIAM Journal on Discrete Mathematics. 27, 1, p. 363-385

      Research output: Contribution to journalArticlepeer-review

    • Frequency hopping against a powerful adversary

      Emek, Y. & Wattenhofer, R., 2013, Distributed Computing - 27th International Symposium, DISC 2013, Proceedings. p. 329-343 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8205 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • Stone age distributed computing

      Emek, Y. & Wattenhofer, R., 2013, PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. p. 137-146 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • 2012

      Bayesian ignorance

      Alon, N., Emek, Y., Feldman, M. & Tennenholtz, M., 21 Sep 2012, In: Theoretical Computer Science. 452, p. 1-11 11 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • Computing optimal contracts in combinatorial agencies

      Emek, Y. & Feldman, M., 21 Sep 2012, In: Theoretical Computer Science. 452, p. 56-74 19 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • Notions of connectivity in overlay networks

      Emek, Y., Fraigniaud, P., Korman, A., Kutten, S. & Peleg, D., 2012, Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings. p. 25-35 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7355 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • Online set packing

      Emekj, Y., Halldórsson, M. M., Mansour, Y., Patt-Shamir, B., Radhakrishnan, J. & Rawitz, D., 2012, In: SIAM Journal on Computing. 41, 4, p. 728-746 19 p.

      Research output: Contribution to journalArticlepeer-review

    • Signaling schemes for revenue maximization

      Emek, Y., Feldman, M., Gamzu, I., Paes Leme, R. & Tennenholtz, M., 2012, EC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce. p. 514-531 18 p. (Proceedings of the ACM Conference on Electronic Commerce).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • SINR Diagrams: Convexity and its applications in wireless networks

      Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D. & Roditty, L., Aug 2012, In: Journal of the ACM. 59, 4, 18.

      Research output: Contribution to journalArticlepeer-review

    • Space-constrained interval selection

      Emek, Y., Halldórsson, M. M. & Rosén, A., 2012, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1 ed. p. 302-313 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 proceedingConference contributionpeer-review

      Open Access
    • Sparse reliable graph backbones

      Chechik, S., Emek, Y., Patt-Shamir, B. & Peleg, D., Jan 2012, In: Information and Computation. 210, p. 31-39 9 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • 2011

      Approximating the statistics of various properties in randomly weighted graphs

      Emek, Y., Korman, A. & Shavitt, Y., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. p. 1455-1467 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • K-outerplanar graphs, planar duality, and low stretch spanning trees

      Emek, Y., Sep 2011, In: Algorithmica (New York). 61, 1, p. 141-160 20 p.

      Research output: Contribution to journalArticlepeer-review

    • Mechanisms for multi-level marketing

      Emek, Y., Karidi, R., Tennenholtz, M. & Zohar, A., 2011, EC'11 - Proceedings of the 12th ACM Conference on Electronic Commerce. p. 209-218 10 p. (Proceedings of the ACM Conference on Electronic Commerce).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • New bounds for the controller problem

      Emek, Y. & Korman, A., Nov 2011, In: Distributed Computing. 24, 3-4, p. 177-186 10 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • Online computation with advice

      Emek, Y., Fraigniaud, P., Korman, A. & Rosén, A., 27 May 2011, In: Theoretical Computer Science. 412, 24, p. 2642-2656 15 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • 2010

      A near-linear-time algorithm for computing replacement paths in planar directed graphs

      Emek, Y., Roditty, L. & Peleg, D., Aug 2010, In: ACM Transactions on Algorithms. 6, 4, 64.

      Research output: Contribution to journalArticlepeer-review

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

    • Efficient threshold detection in a distributed environment

      Emek, Y. & Korman, A., 2010, PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. p. 183-191 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Online set packing and competitive scheduling of multi-part tasks

      Emek, Y., Halldórsson, M. M., Mansour, Y., Patt-Shamir, B., Radhakrishnan, J. & Rawitz, D., 2010, PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. p. 440-449 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • On the additive constant of the k-server Work Function Algorithm

      Emek, Y., Fraigniaud, P., Korman, A. & Rosén, A., 30 Nov 2010, In: Information Processing Letters. 110, 24, p. 1120-1123 4 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • Sparse reliable graph backbones

      Chechik, S., Emek, Y., Patt-Shamir, B. & Peleg, D., 2010, Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2 ed. p. 261-272 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6199 LNCS, no. PART 2).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2009

      A tight upper bound on the probabilistic embedding of series-parallel graphs

      Emek, Y. & Peleg, D., 2009, In: SIAM Journal on Discrete Mathematics. 23, 4, p. 1827-1841 15 p.

      Research output: Contribution to journalArticlepeer-review

    • Brief announcement: New bounds for the controller problem

      Emek, Y. & Kormany, A., 2009, PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing. p. 340-341 2 p. 1582799. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Broadcasting in UDG radio networks with unknown topology

      Emek, Y., Ga̧sieniec, L., Kantor, E., Pelc, A., Peleg, D. & Su, C., Feb 2009, In: Distributed Computing. 21, 5, p. 331-351 21 p.

      Research output: Contribution to journalArticlepeer-review

    • Computing optimal contracts in series-parallel heterogeneous combinatorial agencies

      Emek, Y. & Feldman, M., 2009, Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. p. 268-279 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5929 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • K-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

      Emek, Y., 2009, Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings. p. 203-214 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5757 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • New bounds for the controller problem

      Emek, Y. & Korman, A., 2009, Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings. p. 22-34 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5805 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Online computation with advice

      Emek, Y., Fraigniaud, P., Korman, A. & Rosén, A., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 427-438 12 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 contributionpeer-review

    • On the additive constant of the κ-server work function algorithm

      Emek, Y., Fraigniaud, P., Korman, A. & Rosén, A., 2009, Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. p. 128-134 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5893 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • SINR diagrams: Towards algorithmically usable SINR models of wireless networks

      Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D. & Roditty, L., 2009, PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing. p. 200-209 10 p. 1582750. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2008

      A near-linear time algorithm for computing replacement paths in planar directed graphs

      Emek, Y., Peleg, D. & Roditty, L., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 428-435 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • Approximating minimum max-stretch spanning trees on unweighted graphs

      Emek, Y. & Peleg, D., 2008, In: SIAM Journal on Computing. 38, 5, p. 1761-1781 21 p.

      Research output: Contribution to journalArticlepeer-review

    • Lower-stretch spanning trees

      Elkin, M., Emek, Y., Spielman, D. A. & Teng, S. H., 2008, In: SIAM Journal on Computing. 38, 2, p. 608-628 21 p.

      Research output: Contribution to journalArticlepeer-review

      Open Access
    • On the effect of the deployment setting on broadcasting in Euclidean radio networks

      Emek, Y., Kantor, E. & Peleg, D., 2008, PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing. p. 223-231 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2007

      Broadcasting in udg radio networks with unknown topology

      Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D. & Su, C., 2007, PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. p. 195-204 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2006

      A tight upper bound on the probabilistic embedding of series-parallel graphs

      Emek, Y. & Peleg, D., 2006, In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 1045-1053 9 p.

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2005

      Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

      Emek, Y. & Peleg, D., 2005, p. 254-263. 10 p.

      Research output: Contribution to conferencePaperpeer-review