The following pages link to FXT (Q17488):
Displaying 15 items.
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields (Q468704) (← links)
- Self-replication and Borwein-like algorithms (Q1623892) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- Gray codes for Fibonacci \(q\)-decreasing words (Q2163389) (← links)
- Ordered line integral methods for solving the eikonal equation (Q2291900) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- A Pascal-like bound for the number of necklaces with fixed density (Q2420574) (← links)
- Texture description through histograms of equivalent patterns (Q2513319) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Finite size corrections relating to distributions of the length of longest increasing subsequences (Q2687279) (← links)
- A unified strategy to compute some special functions of number-theoretic interest (Q2689521) (← links)
- Binary Kloosterman Sums with Value 4 (Q3104685) (← links)
- A numeral system for the middle-levels graphs (Q4958054) (← links)
- Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms (Q5864089) (← links)
