Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Bezáková I, Galanis A, Goldberg L and Štefankovič D. (2024). Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Transactions on Algorithms. 20:1. (1-26). Online publication date: 31-Jan-2024.

    https://doi.org/10.1145/3631354

  • Galvin D, McKinley G, Perkins W, Sarantis M and Tetali P. (2023). On the zeroes of hypergraph independence polynomials. Combinatorics, Probability and Computing. 10.1017/S0963548323000330. 33:1. (65-84). Online publication date: 1-Jan-2024.

    https://www.cambridge.org/core/product/identifier/S0963548323000330/type/journal_article

  • Casel K, Fischbeck P, Friedrich T, Göbel A and Lagodzinski J. (2022). Zeros and approximations of Holant polynomials on the complex plane. Computational Complexity. 31:2. Online publication date: 1-Dec-2022.

    https://doi.org/10.1007/s00037-022-00226-5

  • Galanis A, Goldberg L and Herrera-Poyatos A. (2022). The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. SIAM Journal on Discrete Mathematics. 36:3. (2159-2204). Online publication date: 30-Sep-2022.

    https://doi.org/10.1137/21M1454043

  • Galanis A, Goldberg L and Herrera-Poyatos A. (2022). The complexity of approximating the complex-valued Potts model. Computational Complexity. 31:1. Online publication date: 1-Jun-2022.

    https://doi.org/10.1007/s00037-021-00218-x

  • Buys P, Galanis A, Patel V and Regts G. (2022). Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs. Forum of Mathematics, Sigma. 10.1017/fms.2022.4. 10.

    https://www.cambridge.org/core/product/identifier/S2050509422000044/type/journal_article