| Equivalence Testing of Weighted Automata over Partially Commutative Monoids. | 0 | 0.34 | 2021 |
| A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. | 0 | 0.34 | 2020 |
| On the Weisfeiler-Leman Dimension of Fractional Packing. | 0 | 0.34 | 2020 |
| Efficient Black-Box Identity Testing over Free Group Algebra | 0 | 0.34 | 2019 |
| On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. | 0 | 0.34 | 2019 |
| Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. | 0 | 0.34 | 2018 |
| Fast Exact Algorithms Using Hadamard Product of Polynomials. | 1 | 0.37 | 2018 |
| A Note on Polynomial Identity Testing for Depth-3 Circuits. | 0 | 0.34 | 2018 |
| On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. | 0 | 0.34 | 2018 |
| Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. | 0 | 0.34 | 2018 |
| Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. | 0 | 0.34 | 2017 |
| Parameterized Complexity of Small Weight Automorphisms. | 0 | 0.34 | 2017 |
| Finding fixed point free elements and small bases in permutation groups. | 0 | 0.34 | 2017 |
| A Quest for Structure in Complexity. | 0 | 0.34 | 2017 |
| Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. | 0 | 0.34 | 2017 |
| Randomized Polynomial Time Identity Testing for Noncommutative Circuits. | 0 | 0.34 | 2016 |
| The Weisfeiler-Lehman Procedure. | 0 | 0.34 | 2016 |
| The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. | 0 | 0.34 | 2016 |
| Identity Testing for +-Regular Noncommutative Arithmetic Circuits. | 0 | 0.34 | 2016 |
| Some Lower Bound Results for Set-Multilinear Arithmetic Computations | 2 | 0.39 | 2015 |
| On Tinhofer’s Linear Programming Approach to Isomorphism Testing | 0 | 0.34 | 2015 |
| On the Complexity of Noncommutative Polynomial Factorization. | 0 | 0.34 | 2015 |
| On the Power of Color Refinement. | 7 | 0.47 | 2015 |
| Noncommutative Valiant's Classes: Structure and Complete Problems | 0 | 0.34 | 2015 |
| On the Complexity of Noncommutative Polynomial Factorization. | 3 | 0.46 | 2015 |
| Graph Isomorphism, Color Refinement, and Compactness. | 2 | 0.39 | 2015 |
| Robust Oracle Machines revisited. | 0 | 0.34 | 2015 |
| The Parameterized Complexity of Geometric Graph Isomorphism. | 0 | 0.34 | 2014 |
| The Complexity of Two Register and Skew Arithmetic Computation. | 1 | 0.40 | 2014 |
| The Complexity of Geometric Graph Isomorphism. | 0 | 0.34 | 2014 |
| Solving Linear Equations Parameterized by Hamming Weight. | 0 | 0.34 | 2014 |
| On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. | 1 | 0.35 | 2014 |
| The Parallel Complexity of Graph Canonization Under Abelian Group Action. | 0 | 0.34 | 2013 |
| On the isomorphism problem for decision trees and decision lists | 0 | 0.34 | 2013 |
| The Parameterized Complexity of some Permutation Group Problems | 0 | 0.34 | 2013 |
| The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. | 0 | 0.34 | 2013 |
| Approximate graph isomorphism | 5 | 0.43 | 2012 |
| Near-Optimal expanding generator sets for solvable permutation groups | 0 | 0.34 | 2012 |
| Isomorphism testing of Boolean functions computable by constant-depth circuits. | 0 | 0.34 | 2012 |
| Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs | 2 | 0.51 | 2011 |
| Noncommutative Arithmetic Circuits meet Finite Automata. | 0 | 0.34 | 2011 |
| EXPANDING GENERATING SETS FOR SOLVABLE PERMUTATION GROUPS | 0 | 0.34 | 2011 |
| Solvable Group Isomorphism Is (Almost) in NP ∩ coNP | 6 | 0.51 | 2011 |
| Colored Hypergraph Isomorphism is Fixed Parameter Tractable | 3 | 0.41 | 2010 |
| Uniform derandomization from pathetic lower bounds. | 2 | 0.37 | 2010 |
| Arithmetic Circuits, Monomial Algebras and Finite Automata | 0 | 0.34 | 2009 |
| Colored Hypergraph Isomorphism is Fixed Parameter Tractable. | 0 | 0.34 | 2009 |
| The Remote Point Problem, Small Bias Space, and Expanding Generator Sets | 3 | 0.42 | 2009 |
| Arithmetic Circuit Size, Identity Testing, and Finite Automata | 2 | 0.37 | 2009 |
| Circuit Lower Bounds, Help Functions, and the Remote Point Problem | 0 | 0.34 | 2009 |
