default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAsaf Ferber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham:
Sunflowers in set systems with small VC-dimension. CoRR abs/2408.04165 (2024)- 2023
- [j46]Asaf Ferber, Liam Hardiman, Adva Mond:
Counting Hamilton Cycles in Dirac Hypergraphs. Comb. 43(4): 665-680 (2023) - [j45]Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu:
Sparse recovery properties of discrete random matrices. Comb. Probab. Comput. 32(2): 316-325 (2023) - [j44]Asaf Ferber, Liam Hardiman, Michael Krivelevich:
On subgraphs with degrees of prescribed residues in the random graph. Random Struct. Algorithms 63(1): 192-214 (2023) - 2022
- [j43]Asaf Ferber, Matthew Kwan
, Lisa Sauermann:
Singularity of sparse random matrices: simple proofs. Comb. Probab. Comput. 31(1): 21-28 (2022) - [j42]Asaf Ferber, Vishesh Jain, Yufei Zhao:
On the number of Hadamard matrices via anti-concentration. Comb. Probab. Comput. 31(3): 455-477 (2022) - [j41]Asaf Ferber, Matthew Kwan:
Dirac-type theorems in random hypergraphs. J. Comb. Theory B 155: 318-357 (2022) - [j40]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-Decodability With Large Radius for Reed-Solomon Codes. IEEE Trans. Inf. Theory 68(6): 3823-3828 (2022) - 2021
- [j39]Asaf Ferber, Kyle Luh, Gweneth McKinley:
Resilience of the rank of random matrices. Comb. Probab. Comput. 30(2): 163-174 (2021) - [c4]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-decodability with large radius for Reed-Solomon codes. FOCS 2021: 720-726 - 2020
- [j38]Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40(3): 315-344 (2020) - [j37]Asaf Ferber, Lior Hirschfeld:
Co-degrees Resilience for Perfect Matchings in Random Hypergraphs. Electron. J. Comb. 27(1): 1 (2020) - [j36]Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29(1): 22-30 (2020) - [j35]Asaf Ferber, Asaf Shapira:
A quantitative Lovász criterion for Property B. Comb. Probab. Comput. 29(6): 956-960 (2020) - [j34]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. J. Comb. Theory B 142: 56-79 (2020) - [j33]Asaf Ferber, Vishesh Jain:
1-Factorizations of pseudorandom graphs. Random Struct. Algorithms 57(2): 259-278 (2020) - [i5]Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-decodability with large radius for Reed-Solomon codes. CoRR abs/2012.10584 (2020)
2010 – 2019
- 2019
- [j32]Asaf Ferber, Wojciech Samotij:
Packing trees of unbounded degrees in random graphs. J. Lond. Math. Soc. 99(3): 653-677 (2019) - [j31]Asaf Ferber, Daniel Montealegre, Van Vu:
Law of the iterated logarithm for random graphs. Random Struct. Algorithms 54(1): 3-38 (2019) - [j30]Asaf Ferber, Eoin Long:
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct. Algorithms 54(3): 499-514 (2019) - 2018
- [j29]Asaf Ferber, Van Vu:
Packing perfect matchings in random hypergraphs. Random Struct. Algorithms 52(3): 367-378 (2018) - [j28]Asaf Ferber, Matthew Kwan, Benny Sudakov:
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53(4): 592-603 (2018) - [j27]Asaf Ferber, Rajko Nenadov:
Spanning universality in random graphs. Random Struct. Algorithms 53(4): 604-637 (2018) - [c3]Asaf Ferber, Vishesh Jain:
1-Factorizations of Pseudorandom Graphs. FOCS 2018: 698-708 - [i4]Asaf Ferber, Vishesh Jain:
1-factorizations of pseudorandom graphs. CoRR abs/1803.10361 (2018) - [i3]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. CoRR abs/1809.04716 (2018) - 2017
- [j26]Asaf Ferber, Pascal Pfister:
Strong Games Played on Random Graphs. Electron. J. Comb. 24(1): 1 (2017) - [j25]Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen:
Packing Loose Hamilton Cycles. Comb. Probab. Comput. 26(6): 839-849 (2017) - [j24]Afonso S. Bandeira, Asaf Ferber, Matthew Kwan:
Resilience for the Littlewood-Offord Problem. Electron. Notes Discret. Math. 61: 93-99 (2017) - [j23]Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory B 122: 196-220 (2017) - [j22]Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric:
Robust Hamiltonicity of random directed graphs. J. Comb. Theory B 126: 1-23 (2017) - [j21]Asaf Ferber, Michael Krivelevich, Gal Kronenberg:
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85(2): 446-465 (2017) - [j20]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017) - [j19]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs. Random Struct. Algorithms 50(3): 380-393 (2017) - 2016
- [j18]Asaf Ferber, Rajko Nenadov, Ueli Peter:
Universality of random graphs and rainbow embedding. Random Struct. Algorithms 48(3): 546-564 (2016) - [j17]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49(4): 635-668 (2016) - 2015
- [j16]Asaf Ferber:
Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs. Electron. J. Comb. 22(1): 1 (2015) - [j15]Michelle Delcourt, Asaf Ferber:
On a Conjecture of Thomassen. Electron. J. Comb. 22(3): 3 (2015) - [j14]David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49: 203-211 (2015) - [j13]Asaf Ferber, Gal Kronenberg, Eoin Long:
Packing, Counting and Covering Hamilton cycles in random directed graphs. Electron. Notes Discret. Math. 49: 813-819 (2015) - [j12]Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor:
Biased games on random boards. Random Struct. Algorithms 46(4): 651-676 (2015) - [j11]Asaf Ferber, Michael Krivelevich, Humberto Naves:
Generating random graphs in biased Maker-Breaker games. Random Struct. Algorithms 47(4): 615-634 (2015) - [j10]Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau:
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29(3): 1683-1705 (2015) - [c2]Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric:
Robust hamiltonicity of random directed graphs extended abstract. SODA 2015: 1752-1758 - [i2]Asaf Ferber, Pascal Pfister:
Strong games played on random graphs. CoRR abs/1507.04229 (2015) - 2014
- [j9]Asaf Ferber, Dan Hefetz:
Weak and strong kk-connectivity games. Eur. J. Comb. 35: 169-183 (2014) - 2013
- [j8]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j7]Asaf Ferber, Michael Krivelevich, Alon Naor:
Avoider-Enforcer games played on edge disjoint hypergraphs. Discret. Math. 313(24): 2932-2941 (2013) - 2012
- [j6]Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau:
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21(6): 897-915 (2012) - [j5]Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33(6): 1086-1099 (2012) - [j4]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41(1): 23-46 (2012) - 2011
- [j3]Asaf Ferber, Dan Hefetz:
Winning Strong Games through Fast Strategies for Weak Games. Electron. J. Comb. 18(1) (2011) - [j2]Dan Hefetz, Asaf Ferber, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. Electron. Notes Discret. Math. 38: 331-336 (2011) - [c1]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. SODA 2011: 900-912 - 2010
- [j1]Asaf Ferber, Moti Gitik:
On almost precipitous ideals. Arch. Math. Log. 49(3): 301-328 (2010) - [i1]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. CoRR abs/1008.1865 (2010)
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-09-30 00:58 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:
