Randomization

Results: 457



#Item
1Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2002-04-25 06:22:12
    22013 IEEE Symposium on Security and Privacy Practical Control Flow Integrity & Randomization for Binary Executables Chao Zhang1 , Tao Wei1,2∗ , Zhaofeng Chen1 , Lei Duan1 , L´aszl´o Szekeres2,3+ , Stephen McCamant2,

    2013 IEEE Symposium on Security and Privacy Practical Control Flow Integrity & Randomization for Binary Executables Chao Zhang1 , Tao Wei1,2∗ , Zhaofeng Chen1 , Lei Duan1 , L´aszl´o Szekeres2,3+ , Stephen McCamant2,

    Add to Reading List

    Source URL: seclab.cs.sunysb.edu

    Language: English - Date: 2016-02-03 15:00:11
      3APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

      APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

      Add to Reading List

      Source URL: cui.unige.ch

      Language: English - Date: 2012-03-28 05:35:32
        4Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.

        Coin Flipping Cannot Shorten Arithmetic Computations Stasys Jukna Abstract. We use elementary arguments to show that randomization cannot spare even one single ring operation to compute real multivariate polynomials.

        Add to Reading List

        Source URL: lovelace.thi.informatik.uni-frankfurt.de

        Language: English - Date: 2018-04-11 14:05:21
          5ASLR: How Robust is the Randomness? Jonathan Ganz What is Address Space Layout Randomization? ● Provides System-Level Control-Flow Integrity

          ASLR: How Robust is the Randomness? Jonathan Ganz What is Address Space Layout Randomization? ● Provides System-Level Control-Flow Integrity

          Add to Reading List

          Source URL: s3.amazonaws.com

          Language: English - Date: 2017-09-25 15:39:32
            6TESTING EQUALITY OF SPECTRAL DENSITIES USING RANDOMIZATION TECHNIQUES CARSTEN JENTSCH AND MARKUS PAULY Abstract. In this paper we investigate the testing problem that the spectral density matrices of several, not necessa

            TESTING EQUALITY OF SPECTRAL DENSITIES USING RANDOMIZATION TECHNIQUES CARSTEN JENTSCH AND MARKUS PAULY Abstract. In this paper we investigate the testing problem that the spectral density matrices of several, not necessa

            Add to Reading List

            Source URL: mammen.vwl.uni-mannheim.de

            Language: English - Date: 2013-12-11 12:34:13
              7Collusion, Randomization and Leadership in Groups Rohan Dutta, David K. Levine and Salvatore Modica 1

              Collusion, Randomization and Leadership in Groups Rohan Dutta, David K. Levine and Salvatore Modica 1

              Add to Reading List

              Source URL: www.dklevine.com

              Language: English - Date: 2015-02-01 05:22:51
                8RANDOMThe 21st International Workshop on Randomization and Computation and

                RANDOMThe 21st International Workshop on Randomization and Computation and

                Add to Reading List

                Source URL: cui.unige.ch

                Language: English - Date: 2017-01-30 15:56:52
                  9Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions

                  Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions

                  Add to Reading List

                  Source URL: www.wisdom.weizmann.ac.il

                  Language: English - Date: 2014-06-22 06:27:31
                    10Randomization, Endogeneity and Laboratory Experiments: The Role of Cash Balances in Private Value Auctions John C. Ham Ohio State University

                    Randomization, Endogeneity and Laboratory Experiments: The Role of Cash Balances in Private Value Auctions John C. Ham Ohio State University

                    Add to Reading List

                    Source URL: www.econ.ohio-state.edu

                    Language: English - Date: 2011-12-15 19:09:29