Permutations

Results: 385



#Item
11Intersecting Families of Permutations David Ellis∗, Ehud Friedgut†and Haran Pilpel‡ Abstract A set of permutations I ⊂ Sn is said to be k-intersecting if any two permutations in I agree on at least k points. We s

Intersecting Families of Permutations David Ellis∗, Ehud Friedgut†and Haran Pilpel‡ Abstract A set of permutations I ⊂ Sn is said to be k-intersecting if any two permutations in I agree on at least k points. We s

Add to Reading List

Source URL: www.ma.huji.ac.il

Language: English - Date: 2010-11-13 14:27:39
    12Stanford University Concurrent VLSI Architecture Memo 121 Stanford University Computer Systems Laboratory Finding Worst-case Permutations for

    Stanford University Concurrent VLSI Architecture Memo 121 Stanford University Computer Systems Laboratory Finding Worst-case Permutations for

    Add to Reading List

    Source URL: cva.stanford.edu

    Language: English
      13Edge Sequences, Ribbon Tableaux, and an Action of Affine Permutations Marc A. A. van Leeuwen Universit´e de Poitiers, D´epartement de Math´ematiques, SP2MI, T´el´eport 2, BP 179, 86960 Futuroscope Cedex, France

      Edge Sequences, Ribbon Tableaux, and an Action of Affine Permutations Marc A. A. van Leeuwen Universit´e de Poitiers, D´epartement de Math´ematiques, SP2MI, T´el´eport 2, BP 179, 86960 Futuroscope Cedex, France

      Add to Reading List

      Source URL: www-math.univ-poitiers.fr

      Language: English - Date: 2014-09-01 05:21:14
        14One-way Trapdoor Permutations Are Sucient for Non-Trivial Single-Server Private Information Retrieval  Eyal Kushilevitzy Rafail Ostrovskyz Abstract

        One-way Trapdoor Permutations Are Sucient for Non-Trivial Single-Server Private Information Retrieval  Eyal Kushilevitzy Rafail Ostrovskyz Abstract

        Add to Reading List

        Source URL: web.cs.ucla.edu

        Language: English - Date: 2003-09-23 18:59:29
          15COUNTABILITY AND PERMUTATIONS 5 minute review. Recap the definition of a countable set, that is a set in bijective correspondence with N = {1, 2, 3, . . .}, and that this is equivalent to the set having a presentation {

          COUNTABILITY AND PERMUTATIONS 5 minute review. Recap the definition of a countable set, that is a set in bijective correspondence with N = {1, 2, 3, . . .}, and that this is equivalent to the set having a presentation {

          Add to Reading List

          Source URL: sam-marsh.staff.shef.ac.uk

          - Date: 2017-03-31 10:19:18
            16New York Journal of Mathematics New York J. Math–398. Primes, permutations and primitive roots Joseph Lewittes and Victor Kolyvagin Abstract. Let p be a prime greater than 3, X = {1, 2, . . . , p − 1}

            New York Journal of Mathematics New York J. Math–398. Primes, permutations and primitive roots Joseph Lewittes and Victor Kolyvagin Abstract. Let p be a prime greater than 3, X = {1, 2, . . . , p − 1}

            Add to Reading List

            Source URL: nyjm.albany.edu

            - Date: 2010-11-09 22:58:19
              17FPSAC 2011, Reykjavik, Iceland DMTCS proc. (subm.), by the authors, 1–10 Local extrema in random permutations and the structure of longest alternating

              FPSAC 2011, Reykjavik, Iceland DMTCS proc. (subm.), by the authors, 1–10 Local extrema in random permutations and the structure of longest alternating

              Add to Reading List

              Source URL: www.math.ucdavis.edu

              - Date: 2014-02-10 20:43:54
                18Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2, ..., n2 whose longest monotone subsequence is of length n and are therefore extremal for the Erd˝ os-Szekeres theorem. S

                Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2, ..., n2 whose longest monotone subsequence is of length n and are therefore extremal for the Erd˝ os-Szekeres theorem. S

                Add to Reading List

                Source URL: www.math.ucdavis.edu

                - Date: 2014-02-10 20:43:57
                  19Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows† Christof Beierle1 , Philipp Jovanovic2 , Martin M. Lauridsen3 , Gregor Leander1? , and Christian Rechberger3 1

                  Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows† Christof Beierle1 , Philipp Jovanovic2 , Martin M. Lauridsen3 , Gregor Leander1? , and Christian Rechberger3 1

                  Add to Reading List

                  Source URL: eprint.iacr.org

                  - Date: 2016-01-05 09:31:19
                    20Logarithmic Space and Permutations (Joint work with Clément Aubert) Thomas Seiller Journée GeoCal, Lyon, 15 Février 2013

                    Logarithmic Space and Permutations (Joint work with Clément Aubert) Thomas Seiller Journée GeoCal, Lyon, 15 Février 2013

                    Add to Reading List

                    Source URL: perso.ens-lyon.fr

                    - Date: 2013-03-14 09:52:41