CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Shaltiel-R"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2013 | 2012 | 2010 | 2009 | 2007 | 2006 | 2005 | 2001
Number of items: 9.

2013

Fefferman, Bill and Shaltiel, Ronen and Umans, Christopher et al. (2013) On Beating the Hybrid Argument. Theory of Computing, 9 (1). pp. 809-843. ISSN 1557-2862. https://resolver.caltech.edu/CaltechAUTHORS:20191118-154821951

2012

Fefferman, Bill and Shaltiel, Ronen and Umans, Christopher et al. (2012) On beating the hybrid argument. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. Association for Computing Machinery (ACM) , New York, NY, pp. 468-483. ISBN 978-1-4503-1115-1. https://resolver.caltech.edu/CaltechAUTHORS:20120522-093532704

2010

Fefferman, Bill and Umans, Christopher and Shaltiel, Ronen et al. (2010) On beating the hybrid argument. Electronic Colloquium on Computational Complexity, 2010 . Art. No. 186. ISSN 1433-8092. https://resolver.caltech.edu/CaltechAUTHORS:20191126-153323226

Brody, Joshua and Chakrabarti, Amit and Regev, Oded et al. (2010) Better Gap-Hamming Lower Bounds via Better Round Elimination. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science. No.6302. Springer , Berlin, pp. 476-489. ISBN 978-3-642-15368-6. https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650

2009

Shaltiel, Ronen and Umans, Christopher (2009) Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM Journal on Computing, 39 (3). pp. 1006-1037. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349

2007

Shaltiel, Ronen and Umans, Christopher (2007) Low-end uniform hardness vs. randomness tradeoffs for AM. In: STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 430-439. ISBN 978-1-59593-631-8. https://resolver.caltech.edu/CaltechAUTHORS:20161219-151217993

2006

Shaltiel, Ronen and Umans, Christopher (2006) Pseudorandomness for Approximate Counting and Sampling. Computational Complexity, 15 (4). pp. 298-341. ISSN 1016-3328. https://resolver.caltech.edu/CaltechAUTHORS:20110811-085055181

2005

Shaltiel, Ronen and Umans, Christopher (2005) Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM, 52 (2). pp. 172-216. ISSN 0004-5411. https://resolver.caltech.edu/CaltechAUTHORS:20161219-150257214

2001

Shaltiel, Ronen and Umans, Christopher (2001) Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. In: 42nd Annual Symposium on Foundations of Computer Science. Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society , Los Alamitos, CA, pp. 648-657. ISBN 0-7695-1390-5. https://resolver.caltech.edu/CaltechAUTHORS:20111121-092803461

This list was generated on Fri Aug 14 04:22:23 2020 PDT.