Search results for "Yuval Emek"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg	Sparse reliable graph backbones.	Inf. Comput.	2012	DBLP DOI BibTeX RDF
1	Yuval Emek, Magnús M. Halldórsson, Adi Rosén	Space-Constrained Interval Selection	CoRR	2012	DBLP BibTeX RDF
1	Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz	Signaling Schemes for Revenue Maximization	CoRR	2012	DBLP BibTeX RDF
1	Yuval Emek, Jasmin Smula, Roger Wattenhofer	Stone Age Distributed Computing	CoRR	2012	DBLP BibTeX RDF
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	Online computation with advice.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Yuval Emek, Tobias Langner, Roger Wattenhofer	Stability vs. Cost of Matchings	CoRR	2011	DBLP BibTeX RDF
1	Yuval Emek, Amos Korman	New bounds for the controller problem.	Distributed Computing	2011	DBLP DOI BibTeX RDF
1	Yuval Emek, Amos Korman, Yuval Shavitt	Approximating the Statistics of various Properties in Randomly Weighted Graphs.	SODA	2011	DBLP BibTeX RDF
1	Yuval Emek, Ron Karidi, Moshe Tennenholtz, Aviv Zohar	Mechanisms for multi-level marketing.	ACM Conference on Electronic Commerce	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Economical Graph Discovery.	ICS	2011	DBLP BibTeX RDF
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	On the additive constant of the k-server Work Function Algorithm.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Yuval Emek, David Peleg, Liam Roditty	A near-linear-time algorithm for computing replacement paths in planar directed graphs.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg	Sparse Reliable Graph Backbones.	ICALP	2010	DBLP DOI BibTeX RDF
1	Yuval Emek, Amos Korman	Efficient threshold detection in a distributed environment: extended abstract.	PODC	2010	DBLP DOI BibTeX RDF	threshold detection, transmission complexity, message complexity
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Bayesian ignorance.	PODC	2010	DBLP DOI BibTeX RDF	local vs. global view, network cost sharing, bayesian games
1	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	DBLP DOI BibTeX RDF	multi-packet frames, online set packing, packet fragmentation, competitive analysis
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Adversarial Leakage in Games.	ICS	2010	DBLP BibTeX RDF
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	On the Additive Constant of the k-server Work Function Algorithm	CoRR	2009	DBLP BibTeX RDF
1	Yuval Emek, Amos Korman, Yuval Shavitt	Computing the Expected Values of some Properties of Randomly Weighted Graphs	CoRR	2009	DBLP BibTeX RDF
1	Yuval Emek, David Peleg	A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su	Broadcasting in UDG radio networks with unknown topology.	Distributed Computing	2009	DBLP DOI BibTeX RDF	Ad hoc networks, Broadcasting, Radio networks, Unit disk graphs
1	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Michal Feldman	Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies.	WINE	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	Online Computation with Advice.	ICALP	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Amos Korman	New Bounds for the Controller Problem.	DISC	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Amos Korman	Brief announcement: new bounds for the controller problem.	PODC	2009	DBLP DOI BibTeX RDF	controller, dynamic networks
1	Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty	SINR diagrams: towards algorithmically usable SINR models of wireless networks.	PODC	2009	DBLP DOI BibTeX RDF	reception zone, wireless networks, SINR
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	On the Additive Constant of the k-Server Work Function Algorithm.	WAOA	2009	DBLP DOI BibTeX RDF
1	Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty	SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks	CoRR	2008	DBLP BibTeX RDF
1	Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng	Lower-Stretch Spanning Trees.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Yuval Emek, David Peleg	Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Yuval Emek, David Peleg, Liam Roditty	A near-linear time algorithm for computing replacement paths in planar directed graphs.	SODA	2008	DBLP DOI BibTeX RDF
1	Yuval Emek, Erez Kantor, David Peleg	On the effect of the deployment setting on broadcasting in Euclidean radio networks.	PODC	2008	DBLP DOI BibTeX RDF
1	Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su	Broadcasting in udg radio networks with unknown topology.	PODC	2007	DBLP DOI BibTeX RDF	ad hoc networks, broadcasting, radio networks, unit disk graphs
1	Yuval Emek, David Peleg	A tight upper bound on the probabilistic embedding of series-parallel graphs.	SODA	2006	DBLP DOI BibTeX RDF
1	Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng	Lower-stretch spanning trees.	STOC	2005	DBLP DOI BibTeX RDF	low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics
1	Yuval Emek, David Peleg	Approximating Minimum Max-Stretch spanning Trees on unweighted graphs.	SODA	2004	DBLP DOI BibTeX RDF

Publications of "Yuval Emek" ( http://dblp.L3S.de/Authors/Yuval_Emek )