Anindya De

	2012
20		Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC 2012: 729-746
19		Anindya De: Lower Bounds in Differential Privacy. TCC 2012: 321-338
18		Anindya De, Elchanan Mossel: Explicit Optimal Hardness via Gaussian stability results CoRR abs/1202.5258: (2012)
17		Anindya De, Elchanan Mossel: Explicit Optimal hardness via Gaussian stability results. Electronic Colloquium on Computational Complexity (ECCC) 19: 16 (2012)
16		Anindya De, Thomas Watson: Extractors and Lower Bounds for Locally Samplable Sources. TOCT 4(1): 3 (2012)
	2011
15		Anindya De, Thomas Watson: Extractors and Lower Bounds for Locally Samplable Sources. APPROX-RANDOM 2011: 483-494
14		Anindya De: Pseudorandomness for Permutation and Regular Branching Programs. IEEE Conference on Computational Complexity 2011: 221-231
13		Anindya De: Lower bounds in differential privacy CoRR abs/1107.2183: (2011)
12		Anindya De, Thomas Watson: Extractors and Lower Bounds for Locally Samplable Sources. Electronic Colloquium on Computational Complexity (ECCC) 18: 37 (2011)
	2010
11		Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani: Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM 2010: 504-517
10		Anindya De, Luca Trevisan, Madhur Tulsiani: Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. CRYPTO 2010: 649-665
9		Anindya De, Thomas Vidick: Near-optimal extractors against quantum storage. STOC 2010: 161-170
	2009
8		Anindya De, Luca Trevisan: Extractors Using Hardness Amplification. APPROX-RANDOM 2009: 462-475
7		Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner: Trevisan's extractor in the presence of quantum side information CoRR abs/0912.5514: (2009)
6		Anindya De, Luca Trevisan, Madhur Tulsiani: Non-uniform attacks against one-way functions and PRGs. Electronic Colloquium on Computational Complexity (ECCC) 16: 113 (2009)
5		Anindya De, Thomas Vidick: Near-optimal extractors against quantum storage. Electronic Colloquium on Computational Complexity (ECCC) 16: 133 (2009)
4		Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani: Improved Pseudorandom Generators for Depth 2 Circuits. Electronic Colloquium on Computational Complexity (ECCC) 16: 141 (2009)
	2008
3		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast integer multiplication using modular arithmetic. STOC 2008: 499-506
2		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic CoRR abs/0801.1416: (2008)
1		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic. Electronic Colloquium on Computational Complexity (ECCC) 15(023): (2008)

Coauthor Index

1	Ilias Diakonikolas	[20]
2	Omid Etesami	[4] [11]
3	Vitaly Feldman	[20]
4	Piyush P. Kurur	[1] [2] [3]
5	Elchanan Mossel	[17] [18]
6	Christopher Portmann	[7]
7	Renato Renner	[7]
8	Chandan Saha	[1] [2] [3]
9	Ramprasad Saptharishi	[1] [2] [3]
10	Rocco A. Servedio	[20]
11	Luca Trevisan	[4] [6] [8] [10] [11]
12	Madhur Tulsiani	[4] [6] [10] [11]
13	Thomas Vidick	[5] [7] [9]
14	Thomas Watson	[12] [15] [16]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page