The following pages link to Daniel Panario (Q169310):
Displaying 50 items.
- (Q224254) (redirect page) (← links)
- General conditional recurrences (Q279890) (← links)
- Computing Gröbner bases associated with lattices (Q340181) (← links)
- Divisibility of polynomials over finite fields and combinatorial applications (Q411500) (← links)
- In honour of the research and influence of Joachim von zur Gathen at 60 (Q412195) (← links)
- An asymptotic formula for the number of irreducible transformation shift registers (Q491103) (← links)
- Counting words by number of occurrences of some patterns (Q553997) (← links)
- Asymptotics of combinatorial structures with large smallest component (Q598440) (← links)
- Sets of orthogonal hypercubes of class \(r\) (Q654898) (← links)
- Enumeration of decomposable combinatorial structures with restricted patterns (Q659766) (← links)
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields (Q765803) (← links)
- A trigonometric approach for Dickson polynomials over fields of characteristic two (Q780364) (← links)
- Asymptotics of largest components in combinatorial structures (Q866953) (← links)
- A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics (Q870022) (← links)
- Linear complexity profile and correlation measure of interleaved sequences (Q892510) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms (Q965987) (← links)
- The trace of an optimal normal element and low complexity normal bases (Q1009092) (← links)
- Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
- Density of normal elements (Q1266417) (← links)
- Low complexity normal bases in \(\mathbb F_{2^n}\) (Q1418182) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem (Q1611366) (← links)
- Asymptotics of subtracted singularities for generating functions with small singularities (Q1612305) (← links)
- Nonlinear vectorial primitive recursive sequences (Q1667449) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- Covering arrays from \(m\)-sequences and character sums (Q1675282) (← links)
- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) (Q1705651) (← links)
- Normal basis exhaustive search: 10 years later (Q1725945) (← links)
- The graph structure of Chebyshev polynomials over finite fields and applications (Q1727357) (← links)
- The functional graph of linear maps over finite fields and applications (Q1727359) (← links)
- Number of \(t\)-tuples in arrays from LFSRs (Q1742692) (← links)
- Cycle structure of permutation functions over finite fields and their applications (Q1760069) (← links)
- The degree of the splitting field of a random polynomial over a finite field (Q1773184) (← links)
- Smallest components in decomposable structures: Exp-log class (Q1840512) (← links)
- Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\) (Q1944037) (← links)
- Subfield value sets of polynomials over finite fields (Q1948718) (← links)
- Generalized Alcuin's sequence (Q1953369) (← links)
- Bounds on covering codes in RT spaces using ordered covering arrays (Q2175413) (← links)
- Unicyclic strong permutations (Q2179491) (← links)
- QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field (Q2194500) (← links)
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes (Q2194505) (← links)
- Finding linearly generated subsequences (Q2232219) (← links)
- Fixed points of rational functions satisfying the Carlitz property (Q2280309) (← links)
- Construction of irreducible polynomials through rational transformations (Q2301892) (← links)
- Locating modifications in signed data for partial data integrity (Q2348699) (← links)
- Division of trinomials by pentanomials and orthogonal arrays (Q2384052) (← links)
- Cycle structure of iterating Rédei functions (Q2397505) (← links)
- Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields (Q2401974) (← links)
