Alexander Golovnev

From MaRDI portal
Person:1635508

Available identifiers

zbMath Open golovnev.alexanderMaRDI QIDQ1635508

List of research outcomes

PublicationDate of PublicationType
Revisiting time-space tradeoffs for function inversion2024-02-02Paper
Improving \(3N\) circuit complexity lower bounds2024-01-24Paper
https://portal.mardi4nfdi.de/entity/Q61473642024-01-15Paper
Linear space streaming lower bounds for approximating CSPs2023-12-08Paper
Worst-case to average-case reductions via additive combinatorics2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q61153592023-07-12Paper
https://portal.mardi4nfdi.de/entity/Q58754782023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58755152023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50607492023-01-11Paper
https://portal.mardi4nfdi.de/entity/Q50912232022-07-21Paper
Polynomial Data Structure Lower Bounds in the Group Model2022-04-01Paper
https://portal.mardi4nfdi.de/entity/Q50026522021-07-28Paper
Data structures meet cryptography: 3SUM with preprocessing2021-01-19Paper
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications2020-02-20Paper
Static data structure lower bounds imply rigidity2020-01-30Paper
The Minrank of Random Graphs2018-12-04Paper
Families with Infants2018-11-05Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism2018-07-16Paper
On the limits of gate elimination2018-06-06Paper
Tight Lower Bounds on Graph Embedding Problems2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46086072018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46086082018-03-21Paper
Gate elimination: circuit size lower bounds and \#SAT upper bounds2018-03-12Paper
Weighted Gate Elimination2016-04-15Paper
Lower Bounds for the Graph Homomorphism Problem2015-10-27Paper
Condensed Unpredictability2015-10-27Paper
A Formal Treatment of Backdoored Pseudorandom Generators2015-09-30Paper
APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME2014-07-04Paper
Families with Infants: A General Approach to Solve Hard Partition Problems2014-07-01Paper
Solving SCS for bounded length strings in fewer than \(2^n\) steps2014-04-30Paper
New exact algorithms for the 2-constraint satisfaction problem2014-03-13Paper
Solving 3-Superstring in 3 n/3 Time2013-09-20Paper
Approximating Shortest Superstring Problem Using de Bruijn Graphs2013-06-14Paper
A New Algorithm for Parameterized MAX-SAT2013-01-07Paper
New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree2012-06-15Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alexander Golovnev