PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Golovnev, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for Subgraph Isomorphism and Graph Homomorphism.

, , , and . CoRR, (2015)

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.

Alexander Verl

On the Dynamics and Emergency Stop Behavior of Cable-Driven Parallel Robots, , and . ROMANSY 21 - Robot Design, Dynamics and Control, volume 569 of CISM International Centre for Mechanical Sciences, page 431--438. Switzerland, Springer Verlag and Springer International Publishing, (2016)

Alexander Grundler University of Stuttgart

Zuverlässigkeitsnachweis von Systemen durch Komponenten- und Systemtests unter Berücksichtigung von Vorkenntnissen. Universität Stuttgart, Stuttgart, Dissertation, (2024)

Dr. rer. nat. Alexander Schlaich University of Stuttgart

Supporting Information: Chemical Potential Differences in Nanoscopic Teflon/Kapton Capillaries, and . Software, (2024)Related to: Artemov, V.; Frank, L.; Doronin, R.; Stärk, P.; Schlaich, A.; Andreev, A.; Leisner, T.; Radenovic, A.; Kiselev, A. The Three-Phase Contact Potential Difference Modulates the Water Surface Charge. J. Phys. Chem. Lett. 2023, 14, 4796-4802. doi: 10.1021/acs.jpclett.3c00479.

Dr. rer. nat. Alexander Jaust University of Stuttgart

preCICE Distribution Version v2404.0, , , , , , , , , and 14 other author(s). Software, (2024)

Alexander Jaust

 

Other publications of authors with the same name

Solving SCS for bounded length strings in fewer than 2n steps., , and . Inf. Process. Lett., 114 (8): 421-425 (2014)Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem., , and . CoRR, (2017)Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT., , and . ACM Trans. Algorithms, 12 (3): 35:1-35:17 (2016)The Minrank of Random Graphs., , and . IEEE Trans. Information Theory, 64 (11): 6990-6995 (2018)Approximating Shortest Superstring Problem Using de Bruijn Graphs., , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 120-129. Springer, (2013)A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function., , , and . FOCS, page 89-98. IEEE Computer Society, (2016)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)Collapsing Superstring Conjecture., , , and . CoRR, (2018)A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys., and . IACR Cryptology ePrint Archive, (2015)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)