E-LIB Suche - Ergebnisse für: Vassilevska Williams, Virginia

1

Subcubic Equivalences between Graph Centrality Problems, AP..:

Abboud, Amir ; Grandoni, Fabrizio ; Vassilevska Williams, Virginia
ACM Transactions on Algorithms. 19 (2023) 1 - p. 1-30 , 2023

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

2

Quasipolynomiality of the Smallest Missing Induced Subgraph:

Eppstein, David ; Lincoln, Andrea ; Vassilevska Williams, Virginia
Journal of Graph Algorithms and Applications. 27 (2023) 5 - p. 329-339 , 2023

Link: https://doi.org/10.7155/..

3

Fredman's Trick Meets Dominance Product: Fine-Grained Compl..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Chan, Timothy M. ; Vassilevska Williams, Virginia ; Xu, Yinzhan - p. 419-432 , 2023

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

4

Factorization and pseudofactorization of weighted graphs:

Sheridan, Kristin ; Berleant, Joseph ; Bathe, Mark..
Discrete Applied Mathematics. 337 (2023) - p. 81-105 , 2023

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

5

Isometric Hamming embeddings of weighted graphs:

Berleant, Joseph ; Sheridan, Kristin ; Condon, Anne..
Discrete Applied Mathematics. 332 (2023) - p. 119-128 , 2023

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

6

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theo..:

Khuller, Samir ; Vassilevska Williams, Virginia , 2021

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

7

Fine-Grained Complexity and Algorithms for the Schulze Voti..:

, In: Proceedings of the 22nd ACM Conference on Economics and Computation,

Sornat, Krzysztof ; Vassilevska Williams, Virginia ; Xu, Yinzhan - p. 841-859 , 2021

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

8

New algorithms and hardness for incremental single-source s..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,

Probst Gutenberg, Maximilian ; Vassilevska Williams, Virginia ; Wein, Nicole - p. 153-166 , 2020

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

9

Public-Key Cryptography in the Fine-Grained Setting:

, In: Advances in Cryptology – CRYPTO 2019; Lecture Notes in Computer Science,

LaVigne, Rio ; Lincoln, Andrea ; Vassilevska Williams, Virginia - p. 605-635 , 2019

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

10

Bribery in Balanced Knockout Tournaments:

, In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems,

Konicki, Christine ; Vassilevska Williams, Virginia - p. 2066-2068 , 2019

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

11

Limits on All Known (and Some Unknown) Approaches to Matrix..:

, In: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation,

Vassilevska Williams, Virginia - p. 10 ff. , 2019

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

12

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms (TALG). 14 (2018) 3 - p. 1-23 , 2018

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

13

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms. 14 (2018) 3 - p. 1-23 , 2018

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

14

Matching Triangles and Basing Hardness on an Extremely Popu..:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,

Abboud, Amir ; Vassilevska Williams, Virginia ; Yu, Huacheng - p. 41-50 , 2015

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

15

Fast approximation algorithms for the diameter and radius o..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,

Roditty, Liam ; Vassilevska Williams, Virginia - p. 515-524 , 2013

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