Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5784 Publications
2017 | Journal Article | IST-REx-ID: 9574 | 
Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 2017;61:93-99. doi:10.1016/j.endm.2017.06.025
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9590 |
Krivelevich M, Kwan MA, Sudakov B. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 2017;31(1):155-171. doi:10.1137/15m1032910
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9588 |
Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 2017;319:292-312. doi:10.1016/j.aim.2017.08.031
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9589 |
Greenhill C, Isaev M, Kwan MA, McKay BD. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 2017;63:6-25. doi:10.1016/j.ejc.2017.02.003
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 963 |
Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37
[Published Version]
View
| Files available
| DOI