# Advanced search

## Advanced search in people

Journal of Symbolic Computation > 2018 > 85 > Complete > 55-71

^{g}=s can be thought of as a kind of logarithm. In this paper, we study the case where G=S

_{n}and develop analogs to Shanks' baby-step / giant-step procedure for ordinary discrete logarithms. Specifically, we compute two sets A,B S

_{n}such that every permutation...

Journal of Symbolic Computation > 2018 > 85 > Complete > 25-54

Journal of Symbolic Computation > 2018 > 85 > Complete > 170-187

_{q}[x]/F, where q=p

^{n}is a prime power and F F

_{q}[x] is a polynomial not necessarily irreducible. Based on this result, a new set of expander graphs can be explicitly constructed. In addition, we present algorithms for basis...

Journal of Symbolic Computation > 2018 > 85 > Complete > 247-274

Journal of Symbolic Computation > 2018 > 85 > Complete > 72-107

Journal of Symbolic Computation > 2018 > 85 > Complete > 206-223

Journal of Symbolic Computation > 2018 > 85 > Complete > 188-205

Journal of Symbolic Computation > 2018 > 85 > Complete > 148-169

Journal of Symbolic Computation > 2018 > 85 > Complete > 224-246

Journal of Symbolic Computation > 2018 > 85 > Complete > 4-24

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 560-567

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 568-584

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 508-533

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 585-609

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 636-673

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 491-507

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 610-635

Journal of Pure and Applied Algebra > 2018 > 222 > 3 > 703-745