( en | de | ru )

 

Disambiguation of "Williams, Virginia Vassilevska"

Author of the publication

copydeleteadd this publication to your clipboard
Conditional Hardness for Sensitivity Problems.

, , , and . ITCS, volume 67 of LIPIcs, page 26:1-26:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Virginia Teuteberg

Virginia Spanoudaki

Virginia Papailiopoulou

Virginia Smith

Simone Williams

 

Other publications of authors with the same name

Knockout Tournaments.. Handbook of Computational Social Choice, Cambridge University Press, (2016)Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made., , , and . CoRR, (2015)Subtree Isomorphism Revisited., , , , and . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Finding, Minimizing, and Counting Weighted Subgraphs., and . SIAM J. Comput., 42 (3): 831-854 (2013)Public-Key Cryptography in the Fine-Grained Setting., , and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 605-635. Springer, (2019)RNA-Folding - From Hardness to Algorithms.. MFCS, volume 58 of LIPIcs, page 5:1-5:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players., and . WINE, volume 7090 of Lecture Notes in Computer Science, page 326-337. Springer, (2011)Equivalences between triangle and range query problems., , , and . SODA, page 30-47. SIAM, (2020)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , and . SODA, page 1236-1252. SIAM, (2018)Finding Four-Node Subgraphs in Triangle Time., , , and . SODA, page 1671-1680. SIAM, (2015)