default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Itai Benjamini
@article{DBLP:journals/dcg/BenjaminiG23,
author = {Itai Benjamini and
Shoni Gilboa},
title = {The Maximal Number of 3-Term Arithmetic Progressions in Finite Sets
in Different Geometries},
journal = {Discret. Comput. Geom.},
volume = {69},
number = {2},
pages = {543--567},
year = {2023},
url = {https://doi.org/10.1007/s00454-021-00365-6},
doi = {10.1007/S00454-021-00365-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BenjaminiG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BenjaminiH22,
author = {Itai Benjamini and
John Haslegrave},
title = {Degrees in Link Graphs of Regular Graphs},
journal = {Electron. J. Comb.},
volume = {29},
number = {2},
year = {2022},
url = {https://doi.org/10.37236/10561},
doi = {10.37236/10561},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BenjaminiH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-11593,
author = {Itai Benjamini and
Maksim Zhukovskii},
title = {A very sharp threshold for first order logic distinguishability of
random graphs},
journal = {CoRR},
volume = {abs/2207.11593},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.11593},
doi = {10.48550/ARXIV.2207.11593},
eprinttype = {arXiv},
eprint = {2207.11593},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-11593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/lncs/Benjamini020,
author = {Itai Benjamini and
Oded Goldreich},
editor = {Oded Goldreich},
title = {Pseudo-mixing Time of Random Walks},
booktitle = {Computational Complexity and Property Testing - On the Interplay Between
Randomness and Computation},
series = {Lecture Notes in Computer Science},
volume = {12050},
pages = {363--373},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-43662-9\_20},
doi = {10.1007/978-3-030-43662-9\_20},
timestamp = {Thu, 09 Apr 2020 11:37:49 +0200},
biburl = {https://dblp.org/rec/series/lncs/Benjamini020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiG19,
author = {Itai Benjamini and
Oded Goldreich},
title = {Pseudo-Mixing Time of Random Walks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-078}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/078},
eprinttype = {ECCC},
eprint = {TR19-078},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AngelBH18,
author = {Omer Angel and
Itai Benjamini and
Nizan Horesh},
title = {An Isoperimetric Inequality for Planar Triangulations},
journal = {Discret. Comput. Geom.},
volume = {59},
number = {4},
pages = {802--809},
year = {2018},
url = {https://doi.org/10.1007/s00454-017-9942-3},
doi = {10.1007/S00454-017-9942-3},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AngelBH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BenjaminiFT17,
author = {Itai Benjamini and
Hilary K. Finucane and
Romain Tessera},
title = {On the scaling limit of finite vertex transitive graphs with large
diameter},
journal = {Comb.},
volume = {37},
number = {3},
pages = {333--374},
year = {2017},
url = {https://doi.org/10.1007/s00493-015-2975-4},
doi = {10.1007/S00493-015-2975-4},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BenjaminiFT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiEFKS16,
author = {Itai Benjamini and
David Ellis and
Ehud Friedgut and
Nathan Keller and
Arnab Sen},
title = {Juntas in the \emph{{\(\mathscr{l}\)}}\({}_{\mbox{1}}\)-grid and Lipschitz
maps between discrete tori},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {253--279},
year = {2016},
url = {https://doi.org/10.1002/rsa.20623},
doi = {10.1002/RSA.20623},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiEFKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenaimBCL15,
author = {Michel Bena{\"{\i}}m and
Itai Benjamini and
Jun Chen and
Yuri Lima},
title = {A generalized P{\'{o}}lya's urn with graph based interactions},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {614--634},
year = {2015},
url = {https://doi.org/10.1002/rsa.20523},
doi = {10.1002/RSA.20523},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenaimBCL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiKW14,
author = {Itai Benjamini and
Gady Kozma and
Nicholas C. Wormald},
title = {The mixing time of the giant component of a random graph},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {383--407},
year = {2014},
url = {https://doi.org/10.1002/rsa.20539},
doi = {10.1002/RSA.20539},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BenjaminiST14,
author = {Itai Benjamini and
Igor Shinkar and
Gilad Tsur},
title = {Acquaintance Time of a Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {2},
pages = {767--785},
year = {2014},
url = {https://doi.org/10.1137/130930078},
doi = {10.1137/130930078},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BenjaminiST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenjaminiCS14,
author = {Itai Benjamini and
Gil Cohen and
Igor Shinkar},
title = {Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {81--89},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.17},
doi = {10.1109/FOCS.2014.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenjaminiCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BenjaminiCPT13,
author = {Itai Benjamini and
Van Cyr and
Eviatar B. Procaccia and
Ran J. Tessler},
title = {Harmonic labeling of graphs},
journal = {Discret. Math.},
volume = {313},
number = {17},
pages = {1726--1745},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.04.022},
doi = {10.1016/J.DISC.2013.04.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BenjaminiCPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2787,
author = {Itai Benjamini and
Igor Shinkar and
Gilad Tsur},
title = {Acquaintance Time of a Graph},
journal = {CoRR},
volume = {abs/1302.2787},
year = {2013},
url = {http://arxiv.org/abs/1302.2787},
eprinttype = {arXiv},
eprint = {1302.2787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-2787.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BenjaminiCS13,
author = {Itai Benjamini and
Gil Cohen and
Igor Shinkar},
title = {Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball},
journal = {CoRR},
volume = {abs/1310.2017},
year = {2013},
url = {http://arxiv.org/abs/1310.2017},
eprinttype = {arXiv},
eprint = {1310.2017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BenjaminiCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiCS13,
author = {Itai Benjamini and
Gil Cohen and
Igor Shinkar},
title = {Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-138}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/138},
eprinttype = {ECCC},
eprint = {TR13-138},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BenjaminiC11,
author = {Itai Benjamini and
Nicolas Curien},
title = {On limits of graphs sphere packed in Euclidean space and applications},
journal = {Eur. J. Comb.},
volume = {32},
number = {7},
pages = {975--984},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2011.03.016},
doi = {10.1016/J.EJC.2011.03.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BenjaminiC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BenjaminiHOPW11,
author = {Itai Benjamini and
Carlos Hoppen and
Eran Ofek and
Pawel Pralat and
Nicholas C. Wormald},
title = {Geodesics and almost geodesic cycles in random regular graphs},
journal = {J. Graph Theory},
volume = {66},
number = {2},
pages = {115--136},
year = {2011},
url = {https://doi.org/10.1002/jgt.20496},
doi = {10.1002/JGT.20496},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BenjaminiHOPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-1155,
author = {Itai Benjamini and
Yury Makarychev},
title = {Balanced Allocation: Memory Performance Tradeoffs},
journal = {CoRR},
volume = {abs/0901.1155},
year = {2009},
url = {http://arxiv.org/abs/0901.1155},
eprinttype = {arXiv},
eprint = {0901.1155},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-1155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BenjaminiBY08,
author = {Itai Benjamini and
Noam Berger and
Ariel Yadin},
title = {Long-Range Percolation Mixing Time},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {4},
pages = {487--494},
year = {2008},
url = {https://doi.org/10.1017/S0963548308008948},
doi = {10.1017/S0963548308008948},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BenjaminiBY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AngelBOW08,
author = {Omer Angel and
Itai Benjamini and
Eran Ofek and
Udi Wieder},
title = {Routing complexity of faulty networks},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {71--87},
year = {2008},
url = {https://doi.org/10.1002/rsa.20163},
doi = {10.1002/RSA.20163},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AngelBOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiHKL08,
author = {Itai Benjamini and
Simi Haber and
Michael Krivelevich and
Eyal Lubetzky},
title = {The isoperimetric constant of the random graph process},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {101--114},
year = {2008},
url = {https://doi.org/10.1002/rsa.20171},
doi = {10.1002/RSA.20171},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiHKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSS08,
author = {Itai Benjamini and
Oded Schramm and
Asaf Shapira},
editor = {Cynthia Dwork},
title = {Every minor-closed property of sparse graphs is testable},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {393--402},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374433},
doi = {10.1145/1374376.1374433},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BenjaminiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiSS08,
author = {Itai Benjamini and
Oded Schramm and
Asaf Shapira},
title = {Every Minor-Closed Property of Sparse Graphs is Testable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-010}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-010/index.html},
eprinttype = {ECCC},
eprint = {TR08-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AngelB07,
author = {Omer Angel and
Itai Benjamini},
title = {A phase transition for the metric distortion of percolation on the
hypercube},
journal = {Comb.},
volume = {27},
number = {6},
pages = {645--658},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2241-5},
doi = {10.1007/S00493-007-2241-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AngelB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BenjaminiKLRT06,
author = {Itai Benjamini and
Gady Kozma and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Dan Romik and
G{\'{a}}bor Tardos},
title = {Waiting for a Bat to Fly By (in Polynomial Time)},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {5},
pages = {673--683},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007590},
doi = {10.1017/S0963548306007590},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BenjaminiKLRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BenjaminiK05,
author = {Itai Benjamini and
Gady Kozma},
title = {A Resistance Bound Via An Isoperimetric Inequality},
journal = {Comb.},
volume = {25},
number = {6},
pages = {645--650},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0040-4},
doi = {10.1007/S00493-005-0040-4},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BenjaminiK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BenjaminiH05,
author = {Itai Benjamini and
Christopher Hoffman},
title = {{\(\omega\)}-Periodic Graphs},
journal = {Electron. J. Comb.},
volume = {12},
year = {2005},
url = {https://doi.org/10.37236/1943},
doi = {10.37236/1943},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BenjaminiH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AngelB05,
author = {Omer Angel and
Itai Benjamini and
Eran Ofek and
Udi Wieder},
editor = {Marcos Kawazoe Aguilera and
James Aspnes},
title = {Routing complexity of faulty networks},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2005, Las Vegas, NV, USA, July 17-20,
2005},
pages = {209--217},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073814.1073854},
doi = {10.1145/1073814.1073854},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AngelB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSW05,
author = {Itai Benjamini and
Oded Schramm and
David Bruce Wilson},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Balanced boolean functions that can be evaluated so that every input
bit is unlikely to be read},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {244--250},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060627},
doi = {10.1145/1060590.1060627},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BenjaminiSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-PR-0410282,
author = {Itai Benjamini and
Oded Schramm and
David Bruce Wilson},
title = {Balanced Boolean functions that can be evaluated so that every input
bit is unlikely to be read},
journal = {CoRR},
volume = {math.PR/0410282},
year = {2004},
url = {http://arxiv.org/abs/math.PR/0410282},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/math-PR-0410282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenjaminiL02,
author = {Itai Benjamini and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Global Information from Local Observation},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {701--710},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181995},
doi = {10.1109/SFCS.2002.1181995},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenjaminiL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiB01,
author = {Itai Benjamini and
Noam Berger},
title = {The diameter of long-range percolation clusters on finite cycles},
journal = {Random Struct. Algorithms},
volume = {19},
number = {2},
pages = {102--111},
year = {2001},
url = {https://doi.org/10.1002/rsa.1022},
doi = {10.1002/RSA.1022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BenjaminiHM00,
author = {Itai Benjamini and
Olle H{\"{a}}ggstr{\"{o}}m and
Elchanan Mossel},
title = {On Random Graph Homomorphisms into {Z}},
journal = {J. Comb. Theory {B}},
volume = {78},
number = {1},
pages = {86--114},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1931},
doi = {10.1006/JCTB.1999.1931},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BenjaminiHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiS00,
author = {Itai Benjamini and
Gideon Schechtman},
title = {Upper bounds on the height difference of the Gaussian random field
and the range of random graph homomorphisms into {Z}},
journal = {Random Struct. Algorithms},
volume = {17},
number = {1},
pages = {20--25},
year = {2000},
url = {https://doi.org/10.1002/1098-2418(200008)17:1\&\#60;20::AID-RSA2\&\#62;3.0.CO;2-S},
doi = {10.1002/1098-2418(200008)17:1\&\#60;20::AID-RSA2\&\#62;3.0.CO;2-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-06-10 21:23 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:
