| Publication | Date of Publication | Type |
|---|
| From holant to quantum entanglement and back | 2026-03-18 | Paper |
| A holant dichotomy: Is the FKT algorithm universal? | 2025-08-05 | Paper |
A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
Theoretical Computer Science | 2024-11-07 | Paper |
The computational complexity of Holant problems on 3-regular graphs
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7788431 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Holographic algorithms on domains of general size
Theory of Computing Systems | 2023-07-26 | Paper |
Complexity classification of the eight-vertex model
Information and Computation | 2023-07-17 | Paper |
A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory
Computational Complexity | 2023-07-10 | Paper |
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
SIAM Journal on Computing | 2022-05-03 | Paper |
FKT is not universal -- a planar holant dichotomy for symmetric constraints
Theory of Computing Systems | 2022-02-14 | Paper |
| Beyond Windability: An FPRAS for The Six-Vertex Model | 2022-02-07 | Paper |
| A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory | 2021-06-15 | Paper |
Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
Information and Computation | 2020-12-15 | Paper |
On blockwise symmetric matchgate signatures and higher domain \#CSP
Information and Computation | 2018-12-21 | Paper |
Complexity classification of the six-vertex model
Information and Computation | 2018-03-21 | Paper |
Holographic algorithm with matchgates is universal for planar \#CSP over Boolean domain
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
Information and Computation | 2014-11-28 | Paper |
Holographic algorithms on bases of rank 2
Information Processing Letters | 2014-07-18 | Paper |
Holographic algorithms on domain size \(k > 2\)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
| scientific article; zbMATH DE number 5943313 (Why is no real title available?) | 2011-08-25 | Paper |
| XTR-Kurosawa-Desmedt scheme | 2010-07-08 | Paper |
Improved blind signature schemes based on XTR system
Journal of Computer Applications | 2009-11-10 | Paper |
| A construction method of Cartesian authentication codes from BN pair decomposition of SL_n (F_q) | 2008-08-06 | Paper |
| The length of the element of maximal length in the Coxeter system of type A_n, B_n/C_n and D_n. | 2007-11-13 | Paper |
| scientific article; zbMATH DE number 5076251 (Why is no real title available?) | 2006-11-27 | Paper |
