Naor

Results: 103



#Item
51

COMPRESSION BOUNDS FOR LIPSCHITZ MAPS FROM THE HEISENBERG GROUP TO L1 JEFF CHEEGER, BRUCE KLEINER, AND ASSAF NAOR Abstract. We prove a quantitative bi-Lipschitz nonembedding theorem for the Heisenberg group with its Carn

Add to Reading List

Source URL: web.math.princeton.edu

Language: English - Date: 2010-11-27 15:54:47
    52

    Sketching in Adversarial Environments Ilya Mironov∗ Moni Naor† Gil Segev‡

    Add to Reading List

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

    Language: English - Date: 2013-11-13 07:40:01
      53

      Games For Exchanging Information∗ Gillat Kol† Moni Naor§ Abstract

      Add to Reading List

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

      Language: English - Date: 2007-12-25 11:56:02
        54

        Algorithmic Game Theory - handout4 Uriel Feige, Robert Krauthgamer, Moni Naor 26 November 2008 The fourth Israeli Seminar on Computational Game Theory will be held on Wednesday, December 31, 10:00AM – 4:30PM in Microso

        Add to Reading List

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

        Language: English - Date: 2008-11-26 05:25:24
          55

          Basing Cryptographic Protocols on Tamper-Evident Seals Tal Moran∗ Moni Naor∗† Abstract

          Add to Reading List

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

          Language: English - Date: 2008-09-15 04:36:53
            56

            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
              57

              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
                58

                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
                  59

                  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
                    60

                    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
                      UPDATE