| Publication | Date of Publication | Type |
|---|
| Restricted Holant dichotomy on domain sizes 3 and 4 | 2024-12-12 | Paper |
| Planar \#CSP equality corresponds to quantum isomorphism -- A Holant viewpoint | 2024-11-14 | Paper |
| Restricted Holant dichotomy on domains 3 and 4 | 2024-09-16 | Paper |
| Bounded degree nonnegative counting CSP | 2024-08-06 | Paper |
| The complexity of counting planar graph homomorphisms of domain size 3 | 2024-05-08 | Paper |
| Counting cycles on planar graphs in subexponential time | 2024-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147347 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147348 | 2024-01-15 | Paper |
| Counting cycles on planar graphs in subexponential time | 2023-08-10 | Paper |
| Holographic algorithms on domains of general size | 2023-07-26 | Paper |
| Complexity classification of the eight-vertex model | 2023-07-17 | Paper |
| A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory | 2023-07-10 | Paper |
| Where Tutte and Holant meet: a view from counting complexity | 2023-04-28 | Paper |
| Perfect matchings, rank of connection tensors and graph homomorphisms | 2023-03-31 | Paper |
| Dichotomy result on 3-regular bipartite non-negative functions | 2023-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875711 | 2023-02-03 | Paper |
| A dichotomy for bounded degree graph homomorphisms with nonnegative weights | 2023-01-09 | Paper |
| Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint | 2022-12-06 | Paper |
| Promise problems and access to unambiguous computation | 2022-08-18 | Paper |
| On the power of parity polynomial time | 2022-08-16 | Paper |
| Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain | 2022-05-03 | Paper |
| On a Theorem of Lovász that (&sdot, H ) Determines the Isomorphism Type of H | 2022-03-22 | Paper |
| Dichotomy result on 3-regular bipartite non-negative functions | 2022-03-21 | Paper |
| FKT is not universal -- a planar holant dichotomy for symmetric constraints | 2022-02-14 | Paper |
| The complexity of counting edge colorings for simple graphs | 2021-10-06 | Paper |
| A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory | 2021-06-15 | Paper |
| Dichotomy for Holant\(^\ast\) problems on the Boolean domain | 2021-06-11 | Paper |
| Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS | 2020-12-15 | Paper |
| Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs | 2020-04-14 | Paper |
| Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy | 2019-12-16 | Paper |
| Approximability of the Six-vertex Model | 2019-10-15 | Paper |
| Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms | 2019-10-15 | Paper |
| On a Theorem of Lov\'asz that $\hom(\cdot, H)$ Determines the Isomorphism Type of $H$ | 2019-09-09 | Paper |
| A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights | 2019-08-30 | Paper |
| Dichotomy for Holant Problems with a Function on Domain Size 3 | 2019-05-15 | Paper |
| Clifford gates in the Holant framework | 2018-09-24 | Paper |
| Complexity of Counting CSP with Complex Weights | 2018-05-17 | Paper |
| Complexity classification of the six-vertex model | 2018-03-21 | Paper |
| Holographic algorithms beyond matchgates | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608007 | 2018-03-15 | Paper |
| Complexity Dichotomies for Counting Problems | 2018-01-02 | Paper |
| Fine separation of average time complexity classes | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365150 | 2017-09-29 | Paper |
| Holographic algorithm with matchgates is universal for planar #CSP over boolean domain | 2017-08-17 | Paper |
| Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP | 2017-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969647 | 2017-03-22 | Paper |
| Nonnegative Weighted #CSP: An Effective Complexity Dichotomy | 2016-12-21 | Paper |
| Gadgets and anti-gadgets leading to a complexity dichotomy | 2016-10-07 | Paper |
| Hardness and hierarchy theorems for probabilistic quasi-polynomial time | 2016-09-29 | Paper |
| Holant problems for 3-regular graphs with complex edge functions | 2016-09-21 | Paper |
| The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems | 2016-09-09 | Paper |
| A complete dichotomy rises from the capture of vanishing signatures | 2016-09-02 | Paper |
| A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes | 2016-06-16 | Paper |
| Erratum to: ``Signature theory in holographic algorithms | 2016-05-31 | Paper |
| \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2016-04-18 | Paper |
| Holant problems and counting CSP | 2015-02-04 | Paper |
| A collapse theorem for holographic algorithms with matchgates on domain size at most 4 | 2014-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191606 | 2014-10-06 | Paper |
| Circuit minimization problem | 2014-09-26 | Paper |
| A complete dichotomy rises from the capture of vanishing signatures | 2014-08-07 | Paper |
| Holographic algorithms beyond matchgates | 2014-07-01 | Paper |
| Complexity of counting CSP with complex weights | 2014-05-13 | Paper |
| The complexity of complex weighted Boolean \#CSP | 2014-01-28 | Paper |
| Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions | 2014-01-10 | Paper |
| Graph homomorphisms with complex values: a dichotomy theorem | 2013-09-25 | Paper |
| Complexity Dichotomy for Counting Problems | 2013-03-18 | Paper |
| From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems | 2013-01-28 | Paper |
| Holographic algorithms by Fibonacci gates | 2013-01-16 | Paper |
| Holographic reduction, interpolation and hardness | 2012-12-27 | Paper |
| Spin systems on \(k\)-regular graphs with complex edge functions | 2012-11-27 | Paper |
| Inapproximability after Uniqueness Phase Transition in Two-Spin Systems | 2012-11-02 | Paper |
| Holographic Algorithms on Domain Size k > 2 | 2012-07-16 | Paper |
| Holant Problems for Regular Graphs with Complex Edge Functions | 2012-01-23 | Paper |
| Honeynet games: A game theoretic approach to defending network monitors | 2011-12-15 | Paper |
| Signature theory in holographic algorithms | 2011-12-14 | Paper |
| Computational Complexity of Holant Problems | 2011-11-07 | Paper |
| Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities | 2011-08-17 | Paper |
| Progress in Complexity of Counting Problems | 2011-06-03 | Paper |
| A computational proof of complexity of some restricted counting problems | 2011-05-18 | Paper |
| On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results | 2011-03-18 | Paper |
| Approximation and hardness results for label cut and related problems | 2011-03-17 | Paper |
| Quadratic lower bound for permanent vs. determinant in any characteristic | 2011-02-07 | Paper |
| Holographic algorithms: from art to science | 2011-01-18 | Paper |
| From Holant to #CSP and Back: Dichotomy for Holant c Problems | 2010-12-09 | Paper |
| On Tractable Exponential Sums | 2010-09-07 | Paper |
| Graph Homomorphisms with Complex Values: A Dichotomy Theorem | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579392 | 2010-08-06 | Paper |
| A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions | 2010-06-17 | Paper |
| On symmetric signatures in holographic algorithms | 2010-05-05 | Paper |
| A novel information transmission problem and its optimal solution | 2010-04-13 | Paper |
| On blockwise symmetric signatures for matchgates | 2010-02-09 | Paper |
| On the theory of matchgate computations | 2009-09-18 | Paper |
| A note on quadratic residuosity and UP | 2009-08-27 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| An Attacker-Defender Game for Honeynets | 2009-07-23 | Paper |
| Relativized collapsing between BPP and PH under stringent oracle access | 2009-07-21 | Paper |
| Approximation and Hardness Results for Label Cut and Related Problems | 2009-06-03 | Paper |
| A Computational Proof of Complexity of Some Restricted Counting Problems | 2009-06-03 | Paper |
| Holographic algorithms: the power of dimensionality resolved | 2009-04-29 | Paper |
| Some Results on Matchgates and Holographic Algorithms | 2009-03-12 | Paper |
| Holographic algorithms | 2009-02-09 | Paper |
| Signature Theory in Holographic Algorithms | 2009-01-29 | Paper |
| Holographic algorithms: from art to science | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302072 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3539625 | 2008-11-19 | Paper |
| Basis collapse in holographic algorithms | 2008-08-20 | Paper |
| A Novel Information Transmission Problem and Its Optimal Solution | 2008-02-26 | Paper |
| On Block-Wise Symmetric Signatures for Matchgates | 2008-02-26 | Paper |
| Holographic Algorithms: The Power of Dimensionality Resolved | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Valiant's holant theorem and matchgate tensors | 2007-09-28 | Paper |
| On Symmetric Signatures in Holographic Algorithms | 2007-09-03 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) | 2007-01-22 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Time-space tradeoff in derandomizing probabilistic logspace | 2006-10-25 | Paper |
| Random access to advice strings and collapsing results | 2006-10-16 | Paper |
| On zero error algorithms having oracle access to one query | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| ON HIGHER ARTHUR-MERLIN CLASSES | 2005-10-19 | Paper |
| Competing provers yield improved Karp-Lipton collapse results | 2005-05-04 | Paper |
| On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808618 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472474 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425941 | 2003-09-14 | Paper |
| Essentially every unimodular matrix defines an expander | 2003-08-27 | Paper |
| On testing for zero polynomials by a set of points with bounded precision. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418679 | 2003-08-11 | Paper |
| A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor | 2003-03-09 | Paper |
| A lattice-based public-key cryptosystem | 2003-01-14 | Paper |
| A New Transference Theorem in the Geometry of Numbers | 2002-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551384 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739433 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525698 | 2001-01-24 | Paper |
| A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. | 2000-12-12 | Paper |
| The Complexity of theA B CProblem | 2000-10-18 | Paper |
| Robust reductions | 2000-03-07 | Paper |
| Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions | 2000-01-17 | Paper |
| Fine Separation of Average-Time Complexity Classes | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250819 | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266551 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258570 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218419 | 1999-05-18 | Paper |
| On a scheduling problem of time deteriorating jobs | 1999-02-16 | Paper |
| A relation of primal--dual lattices and the complexity of shortest lattice vector problem | 1999-01-12 | Paper |
| Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns | 1998-05-25 | Paper |
| Frobenius's degree formula and Toda's polynomials | 1998-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364600 | 1997-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335191 | 1997-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359456 | 1997-10-08 | Paper |
| On the correlation of symmetric functions | 1996-12-01 | Paper |
| On the correlation of symmetric functions | 1996-09-09 | Paper |
| On the impossibility of amplifying the independence of random variables | 1996-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875224 | 1996-06-18 | Paper |
| COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME | 1995-10-29 | Paper |
| On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line | 1995-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281495 | 1994-08-31 | Paper |
| Subquadratic Simulations of Balanced Formulae by Branching Programs | 1994-08-14 | Paper |
| PSPACE is provable by two provers in one round | 1994-04-27 | Paper |
| Taking random walks to grow trees in hypercubes | 1993-12-09 | Paper |
| An optimal lower bound on the number of variables for graph identification | 1993-03-10 | Paper |
| On games of incomplete information | 1993-01-16 | Paper |
| PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975930 | 1992-06-26 | Paper |
| A note on enumerative counting | 1991-01-01 | Paper |
| A note on the determinant and permanent problem | 1990-01-01 | Paper |
| On the power of parity polynomial time | 1990-01-01 | Paper |
| Lower bounds for constant-depth circuits in the presence of help bits | 1990-01-01 | Paper |
| With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy | 1989-01-01 | Paper |
| The Boolean Hierarchy II: Applications | 1989-01-01 | Paper |
| Enumerative counting is hard | 1989-01-01 | Paper |
| The Boolean Hierarchy I: Structural Properties | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3766875 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773331 | 1987-01-01 | Paper |
| Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete | 1987-01-01 | Paper |
| The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices | 1986-01-01 | Paper |
| A Uniformly Random Solution to Algorithmic Redistricting | N/A | Paper |
