注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

madhurt's library [16 articles]

最近录入 madhurt's 文献库.
  • Some information-theoretic computations related to the distribution of prime numbers
    (22 Oct 2007)
    by Ioannis Kontoyiannis
    posted to no-tag by madhurt on 2007-11-18 05:46:17 as ** along with 2 people ansobol TooMuchCoffeeMan
  • Noise stability of functions with low influences: invariance and optimality
    (23 May 2005)
    by Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
    posted to no-tag by madhurt on 2007-11-17 21:33:59 as ** along with 1 person yalding
  • Balls and bins: A study in negative dependence
    Random Structures and Algorithms, Vol. 13, No. 2. (1998), pp. 99-124.
    by Devdatt P Dubhashi, Desh Ranjan
    posted to probability by madhurt on 2007-11-16 13:54:43 as ** along with 3 people and 5 groups ansobol euclid AbnerCYH Algorithms metric_embeddings TCS Polytopes CSBBGraphTheory
  • Understanding Parallel Repetition Requires Understanding Foams
    by Uri Feige, Guy Kindler, Ryan O'Donnell
    posted to parallel-repetition by madhurt on 2007-11-16 06:07:11 as ***
  • A combinatorial, primal-dual approach to semidefinite programs
    (2007), pp. 227-236.
    by Sanjeev Arora, Satyen Kale
    posted to algorithms sdp by madhurt on 2007-09-08 14:25:15 as ***
  • Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
    (2005), pp. 1-10.
    by Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
    posted to extractors by madhurt on 2007-09-08 14:21:46 as read along with 1 person and 4 groups euclid Algorithms metric_embeddings TCS Polytopes
  • A Spectral Technique for Coloring Random 3-Colorable Graphs
    SIAM Journal on Computing, Vol. 26, No. 6. (1997), pp. 1733-1748.
    by Noga Alon, Nabil Kahale
    posted to algorithms random-graphs by madhurt on 2007-09-08 03:44:47 as **
  • Low-degree tests at large distances
    (2007), pp. 506-515.
    by Alex Samorodnitsky
    posted to additive-number-theory codes by madhurt on 2007-09-07 15:47:14 as ***
  • Pseudorandom bits for polynomials
    by Andrej Bogdanov, Emanuele Viola
    posted to complexity by madhurt on 2007-09-07 14:27:40 as ***
  • The primes contain arbitrarily long arithmetic progressions
    (9 Feb 2006)
    by Ben Green, Terence Tao
    posted to additive-number-theory by madhurt on 2007-07-20 17:09:48 as *** along with 1 person abie
  • Natural Proofs,
    Journal of Computer and System Sciences, Vol. 55, No. 1. (August 1997), pp. 24-35.
    by Alexander A Razborov, Steven Rudich
    posted to complexity by madhurt on 2007-05-23 02:01:58 as **** along with 1 person and 1 group AbnerCYH CSBBGraphTheory
  • An Exposition of Bourgain's 2-Source Extractor
    by Anup Rao
    posted to extractors by madhurt on 2007-05-17 16:38:34 as **
  • Average-Case Complexity
    (29 Sep 2006)
    by Andrej Bogdanov, Luca Trevisan
    posted to complexity by madhurt on 2006-11-28 17:16:10 as **
  • How to Play Unique Games Using Embeddings
    (2006), pp. 687-696.
    by Eden Chlamtac, Konstantin Makarychev, Yury Makarychev
    posted to unique-games by madhurt on 2006-11-22 06:47:49 as **
  • Extractors and condensers from univariate polynomials
    Electronic Colloquium on Computational Complexity, Vol. 13 (October 2006)
    by Venkatesan Guruswami, Christopher Umans, Salil Vadhan
    posted to codes extractors by madhurt on 2006-11-19 05:11:29 as **
  • Parallel repetition: simplifications and the no-signaling case
    (5 Sep 2006)
    by Thomas Holenstein
    posted to complexity parallel-repetition by madhurt on 2006-11-19 04:57:54 as read
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/madhurt

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.