Randomness

Results: 1720



#Item
21Low-end Uniform Hardness vs. Randomness Tradeoffs for AM Ronen Shaltiel ∗

Low-end Uniform Hardness vs. Randomness Tradeoffs for AM Ronen Shaltiel ∗

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2007-03-22 14:10:23
    22On Fairness, Diversity and Randomness in Algorithmic Decision Making Nina Grgić-Hlača1 , Muhammad Bilal Zafar1 , Krishna P. Gummadi1 , and Adrian Weller2,3,4 arXiv:1706.10208v1 [stat.ML] 30 Jun 2017

    On Fairness, Diversity and Randomness in Algorithmic Decision Making Nina Grgić-Hlača1 , Muhammad Bilal Zafar1 , Krishna P. Gummadi1 , and Adrian Weller2,3,4 arXiv:1706.10208v1 [stat.ML] 30 Jun 2017

    Add to Reading List

    Source URL: arxiv.org

    - Date: 2017-07-02 20:34:49
      23On Bitcoin as a public randomness source Joseph Bonneau1 , Jeremy Clark2 , and Steven Goldfeder3 1 Stanford University Concordia University

      On Bitcoin as a public randomness source Joseph Bonneau1 , Jeremy Clark2 , and Steven Goldfeder3 1 Stanford University Concordia University

      Add to Reading List

      Source URL: eprint.iacr.org

      - Date: 2015-10-18 18:58:31
        24STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

        STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

        Add to Reading List

        Source URL: terrytao.files.wordpress.com

        - Date: 2009-09-14 06:37:41
          25Judgment and Decision Making, Vol. 6, No. 6, August 2011, pp. 531–541 Disentangling the effects of alternation rate and maximum run length on judgments of randomness Sabine G. Scholl∗

          Judgment and Decision Making, Vol. 6, No. 6, August 2011, pp. 531–541 Disentangling the effects of alternation rate and maximum run length on judgments of randomness Sabine G. Scholl∗

          Add to Reading List

          Source URL: journal.sjdm.org

          - Date: 2011-09-26 14:04:19
            26Scalable Bias-Resistant Distributed Randomness Ewa Syta∗ , Philipp Jovanovic† , Eleftherios Kokoris Kogias† , Nicolas Gailly† , Linus Gasser† , Ismail Khoffi† , Michael J. Fischer‡ , Bryan Ford† ∗ Trini

            Scalable Bias-Resistant Distributed Randomness Ewa Syta∗ , Philipp Jovanovic† , Eleftherios Kokoris Kogias† , Nicolas Gailly† , Linus Gasser† , Ismail Khoffi† , Michael J. Fischer‡ , Bryan Ford† ∗ Trini

            Add to Reading List

            Source URL: eprint.iacr.org

            - Date: 2016-11-16 04:07:51
              27CS271 Randomness & Computation Fall 2011 Lecture 8: September 20 Lecturer: Alistair Sinclair

              CS271 Randomness & Computation Fall 2011 Lecture 8: September 20 Lecturer: Alistair Sinclair

              Add to Reading List

              Source URL: people.eecs.berkeley.edu

              - Date: 2011-09-21 01:22:54
                28Description of the project Feasibility, Logic and Randomness  (FEALORA) This   project   was   proposed   as   an   Advanced   Grant   of   the   European   Research   Council.   The   panel  recom

                Description of the project Feasibility, Logic and Randomness  (FEALORA) This   project   was   proposed   as   an   Advanced   Grant   of   the   European   Research   Council.   The   panel  recom

                Add to Reading List

                Source URL: users.math.cas.cz

                - Date: 2013-09-04 06:06:20
                  29Randomness for capacities with applications to random closed sets Jason Rute I will prove the following conjecture of Diamondstone and Kjos-Hanssen: the members of the Martin-Löf random closed sets (of Barmpalias, Brodh

                  Randomness for capacities with applications to random closed sets Jason Rute I will prove the following conjecture of Diamondstone and Kjos-Hanssen: the members of the Martin-Löf random closed sets (of Barmpalias, Brodh

                  Add to Reading List

                  Source URL: www2.ims.nus.edu.sg

                  - Date: 2014-05-22 11:28:48
                    30Jason M Rute* (). Schnorr randomness for noncomputable measures. The field of algorithmic randomness allows one to separate the real numbers into those which are random and which are not, w

                    Jason M Rute* (). Schnorr randomness for noncomputable measures. The field of algorithmic randomness allows one to separate the real numbers into those which are random and which are not, w

                    Add to Reading List

                    Source URL: jointmathematicsmeetings.org

                    - Date: 2013-09-19 00:46:25