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.
600 Publications
2017 | Journal Article | IST-REx-ID: 9574 | 
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2017.06.025
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9590 |
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/15m1032910
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9588 |
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. Advances in Mathematics. Elsevier. https://doi.org/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, M. A., & McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. Elsevier. https://doi.org/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. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37
[Published Version]
View
| Files available
| DOI