Asaf Ferber

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 36

Top Topics

Learning Curves

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Asaf Ferber, Liam Hardiman, Adva Mond
Counting Hamilton Cycles in Dirac Hypergraphs. Comb. 43 (4) (2023)
Asaf Ferber, Liam Hardiman, Michael Krivelevich
On subgraphs with degrees of prescribed residues in the random graph. Random Struct. Algorithms 63 (1) (2023)
Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu
Sparse recovery properties of discrete random matrices. Comb. Probab. Comput. 32 (2) (2023)
Asaf Ferber, Matthew Kwan
Dirac-type theorems in random hypergraphs. J. Comb. Theory, Ser. B 155 (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-Decodability With Large Radius for Reed-Solomon Codes. IEEE Trans. Inf. Theory 68 (6) (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
Singularity of sparse random matrices: simple proofs. Comb. Probab. Comput. 31 (1) (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. FOCS (2022)
Asaf Ferber, Vishesh Jain, Yufei Zhao
On the number of Hadamard matrices via anti-concentration. Comb. Probab. Comput. 31 (3) (2022)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. FOCS (2021)
Asaf Ferber, Kyle Luh, Gweneth McKinley
Resilience of the rank of random matrices. Comb. Probab. Comput. 30 (2) (2021)
Asaf Ferber, Vishesh Jain, Benny Sudakov
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40 (3) (2020)
Asaf Ferber, Asaf Shapira
A quantitative Lovász criterion for Property B. Comb. Probab. Comput. 29 (6) (2020)
Asaf Ferber, Vishesh Jain
1-Factorizations of pseudorandom graphs. Random Struct. Algorithms 57 (2) (2020)
Asaf Ferber, Lior Hirschfeld
Co-degrees Resilience for Perfect Matchings in Random Hypergraphs. Electron. J. Comb. 27 (1) (2020)
Asaf Ferber, Jacob Fox, Vishesh Jain
Towards the linear arboricity conjecture. J. Comb. Theory, Ser. B 142 (2020)
Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29 (1) (2020)
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability with large radius for Reed-Solomon codes. CoRR (2020)
Asaf Ferber, Wojciech Samotij
Packing trees of unbounded degrees in random graphs. J. Lond. Math. Soc. 99 (3) (2019)
Asaf Ferber, Eoin Long
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct. Algorithms 54 (3) (2019)
Asaf Ferber, Daniel Montealegre, Van Vu
Law of the iterated logarithm for random graphs. Random Struct. Algorithms 54 (1) (2019)
Asaf Ferber, Jacob Fox, Vishesh Jain
Towards the linear arboricity conjecture. CoRR (2018)
Asaf Ferber, Rajko Nenadov
Spanning universality in random graphs. Random Struct. Algorithms 53 (4) (2018)
Asaf Ferber, Vishesh Jain
1-factorizations of pseudorandom graphs. CoRR (2018)
Asaf Ferber, Matthew Kwan, Benny Sudakov
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53 (4) (2018)
Asaf Ferber, Vishesh Jain
1-Factorizations of Pseudorandom Graphs. FOCS (2018)
Asaf Ferber, Van Vu
Packing perfect matchings in random hypergraphs. Random Struct. Algorithms 52 (3) (2018)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs. Random Struct. Algorithms 50 (3) (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory, Ser. B 122 (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50 (1) (2017)
Asaf Ferber, Pascal Pfister
Strong Games Played on Random Graphs. Electron. J. Comb. 24 (1) (2017)
Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen
Packing Loose Hamilton Cycles. Comb. Probab. Comput. 26 (6) (2017)
Afonso S. Bandeira, Asaf Ferber, Matthew Kwan
Resilience for the Littlewood-Offord Problem. Electron. Notes Discret. Math. 61 (2017)
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85 (2) (2017)
Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
Robust Hamiltonicity of random directed graphs. J. Comb. Theory, Ser. B 126 (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49 (4) (2016)
Asaf Ferber, Rajko Nenadov, Ueli Peter
Universality of random graphs and rainbow embedding. Random Struct. Algorithms 48 (3) (2016)
Asaf Ferber
Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs. Electron. J. Comb. 22 (1) (2015)
Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor
Biased games on random boards. Random Struct. Algorithms 46 (4) (2015)
Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric
. SODA (2015)
Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29 (3) (2015)
David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric
Almost-spanning universality in random graphs (Extended abstract). Electron. Notes Discret. Math. 49 (2015)
Asaf Ferber, Pascal Pfister
Strong games played on random graphs. CoRR (2015)
Asaf Ferber, Michael Krivelevich, Humberto Naves
Generating random graphs in biased Maker-Breaker games. Random Struct. Algorithms 47 (4) (2015)
Michelle Delcourt, Asaf Ferber
On a Conjecture of Thomassen. Electron. J. Comb. 22 (3) (2015)
Asaf Ferber, Gal Kronenberg, Eoin Long
Packing, Counting and Covering Hamilton cycles in random directed graphs. Electron. Notes Discret. Math. 49 (2015)
Asaf Ferber, Dan Hefetz
k-connectivity games. Eur. J. Comb. 35 (2014)
Asaf Ferber, Michael Krivelevich, Alon Naor
Avoider-Enforcer games played on edge disjoint hypergraphs. Discret. Math. 313 (24) (2013)
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) (2013)
Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21 (6) (2012)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41 (1) (2012)
Asaf Ferber, Dan Hefetz, Michael Krivelevich
Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33 (6) (2012)
Dan Hefetz, Asaf Ferber, Michael Krivelevich
Fast embedding of spanning trees in biased Maker-Breaker games. Electron. Notes Discret. Math. 38 (2011)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games. SODA (2011)
Asaf Ferber, Dan Hefetz
Winning Strong Games through Fast Strategies for Weak Games. Electron. J. Comb. 18 (1) (2011)
Asaf Ferber, Moti Gitik
On almost precipitous ideals. Arch. Math. Log. 49 (3) (2010)
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
Hitting time results for Maker-Breaker games CoRR (2010)