Yuval Emek

Orcid: 0000-0002-3123-3451

Affiliations:
  • Technion - Israel Institute of Technology


According to our database1, Yuval Emek authored at least 84 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions.
SIAM J. Comput., 2024

Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes.
Math. Oper. Res., 2024

Barter Exchange with Bounded Trading Cycles.
CoRR, 2024

On the Power of Graphical Reconfigurable Circuits.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023
Deterministic Fault-Tolerant Connectivity Labeling Scheme.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Beeping Shortest Paths via Hypergraph Bipartite Decomposition.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Online Algorithms with Randomly Infused Advice.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions.
Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

2022
Special Issue: Biological Distributed Algorithms 2021.
J. Comput. Biol., 2022

Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time.
CoRR, 2022

Locally Restricted Proof Labeling Schemes (Full Version).
CoRR, 2022

Locally Restricted Proof Labeling Schemes.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021
Fully Adaptive Self-Stabilizing Transformer for LCL Problems.
CoRR, 2021

Hierarchical b-Matching.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Online Paging with a Vanishing Regret.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Multicast Communications with Varying Bandwidth Constraints.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020
Dynamic networks of finite state machines.
Theor. Comput. Sci., 2020

Bayesian generalized network design.
Theor. Comput. Sci., 2020

A tight lower bound for the capture time of the Cops and Robbers game.
Theor. Comput. Sci., 2020

Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency.
J. ACM, 2020

Communication Efficient Self-Stabilizing Leader Election (Full Version).
CoRR, 2020

Exploitation of Multiple Replenishing Resources with Uncertainty.
CoRR, 2020

No-Regret Stateful Posted Pricing.
CoRR, 2020

Twenty-Two New Approximate Proof Labeling Schemes.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Communication Efficient Self-Stabilizing Leader Election.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Low Diameter Graph Decompositions by Approximate Distance Computation.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Minimum cost perfect matching with delays for two sources.
Theor. Comput. Sci., 2019

Maximizing Communication Throughput in Tree Networks.
CoRR, 2019

Stable Secretaries.
Algorithmica, 2019

Distributed Algorithms for Low Stretch Spanning Trees.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Message Reduction in the LOCAL Model is a Free Lunch.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Towards Distributed Two-Stage Stochastic Optimization.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Deterministic Leader Election in Programmable Matter.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Online Disjoint Set Cover Without Prior Knowledge.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Selecting a Leader in a Network of Finite State Machines.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

The Synergy of Finite State Machines.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Efficient Jobs Dispatching in Emerging Clouds.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
Brief Announcement: The Synergy of Finite State Machines.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Exploring an Infinite Space with Finite Memory Scouts.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Semi-Streaming Set Cover.
ACM Trans. Algorithms, 2016

Space-Constrained Interval Selection.
ACM Trans. Algorithms, 2016

On the effect of the deployment setting on broadcasting in Euclidean radio networks.
Distributed Comput., 2016

Online matching: haste makes waste!
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
How many ants does it take to find the food?
Theor. Comput. Sci., 2015

The Price of Matching with Metric Preferences.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Signaling Schemes for Revenue Maximization.
ACM Trans. Economics and Comput., 2014

Anonymous networks: randomization = 2-hop coloring.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Semi-Streaming Set Cover - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Solving the ANTS Problem with Asynchronous Finite State Machines.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Adversarial Leakage in Games.
SIAM J. Discret. Math., 2013

Ants: Mobile Finite State Machines.
CoRR, 2013

Frequency Hopping against a Powerful Adversary.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Stone age distributed computing.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Computing optimal contracts in combinatorial agencies.
Theor. Comput. Sci., 2012

Bayesian ignorance.
Theor. Comput. Sci., 2012

Online Set Packing.
SIAM J. Comput., 2012

SINR Diagrams: Convexity and Its Applications in Wireless Networks.
J. ACM, 2012

Sparse reliable graph backbones.
Inf. Comput., 2012

Stone Age Distributed Computing
CoRR, 2012

Notions of Connectivity in Overlay Networks.
Proceedings of the Structural Information and Communication Complexity, 2012

2011
Online computation with advice.
Theor. Comput. Sci., 2011

New bounds for the controller problem.
Distributed Comput., 2011

Stability vs. Cost of Matchings
CoRR, 2011

<i>k</i>-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.
Algorithmica, 2011

Approximating the Statistics of various Properties in Randomly Weighted Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Mechanisms for multi-level marketing.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Economical Graph Discovery.
Proceedings of the Innovations in Computer Science, 2011

2010
A near-linear-time algorithm for computing replacement paths in planar directed graphs.
ACM Trans. Algorithms, 2010

On the additive constant of the k-server Work Function Algorithm.
Inf. Process. Lett., 2010

Efficient threshold detection in a distributed environment: extended abstract.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Online set packing and competitive scheduling of multi-part tasks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs.
SIAM J. Discret. Math., 2009

Broadcasting in UDG radio networks with unknown topology.
Distributed Comput., 2009

Computing the Expected Values of some Properties of Randomly Weighted Graphs
CoRR, 2009

Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the Additive Constant of the <i>k</i>-Server Work Function Algorithm.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Brief announcement: new bounds for the controller problem.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

SINR diagrams: towards algorithmically usable SINR models of wireless networks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs.
SIAM J. Comput., 2008

Lower-Stretch Spanning Trees.
SIAM J. Comput., 2008


  Loading...