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 |
A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood-Offord problem,” Electronic Notes in Discrete Mathematics, vol. 61. Elsevier, pp. 93–99, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9590 |
M. Krivelevich, M. A. Kwan, and B. Sudakov, “Bounded-degree spanning trees in randomly perturbed graphs,” SIAM Journal on Discrete Mathematics, vol. 31, no. 1. Society for Industrial & Applied Mathematics, pp. 155–171, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9588 |
A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood–Offord problem,” Advances in Mathematics, vol. 319. Elsevier, pp. 292–312, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9589 |
C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” European Journal of Combinatorics, vol. 63. Elsevier, pp. 6–25, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 963 |
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI