Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

camu library [57 articles]

Статьи, недавно добавленные в библиотеку camu .
  • Finite metric spaces--combinatorics, geometry and algorithms
    (28 April 2003)
    by Nathan Linial
    posted to geometry by camu on 2007-07-21 16:34:28 as **** along with 2 people and 6 groups ansobol euclid Algorithms metric_embeddings TCS Crypto Randomness Polytopes
  • Projection Learning
    Machine Learning, Vol. 37, No. 2. (1 November 1999), pp. 115-130.
    by Leslie G Valiant
    posted to learning by camu on 2007-03-23 00:05:05 as *** along with 1 person and 2 groups oren Crypto Randomness
  • Limits on the provable consequences of one-way permutations
    (1989), pp. 44-61.
    by R Impagliazzo, S Rudich
    posted to seperations black-box by camu on 2007-02-09 01:20:41 as ** along with 2 people and 2 groups TPTPTP chestylarue Crypto Randomness
  • Randomness
    Vol. 12
    by P Vitány
    posted to pseudo-randomness by camu on 2006-08-29 05:31:07 as ** along with 1 person and 2 groups gagliol Crypto Randomness
  • 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 on 2006-08-29 05:30:44 as ** along with 1 person and 2 groups gagliol Crypto Randomness
  • An introduction to ROC analysis
    Pattern Recognition Letters, Vol. 27, No. 8. (June 2006), pp. 861-874.
    by Tom Fawcett
    posted to statistics by camu on 2006-08-29 02:46:20 as *** along with 19 people and 7 groups AbnerCYH ldietz vavi dquest sdvillal xiaoyan2006 dwf schlauchi vmoa drivard nklee imrchen kmdaily gsiwo tgyork idonaldson napvasconcelos cdeane haiyeong Skill-Inference Bioinformatics Crypto VT_DLRL Randomness LIVIA BergmanLab
  • 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 on 2006-08-22 16:31:27 as **** along with 2 groups Crypto Randomness
  • 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 on 2006-08-22 16:30:18 as ** along with 2 people and 2 groups TELL ima Crypto Randomness
  • 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 on 2006-08-22 16:27:15 as read along with 3 people and 2 groups p2p-sec HailunTan remos Crypto Randomness
  • Strengthening Key Agreement using Hard-Core Sets
    (2006)
    by Thomas Holenstein
    posted to crypto hardness-amplification by camu on 2006-08-21 20:49:11 as ***** along with 2 groups Crypto Randomness
  • The Learnability of Quantum States
    (20 Aug 2006)
    by Scott Aaronson
    posted to quantum-computing by camu on 2006-08-21 20:03:34 as *** along with 3 people and 2 groups jrw wnoise kore80 Crypto Randomness
  • 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 on 2006-08-21 19:57:15 as read along with 2 people and 2 groups gagliol Scis0000002 Crypto Randomness
  • 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 on 2006-08-21 19:55:45 as ** along with 1 person and 2 groups gagliol Crypto Randomness
  • Broadcast encryption
    (1994), pp. 480-491.
    by Amos Fiat, Moni Naor
    posted to broadcast-encryption crypto by camu on 2006-08-21 19:50:17 as ** along with 1 person and 2 groups TPTPTP Crypto Randomness
  • 1951 Lectures on Advanced Quantum Mechanics Second Edition
    (18 Aug 2006)
    by Freeman J Dyson
    posted to quantum-computing quantum-mechanics by camu on 2006-08-21 19:48:34 as ** along with 10 people and 2 groups ansobol jrw mankei wnoise mumrah proportional kriskrogh dmitri83 robertoalamino softsimu Crypto Randomness
  • On the complexity of succinct zero-sum games
    Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on (2005), pp. 323-332.
    by L Fortnow, R Impagliazzo, V Kabanets, C Umans
    posted to complexity-theory game-theory by camu on 2006-08-21 16:59:29 as ** along with 2 groups Crypto Randomness
  • The Computational Complexity of Universal Hashing
    (1990), pp. 235-243.
    by Yishay Mansour, Noam Nisan, Prasoon Tiwari
    posted to complexity-theory by camu on 2006-08-21 16:56:36 as *** along with 2 people and 3 groups rgrig scis0000001 SRG_at_UCD Crypto Randomness
  • Pseudorandom generators, measure theory, and natural proofs
    (1995)
    by K Regan, D Sivakumar, J- Cai
    posted to complexity-theory by camu on 2006-08-21 16:54:07 as ** along with 1 person and 2 groups shankar Crypto Randomness
  • 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 on 2006-08-21 16:52:38 as ** along with 2 people and 2 groups shankar alexzeh Crypto Randomness
  • Extractor codes
    Information Theory, IEEE Transactions on, Vol. 50, No. 12. (2004), pp. 3015-3025.
    by A Ta-Shma, D Zuckerman
    posted to coding-theory by camu on 2006-08-21 16:51:58 as *** along with 1 person and 2 groups shankar Crypto Randomness
  • <italic>P = BPP</italic> if <italic>E</italic> requires exponential circuits: derandomizing the XOR lemma
    (1997), pp. 220-229.
    by Russell Impagliazzo, Avi Wigderson
    posted to complexity-theory derandomization pseudo-randomness by camu on 2006-08-21 16:51:11 as **** along with 1 person and 2 groups rjaiswal Crypto Randomness
  • How to recycle random bits
    Foundations of Computer Science, 1989., 30th Annual Symposium on (1989), pp. 248-253.
    by R Impagliazzo, D Zuckerman
    posted to complexity-theory derandomization pseudo-randomness by camu on 2006-08-21 16:50:22 as **** along with 1 person and 2 groups mikero Crypto Randomness
  • 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.
    by R Impagliazzo, V Kabanets, A Wigderson
    posted to complexity-theory derandomization by camu on 2006-08-21 16:49:10 as *** along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 16:47:52 as *** along with 1 person and 2 groups rjaiswal Crypto Randomness
  • 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 on 2006-08-21 16:46:43 as **** along with 2 groups Crypto Randomness
  • 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
    posted to algorithms by camu on 2006-08-21 16:37:44 as *** along with 2 people and 6 groups euclid BarrosH Algorithms metric_embeddings TCS Crypto Randomness Polytopes
  • Computing Nash Equilibria: Approximation and Smoothed Complexity
    (22 Feb 2006)
    by Xi Chen, Xiaotie Deng, Shang-Hua Teng
    posted to complexity-theory game-theory by camu on 2006-08-21 16:36:01 as *** along with 2 people and 2 groups ansobol BarrosH Crypto Randomness
  • Inapproximability of Combinatorial Optimization Problems
    (24 Sep 2004)
    by Luca Trevisan
    posted to complexity-theory survey by camu on 2006-08-21 16:33:15 as *** along with 4 people and 2 groups ansobol BarrosH entropy NeilInCanadia Crypto Randomness
  • Gowers Uniformity, Influence of Variables, and PCPs
    (12 Oct 2005)
    by Alex Samorodnitsky, Luca Trevisan
    posted to complexity-theory by camu on 2006-08-21 16:32:36 as ***** along with 1 person and 2 groups BarrosH Crypto Randomness
  • 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 on 2006-08-21 16:32:10 as *** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Computational complexity of probabilistic Turing machines
    (1974), pp. 91-95.
    by John T Gill
    posted to complexity-theory by camu on 2006-08-21 16:29:33 as *** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Algorithmic derandomization via complexity theory
    (2002), pp. 619-626.
    by D Sivakumar
    posted to derandomization by camu on 2006-08-21 16:27:24 as ** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Hardness as randomness: a survey of universal derandomization
    (28 Apr 2003)
    by Russell Impagliazzo
    posted to complexity-theory derandomization survey by camu on 2006-08-21 16:26:08 as **** along with 1 person and 2 groups BarrosH Crypto Randomness
  • On Promise Problems (a survey in memory of Shimon Even [1935-2004])
    (8 February 2005)
    by Oded Goldreich
    posted to complexity-theory by camu on 2006-08-21 16:23:01 as *** along with 1 person and 2 groups BarrosH Crypto Randomness
  • Algorithms
    (22 May 2006)
    by S Dasgupta, CH Papadimitriou, UV Vazirani
    posted to algorithms by camu on 2006-08-21 16:14:50 as *** along with 2 people and 2 groups jrw pintman Crypto Randomness
  • Classical physics and the Church--Turing Thesis
    J. ACM, Vol. 50, No. 1. (January 2003), pp. 100-105.
    by Andrew C Yao
    posted to complexity-theory by camu on 2006-08-21 16:07:29 as read along with 9 people and 3 groups ansobol jrw BarrosH djhda estrabd arnia dmitri83 gane5h huangxl cogent_computing Crypto Randomness
  • NP-complete Problems and Physical Reality
    (12 February 2005)
    by Scott Aaronson
    posted to complexity-theory survey by camu on 2006-08-21 16:06:57 as *** along with 13 people and 4 groups A_Olympia ansobol dsquared rdhyee geomblog rsaarelm DineshGaitonde jrw BarrosH proportional BrendaChng gane5h NeilInCanadia Philosophy_of_Information Blog_and_Wiki_Research Crypto Randomness
  • 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 on 2006-08-21 16:01:18 as ** along with 7 people and 2 groups ansobol jrw BarrosH eyliu jclau qtip gane5h Crypto Randomness
  • Complexity Theory for Simpletons
    (5 Jul 2005)
    by Craig A Feinstein
    posted to complexity-theory by camu on 2006-08-21 15:58:52 as ** along with 2 people and 2 groups ansobol flybort Crypto Randomness
  • Algebraic Geometry
    by James Milne
    posted to algebraic-geometry by camu on 2006-08-21 15:47:36 as *** along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 15:46:15 as ***** along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 15:33:23 as read along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 15:32:42 as **** along with 2 groups Crypto Randomness
  • Average-Case Complexity
    (2006)
    by Andrej Bogdanov, Luca Trevisan
    posted to average-case survey by camu on 2006-08-21 15:25:05 as read along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 15:19:22 as read along with 2 groups Crypto Randomness
  • On uniform amplification of hardness in NP
    (2005), pp. 31-38.
    by Luca Trevisan
    posted to crypto hardness-amplification by camu on 2006-08-21 06:52:14 as *** along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 06:45:59 as ** along with 2 groups Crypto Randomness
  • On Constructing Parallel Pseudorandom Generators from One-Way Functions
    by Emanuele Viola
    posted to hardness-amplification crypto pseudo-randomness by camu on 2006-08-21 06:42:30 as **** along with 2 groups Crypto Randomness
  • 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 on 2006-08-21 06:36:50 as ** along with 2 groups Crypto Randomness
  • 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 on 2006-08-20 23:52:55 as *** along with 3 people and 2 groups muli alpha daviticus Crypto Randomness
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/camu

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