E-LIB Suche - Ergebnisse für: Goldberg, Leslie Ann

1

Fast Sampling via Spectral Independence Beyond Bounded-degr..:

Bezáková, Ivona ; Galanis, Andreas ; Goldberg, Leslie Ann.
ACM Transactions on Algorithms. 20 (2024) 1 - p. 1-26 , 2024

2

Implementations and the independent set polynomial below th..:

Galanis, Andreas ; Goldberg, Leslie Ann ; Štefankovič, Daniel
Theoretical Computer Science. 939 (2023) - p. 194-215 , 2023

Link: https://doi.org/10.1016/..

3

Metastability of the Potts Ferromagnet on Random Regular Gr..:

Coja-Oghlan, Amin ; Galanis, Andreas ; Goldberg, Leslie Ann...
Communications in Mathematical Physics. 401 (2023) 1 - p. 185-225 , 2023

Link: https://doi.org/10.1007/..

4

Graph Ranking and the Cost of Sybil Defense:

, In: Proceedings of the 24th ACM Conference on Economics and Computation,

Farach-Colton, Gwendolyn ; Farach-Colton, Martin ; Goldberg, Leslie Ann... - p. 586-625 , 2023

Link: https://dl.acm.org/doi/1..

5

Parameterised and Fine-Grained Subgraph Counting, Modulo 2:

Goldberg, Leslie Ann ; Roth, Marc
Algorithmica. 86 (2023) 4 - p. 944-1005 , 2023

Link: https://doi.org/10.1007/..

6

Fast mixing via polymers for random graphs with unbounded d..:

Galanis, Andreas ; Goldberg, Leslie Ann ; Stewart, James
Information and Computation. 285 (2022) - p. 104894 , 2022

Link: https://doi.org/10.1016/..

7

The complexity of approximating the complex-valued Potts mo..:

Galanis, Andreas ; Goldberg, Leslie Ann ; Herrera-Poyatos, Andrés
computational complexity. 31 (2022) 1 - p. , 2022

Link: https://doi.org/10.1007/..

8

Approximately Counting Answers to Conjunctive Queries with ..:

, In: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,

Focke, Jacob ; Goldberg, Leslie Ann ; Roth, Marc. - p. 315-324 , 2022

Link: https://dl.acm.org/doi/1..

9

Fast Algorithms for General Spin Systems on Bipartite Expan..:

Galanis, Andreas ; Goldberg, Leslie Ann ; Stewart, James
ACM Transactions on Computation Theory (TOCT). 13 (2021) 4 - p. 1-18 , 2021

Link: https://dl.acm.org/doi/1..

10

Fast Algorithms for General Spin Systems on Bipartite Expan..:

Galanis, Andreas ; Goldberg, Leslie Ann ; Stewart, James
ACM Transactions on Computation Theory. 13 (2021) 4 - p. 1-18 , 2021

Link: https://doi.org/10.1145/..

11

The Complexity of Approximating the Matching Polynomial in ..:

Bezáková, Ivona ; Galanis, Andreas ; Goldberg, Leslie Ann.
ACM Transactions on Computation Theory (TOCT). 13 (2021) 2 - p. 1-37 , 2021

Link: https://dl.acm.org/doi/1..

12

Counting homomorphisms to K4-minor-free graphs, modulo 2:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Focke, Jacob ; Goldberg, Leslie Ann ; Roth, Marc. - p. 2303-2314 , 2021

Link: https://dl.acm.org/doi/1..

13

The Complexity of Approximating the Matching Polynomial in ..:

Bezáková, Ivona ; Galanis, Andreas ; Goldberg, Leslie Ann.
ACM Transactions on Computation Theory. 13 (2021) 2 - p. 1-37 , 2021

Link: https://doi.org/10.1145/..

14

Increasing efficacy of contact-tracing applications by user..:

Goldberg, Leslie Ann ; Jorritsma, Joost ; Komjáthy, Júlia..
PLOS ONE. 16 (2021) 5 - p. e0250435 , 2021

Link: https://doi.org/10.1371/..

15

Counting Homomorphisms to K4-minor-free Graphs, modulo 2:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Focke, Jacob ; Goldberg, Leslie Ann ; Roth, Marc. - p. 2303-2314 , 2021

Link: https://doi.org/10.1137/..