Kiran S. Kedlaya

28 papers A* 1A 2Journal 20Unranked 4
YearRankTypeTitle / Venue / Authors
2024 A conf
On the Degree of Polynomials Computing Square Roots Mod p.
CCC
Kiran S. Kedlaya, Swastik Kopparty
2023 J jnl
Counterexamples to a Conjecture of Ahmadi and Shparlinski.
Exp. Math.
Taylor Dupuy, Kiran S. Kedlaya, David Roe, Christelle Vincent
2023 J jnl
On the degree of polynomials computing square roots mod p.
CoRR
Kiran S. Kedlaya, Swastik Kopparty
2023 J jnl
On the degree of polynomials computing square roots mod p.
Electron. Colloquium Comput. Complex.
Kiran S. Kedlaya, Swastik Kopparty
2017 J jnl
Bhargava's Early Work: The Genesis of P-Orderings.
Am. Math. Mon.
Paul-Jean Cahen, Jean-Luc Chabert, Kiran S. Kedlaya
2016 J jnl
A census of zeta functions of quartic K surfaces over.
LMS J. Comput. Math.
Kiran S. Kedlaya, Andrew V. Sutherland
2015 J jnl
On the algebraicity of generalized power series.
CoRR
Kiran S. Kedlaya
2015 — ch.
Sato-Tate groups of genus 2 curves.
Advances on Superelliptic Curves and their Applications
Kiran S. Kedlaya
2011 J jnl
Fast Polynomial Factorization and Modular Composition.
SIAM J. Comput.
Kiran S. Kedlaya, Christopher Umans
2010 — conf
Explicit Coleman Integration for Hyperelliptic Curves.
ANTS
Jennifer S. Balakrishnan, Robert W. Bradshaw, Kiran S. Kedlaya
2009 J jnl
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
SIAM J. Comput.
Kiran S. Kedlaya, Sergey Yekhanin
2008 — conf
Computing L-Series of Hyperelliptic Curves.
ANTS
Kiran S. Kedlaya, Andrew V. Sutherland
2008 A* conf
Fast Modular Composition in any Characteristic.
FOCS
Kiran S. Kedlaya, Christopher Umans
2008 — conf
Fast polynomial factorization and modular composition.
Computational Complexity of Discrete Problems
Kiran S. Kedlaya, Christopher Umans
2008 A conf
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
CCC
Kiran S. Kedlaya, Sergey Yekhanin
2007 J jnl
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
CoRR
Kiran S. Kedlaya, Sergey Yekhanin
2007 J jnl
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
Electron. Colloquium Comput. Complex.
Kiran S. Kedlaya, Sergey Yekhanin
2006 J jnl
Quantum computation of zeta functions of curves.
Comput. Complex.
Kiran S. Kedlaya
2005 J jnl
In search of Robbins stability.
Adv. Appl. Math.
Kiran S. Kedlaya, James Gary Propp
2004 — conf
Computing Zeta Functions via p-Adic Cohomology.
ANTS
Kiran S. Kedlaya
2001 J jnl
Problem 10885.
Am. Math. Mon.
Kiran S. Kedlaya, Sasha Schwartz
2000 J jnl
Another Combinatorial Determinant.
J. Comb. Theory A
Kiran S. Kedlaya
2000 J jnl
Incircle Partnerships: 10780.
Am. Math. Mon.
Kiran S. Kedlaya, Marcin Mazur
2000 J jnl
Problem 10780.
Am. Math. Mon.
Kiran S. Kedlaya
1998 J jnl
Solving constrained Pell equations.
Math. Comput.
Kiran S. Kedlaya
1997 J jnl
Large Product-Free Subsets of Finite Groups.
J. Comb. Theory A
Kiran S. Kedlaya
1997 J jnl
Urn Sampling and a Majorization Inequality.
J. Comb. Theory A
Kiran S. Kedlaya
1996 J jnl
Outerplanar Partitions of Planar Graphs.
J. Comb. Theory B
Kiran S. Kedlaya