| 2009 |
|---|
| 13 | EE | Kiran S. Kedlaya,
Sergey Yekhanin:
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
SIAM J. Comput. 38(5): 1952-1969 (2009) |
| 2008 |
|---|
| 12 | EE | Kiran S. Kedlaya,
Andrew V. Sutherland:
Computing L-Series of Hyperelliptic Curves.
ANTS 2008: 312-326 |
| 11 | EE | Kiran S. Kedlaya,
Christopher Umans:
Fast Modular Composition in any Characteristic.
FOCS 2008: 146-155 |
| 10 | EE | Kiran S. Kedlaya,
Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
IEEE Conference on Computational Complexity 2008: 175-186 |
| 2007 |
|---|
| 9 | EE | Kiran S. Kedlaya,
Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
CoRR abs/0704.1694: (2007) |
| 8 | EE | Kiran S. Kedlaya,
Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
Electronic Colloquium on Computational Complexity (ECCC) 14(040): (2007) |
| 2006 |
|---|
| 7 | EE | Kiran S. Kedlaya:
Quantum computation of zeta functions of curves.
Computational Complexity 15(1): 1-19 (2006) |
| 2004 |
|---|
| 6 | EE | Kiran S. Kedlaya:
Computing Zeta Functions via p-Adic Cohomology.
ANTS 2004: 1-17 |
| 2000 |
|---|
| 5 | EE | Kiran S. Kedlaya:
Another Combinatorial Determinant.
J. Comb. Theory, Ser. A 90(1): 221-223 (2000) |
| 1998 |
|---|
| 4 | | Kiran S. Kedlaya:
Solving constrained Pell equations.
Math. Comput. 67(222): 833-842 (1998) |
| 1997 |
|---|
| 3 | EE | Kiran S. Kedlaya:
Large Product-Free Subsets of Finite Groups.
J. Comb. Theory, Ser. A 77(2): 339-343 (1997) |
| 2 | EE | Kiran S. Kedlaya:
Urn Sampling and a Majorization Inequality.
J. Comb. Theory, Ser. A 79(1): 173-179 (1997) |
| 1996 |
|---|
| 1 | EE | Kiran S. Kedlaya:
Outerplanar Partitions of Planar Graphs.
J. Comb. Theory, Ser. B 67(2): 238-248 (1996) |
