| Publication | Date of Publication | Type |
|---|
| Multivariate to bivariate reduction for noncommutative polynomial factorization | 2024-12-03 | Paper |
| Multivariate to bivariate reduction for noncommutative polynomial factorization | 2024-12-03 | Paper |
| On identity testing and noncommutative rank computation over the free skew field | 2024-09-25 | Paper |
| Black-box identity testing of noncommutative rational formulas of inversion height two in deterministic quasipolynomial time | 2024-08-22 | Paper |
| On efficient noncommutative polynomial factorization via Higman linearization | 2024-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192473 | 2024-02-12 | Paper |
| A note on the self-witnessing property of computational problems | 2024-01-29 | Paper |
| Equivalence Testing of Weighted Automata over Partially Commutative Monoids | 2023-08-08 | Paper |
| Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) | 2023-05-05 | Paper |
| Efficient Black-Box Identity Testing for Free Group Algebras | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875601 | 2023-02-03 | Paper |
| Fast Exact Algorithms Using Hadamard Product of Polynomials | 2023-02-03 | Paper |
| CNF satisfiability in a subspace and related problems | 2022-10-27 | Paper |
| On the Weisfeiler-Leman dimension of fractional packing | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090939 | 2022-07-21 | Paper |
| A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. | 2022-07-18 | Paper |
| Recognizing the Commuting Graph of a Finite Group | 2022-06-02 | Paper |
| Fast exact algorithms using Hadamard product of polynomials | 2022-03-25 | Paper |
| Univariate ideal membership parameterized by rank, degree, and number of generators | 2022-02-14 | Paper |
| Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable | 2022-01-28 | Paper |
| Parameterized complexity of small weight automorphisms and isomorphisms | 2022-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4988301 | 2021-05-14 | Paper |
| On the Weisfeiler-Leman dimension of fractional packing | 2020-07-27 | Paper |
| On Weisfeiler-Leman invariance: subgraph counts and related graph properties | 2020-06-09 | Paper |
| Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable | 2020-05-27 | Paper |
| On Weisfeiler-Leman invariance: subgraph counts and related graph properties | 2020-01-30 | Paper |
| Reductions to sets of low information content | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967238 | 2019-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967152 | 2019-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967219 | 2019-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967176 | 2019-07-03 | Paper |
| On the complexity of noncommutative polynomial factorization | 2018-09-27 | Paper |
| Expanding Generating Sets for Solvable Permutation Groups | 2018-07-20 | Paper |
| Parameterized Complexity of Small Weight Automorphisms. | 2018-04-19 | Paper |
| On the hardness of the noncommutative determinant | 2018-04-18 | Paper |
| The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs | 2018-03-21 | Paper |
| Solvable black-box group problems are low for PP | 2017-11-16 | Paper |
| Graph isomorphism, color refinement, and compactness | 2017-10-18 | Paper |
| Finding fixed point free elements and small bases in permutation groups | 2017-06-13 | Paper |
| Complexity Theory Basics: NP and NL | 2016-09-22 | Paper |
| The parameterized complexity of geometric graph isomorphism | 2016-09-07 | Paper |
| Solving linear equations parameterized by Hamming weight | 2016-09-07 | Paper |
| Sparse sets, approximable sets, and parallel queries to NP | 2016-06-16 | Paper |
| Some lower bound results for set-multilinear arithmetic computations | 2016-05-24 | Paper |
| On the Power of Color Refinement | 2015-09-29 | Paper |
| Solvable Group Isomorphism Is (Almost) in NP ∩ coNP | 2015-09-24 | Paper |
| On the complexity of noncommutative polynomial factorization | 2015-09-16 | Paper |
| On Tinhofer’s Linear Programming Approach to Isomorphism Testing | 2015-09-16 | Paper |
| Solving Linear Equations Parameterized by Hamming Weight | 2015-09-15 | Paper |
| The Parameterized Complexity of Geometric Graph Isomorphism | 2015-09-15 | Paper |
| Uniform derandomization from pathetic lower bounds | 2015-08-21 | Paper |
| On the isomorphism problem for decision trees and decision lists | 2015-06-10 | Paper |
| Colored hypergraph isomorphism is fixed parameter tractable | 2015-03-02 | Paper |
| Isomorphism testing of Boolean functions computable by constant-depth circuits | 2014-11-28 | Paper |
| The Complexity of Bounded Register and Skew Arithmetic Computation | 2014-09-26 | Paper |
| Testing nilpotence of galois groups in polynomial time | 2014-09-09 | Paper |
| On the hardness of the noncommutative determinant | 2014-08-13 | Paper |
| The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups | 2013-12-10 | Paper |
| The parallel complexity of graph canonization under abelian group action | 2013-11-11 | Paper |
| Comments on ``Arithmetic complexity, Kleene closure, and formal power series | 2013-10-21 | Paper |
| On the Isomorphism Problem for Decision Trees and Decision Lists | 2013-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904105 | 2013-01-28 | Paper |
| Arithmetic circuits and the Hadamard product of polynomials | 2012-10-24 | Paper |
| Some Sieving Algorithms for Lattice Problems | 2012-10-19 | Paper |
| The isomorphism problem for \(k\)-trees is complete for logspace | 2012-10-11 | Paper |
| Near-Optimal Expanding Generator Sets for Solvable Permutation Groups | 2012-09-25 | Paper |
| Approximate Graph Isomorphism | 2012-09-25 | Paper |
| Colored hypergraph isomorphism is fixed parameter tractable | 2012-08-29 | Paper |
| Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs | 2012-06-29 | Paper |
| Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits | 2012-06-08 | Paper |
| QUANTUM QUERY COMPLEXITY OF MULTILINEAR IDENTITY TESTING | 2012-04-24 | Paper |
| The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets | 2012-01-23 | Paper |
| Canonizing hypergraphs under abelian group action | 2011-08-17 | Paper |
| New results on noncommutative and commutative polynomial identity testing | 2011-02-18 | Paper |
| The orbit problem is in the GapL hierarchy | 2011-02-18 | Paper |
| Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes | 2011-02-07 | Paper |
| Uniform Derandomization from Pathetic Lower Bounds | 2010-09-10 | Paper |
| Isomorphism and canonization of tournaments and hypertournaments | 2010-08-18 | Paper |
| The complexity of exactly learning algebraic concepts | 2010-04-27 | Paper |
| The ideal membership problem and polynomial identity testing | 2010-04-08 | Paper |
| On Lower Bounds for Constant Width Arithmetic Circuits | 2009-12-17 | Paper |
| On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach | 2009-11-27 | Paper |
| Parameterized learnability of juntas | 2009-11-06 | Paper |
| Arithmetic Circuits, Monomial Algebras and Finite Automata | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396558 | 2009-09-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size | 2008-11-27 | Paper |
| Non-stabilizer quantum codes from Abelian subgroups of the error group | 2008-09-03 | Paper |
| Parameterized Learnability of k-Juntas and Related Problems | 2008-08-19 | Paper |
| The Orbit Problem Is in the GapL Hierarchy | 2008-07-10 | Paper |
| SZK proofs for black-box group problems | 2008-06-17 | Paper |
| A Logspace Algorithm for Partial 2-Tree Canonization | 2008-06-05 | Paper |
| The Space Complexity of k-Tree Isomorphism | 2008-05-27 | Paper |
| The Monomial Ideal Membership Problem and Polynomial Identity Testing | 2008-05-27 | Paper |
| On Isomorphism and Canonization of Tournaments and Hypertournaments | 2008-04-24 | Paper |
| The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem | 2008-04-24 | Paper |
| On Hypergraph and Graph Isomorphism with Bounded Color Classes | 2008-03-19 | Paper |
| Algorithmic Problems for Metrics on Permutation Groups | 2008-03-07 | Paper |
| The Complexity of Black-Box Ring Problems | 2007-09-10 | Paper |
| A Polynomial Time Nilpotence Test for Galois Groups and Related Results | 2007-09-05 | Paper |
| SZK Proofs for Black-Box Group Problems | 2007-05-02 | Paper |
| Graph Isomorphism is in SPP | 2006-06-30 | Paper |
| A family of quantum stabilizer codes based on the Weyl commutation relations over a finite field | 2006-02-17 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algorithmic Number Theory | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427867 | 2003-09-14 | Paper |
| Arithmetic complexity, Kleene closure, and formal power series | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4483915 | 2003-05-27 | Paper |
| New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. | 2003-05-14 | Paper |
| Numerical analysis of optical fibers with arbitrary refractive index profile | 2002-08-01 | Paper |
| On pseudorandomness and resource-bounded measure | 2001-08-20 | Paper |
| A nonadaptive NC checker for permutation group intersection | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501553 | 2001-06-13 | Paper |
| The complexity of modular graph automorphism | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525694 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511221 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501542 | 2000-09-04 | Paper |
| The counting complexity of group-definable languages | 2000-08-21 | Paper |
| Exact learning via teaching assistants | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251059 | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260374 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256649 | 1999-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246757 | 1999-06-15 | Paper |
| Constructivizing Membership Proofs in Complexity Classes | 1998-07-27 | Paper |
| Solvable black-box group problems are low for PP | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381387 | 1998-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370034 | 1998-05-25 | Paper |
| A note on decision versus search for graph automorphism | 1997-11-12 | Paper |
| Monotonous and randomized reductions to sparse sets | 1997-04-29 | Paper |
| If NP has polynomial-size circuits, then MA=AM | 1997-02-28 | Paper |
| Geometric sets of low information content | 1997-02-27 | Paper |
| Quasi-linear truth-table reductions to \(p\)-selective sets | 1997-02-27 | Paper |
| Upper bounds for the complexity of sparse and tally descriptions | 1996-02-20 | Paper |
| ON HELPING AND INTERACTIVE PROOF SYSTEMS | 1995-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281491 | 1994-03-10 | Paper |
| On a Hierarchy of Spectral Invariants for Graphs | N/A | Paper |
