Fetching the paper…
Reading the bibliography…
Informally, an extractor delivers perfect randomness from a source that may be far away from the uniform distribution, yet contains some randomness.
Douglas R. Stinson, “Universal hashing and authentication codes,” Designs, Codes and Cryptography 4
1994
Earlier work this paper cites.
Douglas R. Stinson, “On the connections between universal hashing, combinatorial designs and error-correcting codes,” Electronic Colloquium on Computational Complexity (ECCC) 2
1995
Earlier work this paper cites.
Gene H. Golub and Charles F. van Loan, Matrix Computations (Johns Hopkins Studies in Mathematical Sciences)(3rd Edition) , 3rd ed. (The Johns Hopkins University Press, 1996)
1996
Earlier work this paper cites.
Noam Nisan and David Zuckerman, “Randomness is linear in space,” Journal of Computer and System Sciences 52
1996
Earlier work this paper cites.
Donald E. Knuth, Art of Computer Programming, Volume 2: Seminumerical Algorithms , 3rd ed. (Addison-Wesley Professional, 1997)
1997
Earlier work this paper cites.
J. Håstad, R. Impagliazzo, L. Levin, and M. Luby, “A pseudorandom generator from any one-way function,” SIAM Journal on Computing 28
1999
Earlier work this paper cites.
Jaikumar Radhakrishnan and Amnon Ta-Shma, “Bounds for dispersers, extractors, and depth-two superconcentrators,” SIAM Journal on Discrete Mathematics 13
2000
Earlier work this paper cites.
Bjarne Stroustrup, The C++ Programming Language: Special Edition , 3rd ed. (Addison-Wesley Professional, 2000)
2000
Earlier work this paper cites.
Madhu Sudan, “List decoding: algorithms and applications,” SIGACT News 31
2000
Earlier work this paper cites.
Luca Trevisan, “Extractors and pseudorandom generators,” Journal of the ACM 48
2001
Earlier work this paper cites.
R Shaltiel, “Recent developments in explicit constructions of extractors,” Bulletin of the EATCS 77
2002
Earlier work this paper cites.
National Institute of Standards and Technology, FIPS 180-2, Secure Hash Standard, Federal Information Processing Standard (FIPS), Publication 180-2 , Tech. Rep. (Department of commerce, 2002)
2002
Earlier work this paper cites.
Ran Raz, Omer Reingold, and Salil Vadhan, “Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors,” Journal of Computer and System Sciences 65
2002
Earlier work this paper cites.
Tzvika Hartman and Ran Raz, “On the distribution of the number of roots of polynomials and explicit weak designs,” Random Structures and Algorithms 23
2003
Cited alongside, same era.
The OpenSSL Project, “OpenSSL: The open source toolkit for SSL/TLS,” (2003)
2003
Cited alongside, same era.
Chi-Jen Lu, “Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors,” Journal of Cryptology 17
2004
Cited alongside, same era.
Salil P. Vadhan, “Constructing locally computable extractors and cryptosystems in the bounded-storage model,” Journal of Cryptology 17
2004
Cited alongside, same era.
Renato Renner, Security of Quantum Key Distribution , Ph.D. thesis, Swiss Federal Institute of Technology Zurich (2005), http://arxiv.org/abs/quant-ph/0512258 quant-ph/0512258
2005
Cited alongside, same era.
Robert König and Barbara M. Terhal, “The bounded-storage model in the presence of a quantum adversary,” IEEE Transactions on Information Theory 54
2008
Later among the works it cites.
Russell Impagliazzo, Ragesh Jaiswal, and Valentine Kabanets, “Approximate list-decoding of direct product codes and uniform hardness amplification,” SIAM Journal on Computing 39
2009
Later among the works it cites.
Jörg Arndt, Matters Computational (Springer Berlin / Heidelberg, 2010)
2010
Later among the works it cites.
Christian Gabriel, Christoffer Wittmann, Denis Sych, Ruifang Dong, Wolfgang Mauerer, Ulrik L. Andersen, Christoph Marquardt, and Gerd Leuchs, “A generator for unique quantum random numbers based on vacuum states,” Nature Photonics 4
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Victor Shoup, A Computational Introduction to Number Theory and Algebra (Cambridge University Press, 2005)
2005
Cited alongside, same era.
Shlomo Hoory, Nathan Linial, and Avi Wigderson, “Expander graphs and their applications,” American Mathematical Society. Bulletin. New Series 43
2006
Cited alongside, same era.
Carl Bosley and Yevgeniy Dodis, “Does privacy require true randomness?” in Theory of Cryptography , Lecture Notes in Computer Science, Vol. 4392, edited by Salil Vadhan (Springer, 2007) pp. 1–20
2007
Cited alongside, same era.
Salil Vadhan, “The unified theory of pseudorandomness: guest column,” SIGACT News 38
2007
Cited alongside, same era.
James Reinders, Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism , 1st ed. (O’Reilly Media, 2007)
2007
Cited alongside, same era.
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf, “Exponential separation for one-way quantum communication complexity, with applications to cryptography,” SIAM J. Comput. 38
2008
Cited alongside, same era.
Wolfgang Mauerer, Professional Linux Kernel Architecture (Wrox, 2008)
2008
Cited alongside, same era.
2011
Later among the works it cites.
2011
Later among the works it cites.
Oded Goldreich, Studies in Complexity and Cryptography , edited by Oded Goldreich, Lecture Notes in Computer Science, Vol. 6650 (Springer Berlin Heidelberg, Berlin, Heidelberg, 2011) pp. 451–464
2011
Later among the works it cites.
R Development Core Team, R: A Language and Environment for Statistical Computing , R Foundation for Statistical Computing, Vienna, Austria (2011), ISBN 3-900051-07-0
2011
Later among the works it cites.
2011
Later among the works it cites.
2012
Closest in time.
2012
Closest in time.
Dirk Eddelbuettel and Romain Francois, RInside: C++ classes to embed R in C++ applications (2012), r package version 0.2.8
2012
Closest in time.