The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. | 0 | 0.34 | 2020 |
Linear-time exact sampling of sum-constrained random variables. | 0 | 0.34 | 2018 |
The complexity of the Multiple Pattern Matching Problem for random strings. | 0 | 0.34 | 2018 |
Linear-time generation of inhomogeneous random directed walks. | 0 | 0.34 | 2015 |
A one-parameter refinement of the Razumov-Stroganov correspondence. | 0 | 0.34 | 2014 |
Linear-time generation of specifiable combinatorial structures: general theory and first examples. | 1 | 0.35 | 2013 |
Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and pfaffians | 3 | 0.47 | 2013 |
Proof of the Razumov-Stroganov conjecture | 21 | 2.40 | 2011 |
Asymptotic enumeration of Minimal Automata | 7 | 0.71 | 2011 |
Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities. I. Generalizations of the Capelli and Turnbull identities | 4 | 0.55 | 2009 |
A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs | 3 | 0.41 | 2008 |
A Hike in the Phases of the 1-in-3 Satisfiability | 1 | 0.74 | 2007 |
One-in-Two-Matching Problem is NP-complete | 0 | 0.34 | 2006 |