 | 2012 |
| 38 |  | Yuval Emek,
Jasmin Smula,
Roger Wattenhofer:
Stone Age Distributed Computing
CoRR abs/1202.1186: (2012) |
| 37 |  | Yuval Emek,
Michal Feldman,
Iftah Gamzu,
Renato Paes Leme,
Moshe Tennenholtz:
Signaling Schemes for Revenue Maximization
CoRR abs/1202.1590: (2012) |
| 36 |  | Yuval Emek,
Magnús M. Halldórsson,
Adi Rosén:
Space-Constrained Interval Selection
CoRR abs/1202.4326: (2012) |
| 35 |  | Shiri Chechik,
Yuval Emek,
Boaz Patt-Shamir,
David Peleg:
Sparse reliable graph backbones.
Inf. Comput. 210: 31-39 (2012) |
| 2011 |
| 34 |  | Yuval Emek,
Ron Karidi,
Moshe Tennenholtz,
Aviv Zohar:
Mechanisms for multi-level marketing.
ACM Conference on Electronic Commerce 2011: 209-218 |
| 33 |  | Noga Alon,
Yuval Emek,
Michal Feldman,
Moshe Tennenholtz:
Economical Graph Discovery.
ICS 2011: 476-486 |
| 32 |  | Yuval Emek,
Amos Korman,
Yuval Shavitt:
Approximating the Statistics of various Properties in Randomly Weighted Graphs.
SODA 2011: 1455-1467 |
| 31 |  | Yuval Emek:
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.
Algorithmica 61(1): 141-160 (2011) |
| 30 |  | Yuval Emek,
Tobias Langner,
Roger Wattenhofer:
Stability vs. Cost of Matchings
CoRR abs/1112.4632: (2011) |
| 29 |  | Yuval Emek,
Amos Korman:
New bounds for the controller problem.
Distributed Computing 24(3-4): 177-186 (2011) |
| 28 |  | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
Online computation with advice.
Theor. Comput. Sci. 412(24): 2642-2656 (2011) |
| 2010 |
| 27 |  | Shiri Chechik,
Yuval Emek,
Boaz Patt-Shamir,
David Peleg:
Sparse Reliable Graph Backbones.
ICALP (2) 2010: 261-272 |
| 26 |  | Noga Alon,
Yuval Emek,
Michal Feldman,
Moshe Tennenholtz:
Adversarial Leakage in Games.
ICS 2010: 111-119 |
| 25 |  | Yuval Emek,
Amos Korman:
Efficient threshold detection in a distributed environment: extended abstract.
PODC 2010: 183-191 |
| 24 |  | Noga Alon,
Yuval Emek,
Michal Feldman,
Moshe Tennenholtz:
Bayesian ignorance.
PODC 2010: 384-391 |
| 23 |  | Yuval Emek,
Magnús M. Halldórsson,
Yishay Mansour,
Boaz Patt-Shamir,
Jaikumar Radhakrishnan,
Dror Rawitz:
Online set packing and competitive scheduling of multi-part tasks.
PODC 2010: 440-449 |
| 22 |  | Yuval Emek,
David Peleg,
Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs.
ACM Transactions on Algorithms 6(4): (2010) |
| 21 |  | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
On the additive constant of the k-server Work Function Algorithm.
Inf. Process. Lett. 110(24): 1120-1123 (2010) |
| 2009 |
| 20 |  | Yuval Emek,
Amos Korman:
New Bounds for the Controller Problem.
DISC 2009: 22-34 |
| 19 |  | Yuval Emek:
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.
ESA 2009: 203-214 |
| 18 |  | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
Online Computation with Advice.
ICALP (1) 2009: 427-438 |
| 17 |  | Chen Avin,
Yuval Emek,
Erez Kantor,
Zvi Lotker,
David Peleg,
Liam Roditty:
SINR diagrams: towards algorithmically usable SINR models of wireless networks.
PODC 2009: 200-209 |
| 16 |  | Yuval Emek,
Amos Korman:
Brief announcement: new bounds for the controller problem.
PODC 2009: 340-341 |
| 15 |  | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm.
WAOA 2009: 128-134 |
| 14 |  | Yuval Emek,
Michal Feldman:
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies.
WINE 2009: 268-279 |
| 13 |  | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
On the Additive Constant of the k-server Work Function Algorithm
CoRR abs/0902.1378: (2009) |
| 12 |  | Yuval Emek,
Amos Korman,
Yuval Shavitt:
Computing the Expected Values of some Properties of Randomly Weighted Graphs
CoRR abs/0908.0968: (2009) |
| 11 |  | Yuval Emek,
Leszek Gasieniec,
Erez Kantor,
Andrzej Pelc,
David Peleg,
Chang Su:
Broadcasting in UDG radio networks with unknown topology.
Distributed Computing 21(5): 331-351 (2009) |
| 10 |  | Yuval Emek,
David Peleg:
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs.
SIAM J. Discrete Math. 23(4): 1827-1841 (2009) |
| 2008 |
| 9 |  | Yuval Emek,
Erez Kantor,
David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks.
PODC 2008: 223-232 |
| 8 |  | Yuval Emek,
David Peleg,
Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs.
SODA 2008: 428-435 |
| 7 |  | Chen Avin,
Yuval Emek,
Erez Kantor,
Zvi Lotker,
David Peleg,
Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks
CoRR abs/0811.3284: (2008) |
| 6 |  | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees.
SIAM J. Comput. 38(2): 608-628 (2008) |
| 5 |  | Yuval Emek,
David Peleg:
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs.
SIAM J. Comput. 38(5): 1761-1781 (2008) |
| 2007 |
| 4 |  | Yuval Emek,
Leszek Gasieniec,
Erez Kantor,
Andrzej Pelc,
David Peleg,
Chang Su:
Broadcasting in udg radio networks with unknown topology.
PODC 2007: 195-204 |
| 2006 |
| 3 |  | Yuval Emek,
David Peleg:
A tight upper bound on the probabilistic embedding of series-parallel graphs.
SODA 2006: 1045-1053 |
| 2005 |
| 2 |  | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-stretch spanning trees.
STOC 2005: 494-503 |
| 2004 |
| 1 |  | Yuval Emek,
David Peleg:
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs.
SODA 2004: 261-270 |