default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEyal Lubetzky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j23]Yahav Alon, Michael Krivelevich, Eyal Lubetzky:
Cycle lengths in sparse random graphs. Random Struct. Algorithms 61(3): 444-461 (2022)- 2020
- [j22]Reza Gheissari, Eyal Lubetzky:
Quasi-polynomial mixing of critical two-dimensional random cluster models. Random Struct. Algorithms 56(2): 517-556 (2020) - [j21]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56(4): 927-947 (2020) - 2018
- [j20]Yossi Azar, Eric Horvitz, Eyal Lubetzky, Yuval Peres, Dafna Shahaf:
Tractable near-optimal policies for crawling. Proc. Natl. Acad. Sci. USA 115(32): 8099-8103 (2018) - 2017
- [j19]Eyal Lubetzky, Yufei Zhao:
On the variational problem for upper tails in sparse random graphs. Random Struct. Algorithms 50(3): 420-436 (2017) - 2016
- [j18]Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald:
The threshold for combs in random graphs. Random Struct. Algorithms 48(4): 794-802 (2016) - 2015
- [j17]Eyal Lubetzky, Yufei Zhao:
On replica symmetry of large deviations in random graphs. Random Struct. Algorithms 47(1): 109-146 (2015) - 2014
- [j16]Jian Ding, Eyal Lubetzky, Yuval Peres:
Anatomy of the giant component: The strictly supercritical regime. Eur. J. Comb. 35: 155-168 (2014) - [j15]Colin Cooper, Alan M. Frieze
, Eyal Lubetzky:
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45(4): 627-674 (2014) - 2013
- [j14]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43(1): 1-15 (2013) - [j13]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate. IEEE Trans. Inf. Theory 59(9): 5811-5823 (2013) - 2011
- [j12]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Anatomy of a young giant component in the random graph. Random Struct. Algorithms 39(2): 139-178 (2011) - 2010
- [j11]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19(5-6): 729-751 (2010) - [j10]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37(1): 1-24 (2010) - 2009
- [j9]Noga Alon, Eyal Lubetzky:
Uniformly cross intersecting families. Comb. 29(4): 389-431 (2009) - [j8]Eyal Lubetzky, Uri Stav:
Nonlinear index coding outperforming the linear optimum. IEEE Trans. Inf. Theory 55(8): 3544-3551 (2009) - 2008
- [j7]Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky:
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008) - 2007
- [j6]Noga Alon, Eyal Lubetzky:
Codes And Xor Graph Products. Comb. 27(1): 13-33 (2007) - [j5]Noga Alon, Eyal Lubetzky:
Privileged users in zero-error transmission over a noisy channel. Comb. 27(6): 737-743 (2007) - [j4]Noga Alon, Eyal Lubetzky:
Independent sets in tensor graph powers. J. Graph Theory 54(1): 73-87 (2007) - [j3]Tomer Amiaz, Eyal Lubetzky, Nahum Kiryati:
Coarse to over-fine optical flow estimation. Pattern Recognit. 40(9): 2496-2503 (2007) - [j2]Noga Alon, Eyal Lubetzky:
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. SIAM J. Discret. Math. 21(2): 329-348 (2007) - 2006
- [j1]Noga Alon, Eyal Lubetzky:
The Shannon capacity of a graph and the independence numbers of its powers. IEEE Trans. Inf. Theory 52(5): 2172-2176 (2006)
Conference and Workshop Papers
- 2019
- [c10]Andrey Kolobov, Yuval Peres, Eyal Lubetzky, Eric Horvitz:
Optimal Freshness Crawl Under Politeness Constraints. SIGIR 2019: 495-504 - 2018
- [c9]Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres:
Comparing mixing times on sparse random graphs. SODA 2018: 1734-1740 - [c8]Reza Gheissari, Eyal Lubetzky, Yuval Peres:
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. SODA 2018: 1981-1988 - 2012
- [c7]Po-Shen Loh, Eyal Lubetzky:
Stochastic coalescence in logarithmic time. SODA 2012: 541-550 - 2011
- [c6]Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda:
Optimal Discovery Strategies in White Space Networks. ESA 2011: 713-722 - [c5]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Lexicographic Products and the Power of Non-linear Network Coding. FOCS 2011: 609-618 - 2009
- [c4]Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich:
Choice-Memory Tradeoff in Allocations. FOCS 2009: 230-238 - 2008
- [c3]Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim:
Broadcasting with Side Information. FOCS 2008: 823-832 - 2007
- [c2]Eyal Lubetzky, Uri Stav:
Non-Linear Index Coding Outperforming the Linear Optimum. FOCS 2007: 161-168 - 2001
- [c1]Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman:
The Multicast Bandwidth Advantage in Serving a Web Site. Networked Group Communication 2001: 88-99
Informal and Other Publications
- 2011
- [i8]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
Random greedy triangle-packing beyond the 7/4 barrier. CoRR abs/1108.1781 (2011) - [i7]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Lexicographic products and the power of non-linear network coding. CoRR abs/1108.2489 (2011) - 2010
- [i6]Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky:
Index coding via linear programming. CoRR abs/1004.1379 (2010) - [i5]Tom Bohman, Alan M. Frieze, Eyal Lubetzky:
A note on the random greedy triangle-packing algorithm. CoRR abs/1004.2418 (2010) - [i4]Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda:
Optimal whitespace synchronization strategies. CoRR abs/1006.3334 (2010) - 2008
- [i3]Eyal Lubetzky, Uri Stav:
Non-linear index coding outperforming the linear optimum. CoRR abs/0806.1919 (2008) - [i2]Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein:
Broadcasting with side information. CoRR abs/0806.3246 (2008) - 2006
- [i1]Noga Alon, Eyal Lubetzky:
The Shannon capacity of a graph and the independence numbers of its powers. CoRR abs/cs/0608021 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
