( en | de | ru )

 

Disambiguation of "Golovnev, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.

, , , , and . CoRR, (2019)

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.

Anatoly Golovnev

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Improving 3N Circuit Complexity Lower Bounds., , , and . Comput. Complex., 32 (2): 13 (December 2023)On the limits of gate elimination., , , and . J. Comput. Syst. Sci., (2018)Collapsing Superstring Conjecture., , , and . CoRR, (2018)Families with Infants: A General Approach to Solve Hard Partition Problems., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 551-562. Springer, (2014)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)A note on lower bounds for non-interactive message authentication using weak keys., and . ITW Fall, page 249-251. IEEE, (2015)Classification of the streaming approximability of Boolean CSPs., , , and . CoRR, (2021)Circuit Depth Reductions., , and . ITCS, volume 185 of LIPIcs, page 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , and . CoRR, (2019)String Matching: Communication, Circuits, and Learning., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)