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, Afonso S., et al. “Resilience for the Littlewood-Offord Problem.” Electronic Notes in Discrete Mathematics, vol. 61, Elsevier, 2017, pp. 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, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” SIAM Journal on Discrete Mathematics, vol. 31, no. 1, Society for Industrial & Applied Mathematics, 2017, pp. 155–71, doi:10.1137/15m1032910.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 9588 |
Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.” Advances in Mathematics, vol. 319, Elsevier, 2017, pp. 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, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” European Journal of Combinatorics, vol. 63, Elsevier, 2017, pp. 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, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
[Published Version]
View
| Files available
| DOI