Permutation

Results: 881



#Item
11(ARCHIVED as of AUGUST 5, 2015): DRAFT FIPS 202, SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions

(ARCHIVED as of AUGUST 5, 2015): DRAFT FIPS 202, SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions

Add to Reading List

Source URL: csrc.nist.gov

- Date: 2017-03-01 15:35:52
    12Convex Relaxations for Permutation Problems Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

    Convex Relaxations for Permutation Problems Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

    Add to Reading List

    Source URL: www.di.ens.fr

      13Convex Relaxations for Permutation Problems Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

      Convex Relaxations for Permutation Problems Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

      Add to Reading List

      Source URL: www.di.ens.fr

      - Date: 2013-09-14 11:27:57
        14Phasing: Private Set Intersection using Permutation-based Hashing (Full Version)∗ Benny Pinkas Bar-Ilan University, Israel

        Phasing: Private Set Intersection using Permutation-based Hashing (Full Version)∗ Benny Pinkas Bar-Ilan University, Israel

        Add to Reading List

        Source URL: eprint.iacr.org

        - Date: 2016-07-27 04:51:05
          15VALUATIONS ON RATIONAL FUNCTION FIELDS THAT ARE INVARIANT UNDER PERMUTATION OF THE VARIABLES F.-V. KUHLMANN, K. KUHLMANN, AND C. VIS¸AN Abstract. We study and characterize the class of valuations on rational functions f

          VALUATIONS ON RATIONAL FUNCTION FIELDS THAT ARE INVARIANT UNDER PERMUTATION OF THE VARIABLES F.-V. KUHLMANN, K. KUHLMANN, AND C. VIS¸AN Abstract. We study and characterize the class of valuations on rational functions f

          Add to Reading List

          Source URL: math.usask.ca

          - Date: 2016-07-23 02:09:00
            16An Upper Bound on the Number of Circular Transpositions to Sort a Permutation Anke van Zuylen∗, James Bieron, Frans Schalekamp, Gexin Yu1 Department of Mathematics, The College of William and Mary, Williamsburg, VA, 23

            An Upper Bound on the Number of Circular Transpositions to Sort a Permutation Anke van Zuylen∗, James Bieron, Frans Schalekamp, Gexin Yu1 Department of Mathematics, The College of William and Mary, Williamsburg, VA, 23

            Add to Reading List

            Source URL: arvanzuijlen.people.wm.edu

            - Date: 2015-02-27 12:37:41
              17OPTIMIZING INTERCONNECTION COMPLEXITY FOR REALIZING FIXED PERMUTATION IN DATA AND SIGNAL PROCESSING ALGORITHMS∗ Ren Chen and Viktor K. Prasanna Ming Hsieh Department of Electrical Engineering University of Southern Cal

              OPTIMIZING INTERCONNECTION COMPLEXITY FOR REALIZING FIXED PERMUTATION IN DATA AND SIGNAL PROCESSING ALGORITHMS∗ Ren Chen and Viktor K. Prasanna Ming Hsieh Department of Electrical Engineering University of Southern Cal

              Add to Reading List

              Source URL: ganges.usc.edu

              - Date: 2016-11-19 16:13:58
                18Irreducible and connected permutations Martin Klazar∗ Abstract A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n],

                Irreducible and connected permutations Martin Klazar∗ Abstract A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n],

                Add to Reading List

                Source URL: kam.mff.cuni.cz

                - Date: 2003-03-05 09:54:11
                  19Branchwidth of Graphs boosting approach, applied to them, minimizes the output size. These pages have provided convincing evidence that the Burrows–Wheeler Transform is an elegant and efficient permutation P . Surpris

                  Branchwidth of Graphs boosting approach, applied to them, minimizes the output size. These pages have provided convincing evidence that the Burrows–Wheeler Transform is an elegant and efficient permutation P . Surpris

                  Add to Reading List

                  Source URL: users.uoa.gr

                  - Date: 2014-06-11 17:30:26
                    20Groups of Permutation Polynomials Introduction Construction

                    Groups of Permutation Polynomials Introduction Construction

                    Add to Reading List

                    Source URL: www.math.uni-magdeburg.de

                    - Date: 2013-08-27 15:04:22