Author of the publication

TC0 Circuits for Algorithmic Problems in Nilpotent Groups.

, and . MFCS, volume 83 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)

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.

 

Other publications of authors with the same name

QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average., and . CoRR, (2013)BlockQuicksort: Avoiding Branch Mispredictions in Quicksort., and . ESA, volume 57 of LIPIcs, page 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE., and . ICALP, volume 107 of LIPIcs, page 139:1-139:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average., and . CSR, volume 8476 of Lecture Notes in Computer Science, page 139-152. Springer, (2014)On the complexity of conjugacy in amalgamated products and HNN extensions. Universität Stuttgart, Stuttgart, Dissertation, (2015)Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem, , and . ISSAC'15 : proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, page 141-148. New York, NY, ACM, (2015)QuickXsort : A Fast Sorting Scheme in Theory and Practice, , and . Algorithmica, 82 (3): 509-588 (2020)QuickHeapsort: Modifications and Improved Analysis, and . Theory of computing systems, 59 (2): 209-230 (2016)QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting., and . CoRR, (2018)Conjugacy in Baumslag's group, generic case complexity, and division in power circuits., , and . CoRR, (2013)