Andrea Lincoln

From MaRDI portal
Person:259274

Available identifiers

zbMath Open lincoln.andreaMaRDI QIDQ259274

List of research outcomes





PublicationDate of PublicationType
The complexity of average-case dynamic subgraph counting2024-07-19Paper
How compression and approximation affect efficiency in string distance measures2024-07-19Paper
Delegation for search problems2024-06-24Paper
https://portal.mardi4nfdi.de/entity/Q61878292024-01-15Paper
Quasipolynomiality of the Smallest Missing Induced Subgraph2023-09-20Paper
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs.2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49932992021-06-15Paper
Public-key cryptography in the fine-grained setting2020-03-09Paper
https://portal.mardi4nfdi.de/entity/Q46380762018-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46079682018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45981972017-12-19Paper
The one-out-of-\(k\) retrieval problem and linear network coding2016-03-11Paper
The One-Out-of-k Retrieval Problem and Linear Network Coding2016-01-07Paper

Research outcomes over time

This page was built for person: Andrea Lincoln

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:259274&oldid=7890037"
Powered by MediaWiki