Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItai Benjamini
Person information
- affiliation: Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j21]Itai Benjamini, Shoni Gilboa
:
The Maximal Number of 3-Term Arithmetic Progressions in Finite Sets in Different Geometries. Discret. Comput. Geom. 69(2): 543-567 (2023)- 2022
- [j20]Itai Benjamini, John Haslegrave:
Degrees in Link Graphs of Regular Graphs. Electron. J. Comb. 29(2) (2022) - 2018
- [j19]Omer Angel, Itai Benjamini, Nizan Horesh:
An Isoperimetric Inequality for Planar Triangulations. Discret. Comput. Geom. 59(4): 802-809 (2018) - 2017
- [j18]Itai Benjamini, Hilary K. Finucane, Romain Tessera:
On the scaling limit of finite vertex transitive graphs with large diameter. Comb. 37(3): 333-374 (2017) - 2016
- [j17]Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen:
Juntas in the ℓ1-grid and Lipschitz maps between discrete tori. Random Struct. Algorithms 49(2): 253-279 (2016) - 2015
- [j16]Michel Benaïm, Itai Benjamini, Jun Chen, Yuri Lima:
A generalized Pólya's urn with graph based interactions. Random Struct. Algorithms 46(4): 614-634 (2015) - 2014
- [j15]Itai Benjamini, Gady Kozma, Nicholas C. Wormald:
The mixing time of the giant component of a random graph. Random Struct. Algorithms 45(3): 383-407 (2014) - [j14]Itai Benjamini, Igor Shinkar, Gilad Tsur:
Acquaintance Time of a Graph. SIAM J. Discret. Math. 28(2): 767-785 (2014) - 2013
- [j13]Itai Benjamini, Van Cyr, Eviatar B. Procaccia, Ran J. Tessler:
Harmonic labeling of graphs. Discret. Math. 313(17): 1726-1745 (2013) - 2011
- [j12]Itai Benjamini, Nicolas Curien:
On limits of graphs sphere packed in Euclidean space and applications. Eur. J. Comb. 32(7): 975-984 (2011) - [j11]Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald:
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66(2): 115-136 (2011) - 2008
- [j10]Itai Benjamini, Noam Berger, Ariel Yadin:
Long-Range Percolation Mixing Time. Comb. Probab. Comput. 17(4): 487-494 (2008) - [j9]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008) - [j8]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
- [j7]Omer Angel, Itai Benjamini:
A phase transition for the metric distortion of percolation on the hypercube. Comb. 27(6): 645-658 (2007) - 2006
- [j6]Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos:
Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. 15(5): 673-683 (2006) - 2005
- [j5]Itai Benjamini, Gady Kozma:
A Resistance Bound Via An Isoperimetric Inequality. Comb. 25(6): 645-650 (2005) - [j4]Itai Benjamini, Christopher Hoffman:
ω-Periodic Graphs. Electron. J. Comb. 12 (2005) - 2001
- [j3]Itai Benjamini, Noam Berger:
The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms 19(2): 102-111 (2001) - 2000
- [j2]Itai Benjamini, Olle Häggström, Elchanan Mossel:
On Random Graph Homomorphisms into Z. J. Comb. Theory, Ser. B 78(1): 86-114 (2000) - [j1]Itai Benjamini, Gideon Schechtman:
Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. Random Struct. Algorithms 17(1): 20-25 (2000)
Conference and Workshop Papers
- 2014
- [c5]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. FOCS 2014: 81-89 - 2008
- [c4]Itai Benjamini, Oded Schramm, Asaf Shapira:
Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402 - 2005
- [c3]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. PODC 2005: 209-217 - [c2]Itai Benjamini, Oded Schramm, David Bruce Wilson:
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. STOC 2005: 244-250 - 2002
- [c1]Itai Benjamini, László Lovász:
Global Information from Local Observation. FOCS 2002: 701-710
Parts in Books or Collections
- 2020
- [p1]Itai Benjamini, Oded Goldreich:
Pseudo-mixing Time of Random Walks. Computational Complexity and Property Testing 2020: 363-373
Informal and Other Publications
- 2022
- [i8]Itai Benjamini, Maksim Zhukovskii:
A very sharp threshold for first order logic distinguishability of random graphs. CoRR abs/2207.11593 (2022) - 2019
- [i7]Itai Benjamini, Oded Goldreich:
Pseudo-Mixing Time of Random Walks. Electron. Colloquium Comput. Complex. TR19 (2019) - 2013
- [i6]Itai Benjamini, Igor Shinkar, Gilad Tsur:
Acquaintance Time of a Graph. CoRR abs/1302.2787 (2013) - [i5]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. CoRR abs/1310.2017 (2013) - [i4]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. Electron. Colloquium Comput. Complex. TR13 (2013) - 2009
- [i3]Itai Benjamini, Yury Makarychev:
Balanced Allocation: Memory Performance Tradeoffs. CoRR abs/0901.1155 (2009) - 2008
- [i2]Itai Benjamini, Oded Schramm, Asaf Shapira:
Every Minor-Closed Property of Sparse Graphs is Testable. Electron. Colloquium Comput. Complex. TR08 (2008) - 2004
- [i1]Itai Benjamini, Oded Schramm, David Bruce Wilson:
Balanced Boolean functions that can be evaluated so that every input bit is unlikely to be read. CoRR math.PR/0410282 (2004)
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-07 22:28 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:
