Yuval Emek

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 70

Top Venues

Publications

Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. Math. Oper. Res. 49 (2) (2024)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53 (2) (2024)
Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid
Online Algorithms with Randomly Infused Advice. ESA (2023)
Anne Condon, Yuval Emek, Noga Harlev
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. CoRR (2023)
Anne Condon, Yuval Emek, Noga Harlev
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions. DNA (2023)
Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
Deterministic Fault-Tolerant Connectivity Labeling Scheme. PODC (2023)
Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid
Online Algorithms with Randomly Infused Advice. CoRR (2023)
Fabien Dufoulon, Yuval Emek, Ran Gelles
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. ITCS (2023)
Yuval Emek, Yuval Gil, Noga Harlev
Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach. OPODIS (2022)
Fabien Dufoulon, Yuval Emek, Ran Gelles
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. CoRR (2022)
Yuval Emek, Saket Navlakha
Special Issue: Biological Distributed Algorithms 2021. J. Comput. Biol. 29 (4) (2022)
Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. CoRR (2022)
Yuval Emek, Yuval Gil, Shay Kutten
Locally Restricted Proof Labeling Schemes. DISC (2022)
Yuval Emek, Yuval Gil, Shay Kutten
Locally Restricted Proof Labeling Schemes (Full Version). CoRR (2022)
Yuval Emek, Shay Kutten, Yangguang Shi
Online Paging with a Vanishing Regret. ITCS (2021)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Multicast Communications with Varying Bandwidth Constraints. INFOCOM (2021)
Yuval Emek, Eyal Keren
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. CoRR (2021)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Fully Adaptive Self-Stabilizing Transformer for LCL Problems. CoRR (2021)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Hierarchical b-Matching. SOFSEM (2021)
Yuval Emek, Eyal Keren
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. PODC (2021)
Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. NeurIPS (2020)
Yuval Emek, Jara Uitto
Dynamic networks of finite state machines. Theor. Comput. Sci. 810 (2020)
Yuval Emek, Yuval Gil
Twenty-Two New Approximate Proof Labeling Schemes. DISC (2020)
Amos Korman, Yuval Emek, Simon Collet, Aya Goldshtein, Yossi Yovel
Exploitation of Multiple Replenishing Resources with Uncertainty. CoRR (2020)
Yuval Emek, Yuval Gil
Twenty-Two New Approximate Proof Labeling Schemes. CoRR (2020)
Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer
A tight lower bound for the capture time of the Cops and Robbers game. Theor. Comput. Sci. 839 (2020)
Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura
Communication Efficient Self-Stabilizing Leader Election. DISC (2020)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Bayesian generalized network design. Theor. Comput. Sci. 841 (2020)
Yuval Emek, Shay Kutten, Ron Lavi, Rad Niazadeh, Yangguang Shi
No-Regret Stateful Posted Pricing. CoRR (2020)
Yuval Emek, Shay Kutten, Yangguang Shi
Online Paging with a Vanishing Regret. CoRR (2020)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. J. ACM 67 (1) (2020)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS (2020)
Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura
Communication Efficient Self-Stabilizing Leader Election (Full Version). CoRR (2020)
Yossi Azar, Yuval Emek, Rob van Stee, Danny Vainstein
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. SPAA (2019)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Hierarchical b-Matching. CoRR (2019)
Ruben Becker, Yuval Emek, Christoph Lenzen
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR (2019)
Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr.
Deterministic Leader Election in Programmable Matter. ICALP (2019)
Yuval Emek, Noga Harlev, Taisuke Izumi
Towards Distributed Two-Stage Stochastic Optimization. OPODIS (2019)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Bayesian Generalized Network Design. ESA (2019)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Bayesian Generalized Network Design. CoRR (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the LOCAL Model is a Free Lunch. PODC (2019)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Distributed Algorithms for Low Stretch Spanning Trees. DISC (2019)
Yuval Emek, Adam Goldbraikh, Erez Kantor
Online Disjoint Set Cover Without Prior Knowledge. ESA (2019)
Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky
Stable Secretaries. Algorithmica 81 (8) (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the Local Model is a Free Lunch. CoRR (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the LOCAL Model Is a Free Lunch. DISC (2019)
Yuval Emek, Yaacov Shapiro, Yuyi Wang
Minimum cost perfect matching with delays for two sources. Theor. Comput. Sci. 754 (2019)
Yuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr.
Deterministic Leader Election in Programmable Matter. CoRR (2019)
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Maximizing Communication Throughput in Tree Networks. CoRR (2019)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. STOC (2018)
Yehuda Afek, Yuval Emek, Noa Kolikant
Selecting a Leader in a Network of Finite State Machines. CoRR (2018)
Shimon Bitton, Yuval Emek, Shay Kutten
Efficient Jobs Dispatching in Emerging Clouds. INFOCOM (2018)
Yehuda Afek, Yuval Emek, Noa Kolikant
The Synergy of Finite State Machines. OPODIS (2018)
Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. CoRR (2018)
Yehuda Afek, Yuval Emek, Noa Kolikant
Selecting a Leader in a Network of Finite State Machines. DISC (2018)
Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto
Exploring an Infinite Space with Finite Memory Scouts. CoRR (2017)
Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. ICALP (2017)
Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky
Stable Secretaries. EC (2017)
Yuval Emek, Yaacov Shapiro, Yuyi Wang
Minimum Cost Perfect Matching with Delays for Two Sources. CIAC (2017)
Lihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto
Exploring an Infinite Space with Finite Memory Scouts. SODA (2017)
Yehuda Afek, Yuval Emek, Noa Kolikant
Brief Announcement: The Synergy of Finite State Machines. DISC (2017)
Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky
Stable Secretaries. CoRR (2017)
Yuval Emek, Jara Uitto
Dynamic Networks of Finite State Machines. CoRR (2017)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection. ACM Trans. Algorithms 12 (4) (2016)
Yuval Emek, Erez Kantor, David Peleg
On the effect of the deployment setting on broadcasting in Euclidean radio networks. Distributed Comput. 29 (6) (2016)
Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek
Notions of Connectivity in Overlay Networks. CoRR (2016)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover. ACM Trans. Algorithms 13 (1) (2016)
Yuval Emek, Shay Kutten, Roger Wattenhofer
Online Matching: Haste makes Waste! CoRR (2016)
Yuval Emek, Jara Uitto
Dynamic Networks of Finite State Machines. SIROCCO (2016)
Yuval Emek, Shay Kutten, Roger Wattenhofer
Online matching: haste makes waste! STOC (2016)
Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer
How many ants does it take to find the food? Theor. Comput. Sci. 608 (2015)
Yuval Emek, Tobias Langner, Roger Wattenhofer
The Price of Matching with Metric Preferences. ESA (2015)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover - (Extended Abstract). ICALP (1) (2014)
Yuval Emek, Adi Rosén
Semi-Streaming Set Cover. CoRR (2014)
Yuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer
Anonymous networks: randomization = 2-hop coloring. PODC (2014)
Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz
Signaling Schemes for Revenue Maximization. ACM Trans. Economics and Comput. 2 (2) (2014)
Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
Solving the ANTS Problem with Asynchronous Finite State Machines. ICALP (2) (2014)
Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer
How Many Ants Does It Take to Find the Food? SIROCCO (2014)
Yuval Emek, Jochen Seidel, Roger Wattenhofer
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs. ICALP (2) (2014)
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
Adversarial Leakage in Games. SIAM J. Discret. Math. 27 (1) (2013)
Yuval Emek, Roger Wattenhofer
Stone age distributed computing. PODC (2013)
Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer
Ants: Mobile Finite State Machines. CoRR (2013)
Yuval Emek, Roger Wattenhofer
Frequency Hopping against a Powerful Adversary. DISC (2013)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg
Notions of Connectivity in Overlay Networks. SIROCCO (2012)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection CoRR (2012)
Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz
Online Set Packing. SIAM J. Comput. 41 (4) (2012)
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
Sparse reliable graph backbones. Inf. Comput. 210 (2012)
Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz
Signaling schemes for revenue maximization. EC (2012)
Yuval Emek, Michal Feldman
Computing optimal contracts in combinatorial agencies. Theor. Comput. Sci. 452 (2012)
Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty
SINR Diagrams: Convexity and Its Applications in Wireless Networks. J. ACM 59 (4) (2012)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection. ICALP (1) (2012)
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
Bayesian ignorance. Theor. Comput. Sci. 452 (2012)
Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz
Signaling Schemes for Revenue Maximization CoRR (2012)
Yuval Emek, Jasmin Smula, Roger Wattenhofer
Stone Age Distributed Computing CoRR (2012)
Yuval Emek, Ron Karidi, Moshe Tennenholtz, Aviv Zohar
Mechanisms for multi-level marketing. EC (2011)
Yuval Emek, Amos Korman
New bounds for the controller problem. Distributed Comput. 24 (3-4) (2011)
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
Economical Graph Discovery. ICS (2011)
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
Online computation with advice. Theor. Comput. Sci. 412 (24) (2011)
Yuval Emek, Amos Korman, Yuval Shavitt
Approximating the Statistics of various Properties in Randomly Weighted Graphs. SODA (2011)
Yuval Emek, Tobias Langner, Roger Wattenhofer
Stability vs. Cost of Matchings CoRR (2011)

Yuval Emek.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yuval Emek