Moni

Results: 310



#Item
91

Hardness Preserving Reductions via Cuckoo Hashing Itay Berman1⋆ , Iftach Haitner1⋆ , Ilan Komargodaki2⋆⋆ , and Moni Naor2⋆ ⋆ ⋆ 1 Tel Aviv University. Email: {itayberm@post,iftachh@cs}.tau.ac.il

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2013-06-11 04:11:55
    92

    Algorithmic Game Theory - handout2 Uriel Feige, Robert Krauthgamer, Moni Maor 12 November 2008 It you have the library copy of [NRTV], please return it to the library as soon as possible. Homework. (Please keep the answe

    Add to Reading List

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

    Language: English - Date: 2008-11-11 12:17:47
      93

      Randomized Algorithms 2013A Lecture 5 – Martingales, Closest Pairs, Hash Tables, Existential Proofs and Codes ∗ Moni Naor The lecture covered quite varied material, starting from Martingales, moving to a linear time

      Add to Reading List

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

      Language: English - Date: 2012-12-06 01:55:15
        94

        De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results Yuriy Arbitman∗ Moni Naor†

        Add to Reading List

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

        Language: English - Date: 2009-05-03 13:29:04
          95

          RINTASYÖVÄN SEULONTA MAMMOGRAFIALLA Millaisia hyödyllisiä ja haitallisia seurauksia rintasyöpäseulontaan osallistumisella on? Miten moni hyötyy seulontaan osallistumisesta ja

          Add to Reading List

          Source URL: www.cochrane.dk

          Language: Finnish - Date: 2012-09-03 10:21:28
            96

            Algorithmic Game Theory – Handout 6 Uriel Feige, Robert Krauthgamer, Moni Naor December 10, 2008 We consider graphical games with n players where the graph G is a tree of maximum degree d, and each player has 2 possibl

            Add to Reading List

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

            Language: English - Date: 2008-12-12 00:45:07
              97

              Randomized Algorithms 2014/5A Lecture 1 – Min Cut Algorithm, Closest Pairs, (Multi)-Set Equality ∗ Moni Naor The lecture introduced randomized algorithms. Why are they interesting? They may solve problems faster than

              Add to Reading List

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

              Language: English - Date: 2014-11-18 07:31:28
                98

                Learning to Impersonate Moni Naor∗ Guy N. Rothblum† Abstract

                Add to Reading List

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

                Language: English - Date: 2006-03-09 06:00:30
                  99

                  Secret-Sharing for NP Ilan Komargodski∗ Moni Naor∗ Eylon Yogev∗

                  Add to Reading List

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

                  Language: English - Date: 2015-05-31 10:47:31
                    100

                    Public-Key Cryptosystems Resilient to Key Leakage Moni Naor Gil Segev

                    Add to Reading List

                    Source URL: www.iacr.org

                    Language: English - Date: 2009-09-22 18:25:06
                      UPDATE