Lincoln, Andrea
798  results:
Search for persons X
?
1

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
 
?
2

New Techniques for Proving Fine-Grained Average-Case Hardne..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
 
?
3

Closing the Gap Between Cache-oblivious and Cache-adaptive ..:

, In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
 
?
4

Public-Key Cryptography in the Fine-Grained Setting:

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

Tight Hardness for Shortest Cycles and Paths in Sparse Grap..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
6

Tight hardness for shortest cycles and paths in sparse grap..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
7

Cache-Adaptive Exploration : Experimental Results and Sc..:

, In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures,
 
?
 
?
9

Cache-Adaptive Analysis:

, In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
 
1-15