|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 6 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Anindya De, Thomas Watson |
Extractors and Lower Bounds for Locally Samplable Sources.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Elchanan Mossel |
Explicit Optimal hardness via Gaussian stability results. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Elchanan Mossel |
Explicit Optimal Hardness via Gaussian stability results |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Anindya De |
Lower Bounds in Differential Privacy. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Thomas Watson |
Extractors and Lower Bounds for Locally Samplable Sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anindya De |
Lower bounds in differential privacy |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Thomas Watson |
Extractors and Lower Bounds for Locally Samplable Sources. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De |
Pseudorandomness for Permutation and Regular Branching Programs. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Luca Trevisan, Madhur Tulsiani |
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani |
Improved Pseudorandom Generators for Depth 2 Circuits. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Thomas Vidick |
Near-optimal extractors against quantum storage. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
bounded quantum storage, random access codes, extractors |
| 1 | Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani |
Improved Pseudorandom Generators for Depth 2 Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Thomas Vidick |
Near-optimal extractors against quantum storage. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Luca Trevisan, Madhur Tulsiani |
Non-uniform attacks against one-way functions and PRGs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner |
Trevisan's extractor in the presence of quantum side information |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Luca Trevisan |
Extractors Using Hardness Amplification. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Extractors, Direct product theorems, Hardness amplification |
| 1 | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi |
Fast Integer Multiplication using Modular Arithmetic. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi |
Fast Integer Multiplication using Modular Arithmetic |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi |
Fast integer multiplication using modular arithmetic. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
computational algebra, modular arithmetic, integer multiplication |
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")