Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
extractors
Description:
Tools or algorithms that retrieve selected information or structures from data, documents, or other computational inputs.
Related topics:
Cryptography and Data Security (8%),
Complexity and Algorithms in Graphs (8%)
OpenAlex ID:
keywords/extractors
Computational Complexity: A Modern Approach
2009
·
Sanjeev Arora
, Boaz Barak
·
2,371
Solvent extraction principles and practice
2004
·
Jan Rydberg
·
M. Dekker eBooks
·
692
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
2000
·
Ueli Maurer
, Stefan Wolf
·
Lecture notes in computer science
·
543
Pseudorandom Generators without the XOR Lemma
2001
·
Madhu Sudan
, Luca Trevisan
, et al.
·
Journal of Computer and System Sciences
·
451
Extractors and pseudorandom generators
2001
·
Luca Trevisan
·
Journal of the ACM
·
402
Kilogram-scale prexasertib monolactate monohydrate synthesis under continuous-flow CGMP conditions
2017
·
Kevin P. Cole
, Jennifer McClary Groh
, et al.
·
Science
·
324
More on the Sum-product Phenomenon in Prime Fields and Its Applications
2005
·
J. BOURGAIN
·
International Journal of Number Theory
·
316
Recent Developments in Explicit Constructions of Extractors
2004
·
RONEN SHALTIEL
·
WORLD SCIENTIFIC eBooks
·
314
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
2000
·
Jaikumar Radhakrishnan
, Amnon Ta-Shma
·
SIAM Journal on Discrete Mathematics
·
291
Randomness conductors and constant-degree lossless expanders
2002
·
Michael Capalbo
, Omer Reingold
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
288
Extracting Randomness: A Survey and New Constructions
1999
·
Noam Nisan
, Amnon Ta-Shma
·
Journal of Computer and System Sciences
·
211
Secret-key agreement over unauthenticated public channels-part III: privacy amplification
2003
·
U. Maurer
, S. Wolf
·
IEEE Transactions on Information Theory
·
177
Extractors: optimal up to constant factors
2003
·
Chi-Jen Lu
, Omer Reingold
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
136
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
1999
·
Avi Wigderson
, David Zuckerman
·
COMBINATORICA
·
117
The complexity of constructing pseudorandom generators from hard functions
2005
·
Emanuele Viola
·
Computational Complexity
·
105
A Cryptographic Treatment of the Wiretap Channel
2012
·
Bellare, Mihir
, Tessaro, Stefano
, et al.
·
arXiv (Cornell University)
·
97
PDF
Construction of extractors using pseudo-random generators (extended abstract)
1999
·
Luca Trevisan
·
ACM Symposium on Theory of Computing (STOC)
·
96
PDF
Lossless Condensers, Unbalanced Expanders, And Extractors
2007
·
Amnon Ta-Shma*
, Christopher Umans†
, et al.
·
COMBINATORICA
·
91
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
2002
·
O. Reingold
, S. Vadhan
, et al.
·
Annual Symposium on Foundations of Computer Science
·
87
Matching Objects with Patterns
2006
·
Burak Emir
, Martin Odersky
, et al.
·
Infoscience (Ecole Polytechnique Fédérale de Lausanne)
·
83
PDF
Extractor Codes
2004
·
A. Ta-Shma
, D. Zuckerman
·
IEEE Transactions on Information Theory
·
79
Extracting randomness: how and why. A survey
2002
·
N. Nisan
·
IEEE Conference on Computational Complexity (CCC)
·
74
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures
2019
·
Divesh Aggarwal
, Ivan Damgård
, et al.
·
Lecture notes in computer science
·
70
Resource-Bounded Kolmogorov Complexity Revisited
2001
·
Harry Buhrman
, Lance Fortnow
, et al.
·
SIAM Journal on Computing
·
69
Invertible Extractors and Wiretap Protocols
2011
·
Mahdi Cheraghchi
, Fredric Didier
, et al.
·
IEEE Transactions on Information Theory
·
66
PDF
Show more works
View as search
Works count:
427
Citation count:
9,111
Year
Topic
Type