Registrati | Log in | FAQ      [?] 
Recent | Recommended | Search | Authors | Tags | Export

Group: Randomness - library [57 articles]

Recent papers posted by members of the Randomness group
  • Finite metric spaces--combinatorics, geometry and algorithms
    (28 April 2003)
    by Nathan Linial
  • Projection Learning
    Machine Learning, Vol. 37, No. 2. (1 November 1999), pp. 115-130.
    by Leslie G Valiant
    posted to learning by camu to the group Randomness on 2007-03-23 00:05:05 as *** along with 1 person and 1 group oren Crypto
  • Limits on the provable consequences of one-way permutations
    (1989), pp. 44-61.
  • Randomness
    Vol. 12
    by P Vitány
    posted to pseudo-randomness by camu to the group Randomness on 2006-08-29 05:31:07 as ** along with 1 person and 1 group gagliol Crypto
  • Robust Measures of Information
    The Computer Journal, Vol. 42, No. 4. (1999), pp. 284-286.
    by Leonid A Levin
    posted to information-theory by camu to the group Randomness on 2006-08-29 05:30:44 as ** along with 1 person and 1 group gagliol Crypto
  • An introduction to ROC analysis
    Pattern Recognition Letters, Vol. 27, No. 8. (June 2006), pp. 861-874.
    by Tom Fawcett
  • Extractors and pseudorandom generators
    J. ACM, Vol. 48, No. 4. (July 2001), pp. 860-879.
    by Luca Trevisan
    posted to extractors pseudo-randomness by camu to the group Randomness on 2006-08-22 16:31:27 as **** along with 1 group Crypto
  • Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
    J. ACM, Vol. 38, No. 3. (July 1991), pp. 690-728.
    by Oded Goldreich, Silvio Micali, Avi Wigderson
    posted to crypto zero-knowledge by camu to the group Randomness on 2006-08-22 16:30:18 as ** along with 1 person and 1 group ima Crypto
  • Efficient dispersal of information for security, load balancing, and fault tolerance
    J. ACM, Vol. 36, No. 2. (April 1989), pp. 335-348.
    by Michael O Rabin
    posted to coding-theory by camu to the group Randomness on 2006-08-22 16:27:15 as read along with 3 people and 1 group p2p-sec HailunTan remos Crypto
  • Strengthening Key Agreement using Hard-Core Sets
    (2006)
    by Thomas Holenstein
    posted to crypto hardness-amplification by camu to the group Randomness on 2006-08-21 20:49:11 as ***** along with 1 group Crypto
  • The Learnability of Quantum States
    (20 Aug 2006)
    by Scott Aaronson
    posted to quantum-computing by camu to the group Randomness on 2006-08-21 20:03:34 as *** along with 3 people and 1 group jrw wnoise kore80 Crypto
  • Gambling in a rigged casino: the adversarial multi-armed bandit problem
    (1995), pp. 322-331.
    by Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E Schapire
    posted to algorithms by camu to the group Randomness on 2006-08-21 19:57:15 as read along with 2 people and 1 group gagliol Scis0000002 Crypto
  • A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Algorithmica, Vol. 16, No. 4/5. (1996), pp. 543-547.
    by Helmut Alt, Leonidas J Guibas, Kurt Mehlhorn, Richard M Karp, Avi Wigderson
    posted to algorithms by camu to the group Randomness on 2006-08-21 19:55:45 as ** along with 1 person and 1 group gagliol Crypto
  • Broadcast encryption
    (1994), pp. 480-491.
    by Amos Fiat, Moni Naor
    posted to broadcast-encryption crypto by camu to the group Randomness on 2006-08-21 19:50:17 as ** along with 1 person and 1 group TPTPTP Crypto
  • 1951 Lectures on Advanced Quantum Mechanics Second Edition
    (18 Aug 2006)
    by Freeman J Dyson
  • On the complexity of succinct zero-sum games
    Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on (2005), pp. 323-332.
    posted to complexity-theory game-theory by camu to the group Randomness on 2006-08-21 16:59:29 as ** along with 1 group Crypto
  • The Computational Complexity of Universal Hashing
    (1990), pp. 235-243.
    by Yishay Mansour, Noam Nisan, Prasoon Tiwari
  • Pseudorandom generators, measure theory, and natural proofs
    (1995)
    by K Regan, D Sivakumar, J- Cai
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 16:54:07 as ** along with 1 person and 1 group shankar Crypto
  • On decoding BCH codes
    Information Theory, IEEE Transactions on, Vol. 11, No. 4. (1965), pp. 549-557.
    by G Forney
    posted to coding-theory by camu to the group Randomness on 2006-08-21 16:52:38 as ** along with 3 people and 1 group danielaugot shankar alexzeh Crypto
  • Extractor codes
    Information Theory, IEEE Transactions on, Vol. 50, No. 12. (2004), pp. 3015-3025.
    posted to coding-theory by camu to the group Randomness on 2006-08-21 16:51:58 as *** along with 1 person and 1 group shankar Crypto
  • <italic>P = BPP</italic> if <italic>E</italic> requires exponential circuits: derandomizing the XOR lemma
    (1997), pp. 220-229.
    by Russell Impagliazzo, Avi Wigderson
  • How to recycle random bits
    Foundations of Computer Science, 1989., 30th Annual Symposium on (1989), pp. 248-253.
  • In search of an easy witness: exponential time vs. probabilistic polynomial time
    Journal of Computer and System Sciences, Vol. 65, No. 4. (December 2002), pp. 672-694.
    posted to complexity-theory derandomization by camu to the group Randomness on 2006-08-21 16:49:10 as *** along with 1 group Crypto
  • BPP has subexponential time simulations unless EXPTIME has publishable proofs
    Comput. Complex., Vol. 3, No. 4. (October 1993), pp. 307-318.
    by L&\#225;szl&\#243; Babai, Lance Fortnow, Noam Nisan, Avi Wigderson
    posted to derandomization by camu to the group Randomness on 2006-08-21 16:47:52 as *** along with 1 person and 1 group rjaiswal Crypto
  • Hardness vs. randomness
    J. Comput. Syst. Sci., Vol. 49, No. 2. (October 1994), pp. 149-167.
    by Noam Nisan, Avi Wigderson
    posted to complexity-theory derandomization pseudo-randomness by camu to the group Randomness on 2006-08-21 16:46:43 as **** along with 1 group Crypto
  • Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
    J. ACM, Vol. 51, No. 3. (May 2004), pp. 385-463.
    by Daniel A Spielman, Shang-Hua Teng
  • Computing Nash Equilibria: Approximation and Smoothed Complexity
    (22 Feb 2006)
    by Xi Chen, Xiaotie Deng, Shang-Hua Teng
  • Inapproximability of Combinatorial Optimization Problems
    (24 Sep 2004)
    by Luca Trevisan
  • Gowers Uniformity, Influence of Variables, and PCPs
    (12 Oct 2005)
    by Alex Samorodnitsky, Luca Trevisan
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 16:32:36 as ***** along with 1 person and 1 group BarrosH Crypto
  • Zero knowledge and the chromatic number
    Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on (1996), pp. 278-287.
    by U Feige, J Kilian
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 16:32:10 as *** along with 1 person and 1 group BarrosH Crypto
  • Computational complexity of probabilistic Turing machines
    (1974), pp. 91-95.
    by John T Gill
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 16:29:33 as *** along with 1 person and 1 group BarrosH Crypto
  • Algorithmic derandomization via complexity theory
    (2002), pp. 619-626.
    posted to derandomization by camu to the group Randomness on 2006-08-21 16:27:24 as ** along with 1 person and 1 group BarrosH Crypto
  • Hardness as randomness: a survey of universal derandomization
    (28 Apr 2003)
    by Russell Impagliazzo
  • On Promise Problems (a survey in memory of Shimon Even [1935-2004])
    (8 February 2005)
    by Oded Goldreich
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 16:23:01 as *** along with 1 person and 1 group BarrosH Crypto
  • Algorithms
    (22 May 2006)
    posted to algorithms by camu to the group Randomness on 2006-08-21 16:14:50 as *** along with 2 people and 1 group jrw pintman Crypto
  • Classical physics and the Church--Turing Thesis
    J. ACM, Vol. 50, No. 1. (January 2003), pp. 100-105.
    by Andrew C Yao
  • NP-complete Problems and Physical Reality
    (12 February 2005)
    by Scott Aaronson
  • Theoretical computer science cheat sheet
    SIGACT News, Vol. 27, No. 4. (December 1996), pp. 52-61.
    by Steve Seiden
    posted to no-tag by camu to the group Randomness on 2006-08-21 16:01:18 as ** along with 7 people and 1 group ansobol jrw BarrosH eyliu jclau qtip gane5h Crypto
  • Complexity Theory for Simpletons
    (5 Jul 2005)
    by Craig A Feinstein
    posted to complexity-theory by camu to the group Randomness on 2006-08-21 15:58:52 as ** along with 3 people and 1 group bowerybum ansobol flybort Crypto
  • Algebraic Geometry
    by James Milne
    posted to algebraic-geometry by camu to the group Randomness on 2006-08-21 15:47:36 as *** along with 1 group Crypto
  • Récoltes et Semailles - Réflexions et témoignage sur un passé de mathématicien
    by Alexandre Grothendieck
    posted to algebraic-geometry grothendieck by camu to the group Randomness on 2006-08-21 15:46:15 as ***** along with 1 group Crypto
  • On basing one-way functions on NP-hardness
    (2006), pp. 701-710.
    by Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz
    posted to average-case by camu to the group Randomness on 2006-08-21 15:33:23 as read along with 1 group Crypto
  • A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
    (2005), pp. 397-406.
    by Avi Wigderson, David Xiao
    posted to pseudo-randomness by camu to the group Randomness on 2006-08-21 15:32:42 as **** along with 1 group Crypto
  • Average-Case Complexity
    (2006)
    by Andrej Bogdanov, Luca Trevisan
    posted to average-case survey by camu to the group Randomness on 2006-08-21 15:25:05 as read along with 1 group Crypto
  • On Worst-Case to Average-Case Reductions for NP Problems
    (October 2003), pp. 308-317.
    by Andrej Bogdanov, Luca Trevisan
    posted to average-case by camu to the group Randomness on 2006-08-21 15:19:22 as read along with 1 group Crypto
  • On uniform amplification of hardness in NP
    (2005), pp. 31-38.
    by Luca Trevisan
    posted to crypto hardness-amplification by camu to the group Randomness on 2006-08-21 06:52:14 as *** along with 1 group Crypto
  • Using Nondeterminism to Amplify Hardness
    SIAM Journal on Computing, Vol. 34, No. 4. (2006), pp. 903-931.
    by Alexander Healy, Salil Vadhan, Emanuele Viola
    posted to crypto hardness-amplification by camu to the group Randomness on 2006-08-21 06:45:59 as ** along with 1 group Crypto
  • On Constructing Parallel Pseudorandom Generators from One-Way Functions
    by Emanuele Viola
    posted to hardness-amplification crypto pseudo-randomness by camu to the group Randomness on 2006-08-21 06:42:30 as **** along with 1 group Crypto
  • The Complexity of Constructing Pseudorandom Generators from Hard Functions
    Journal of Computational Complexity, Vol. 13, No. 3. (2004), pp. 147-188.
    by Emanuele Viola
    posted to crypto pseudo-randomness by camu to the group Randomness on 2006-08-21 06:36:50 as ** along with 1 group Crypto
  • A Pseudorandom Generator from any One-way Function
    SIAM J. Comput., Vol. 28, No. 4. (1999), pp. 1364-1396.
    by Johan Hastad, Russell Impagliazzo, Leonid A Levin, Michael Luby
    posted to crypto pseudo-randomness by camu to the group Randomness on 2006-08-20 23:52:55 as *** along with 3 people and 1 group muli alpha daviticus Crypto
  • Puoi citare questa pagina come: http://www.citeulike.org/group/1494

    Result page: 1 2 Next 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.