default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiran S. Kedlaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Kiran S. Kedlaya, Swastik Kopparty:
On the Degree of Polynomials Computing Square Roots Mod p. CCC 2024: 25:1-25:14- 2023
- [j15]Taylor Dupuy, Kiran S. Kedlaya, David Roe
, Christelle Vincent:
Counterexamples to a Conjecture of Ahmadi and Shparlinski. Exp. Math. 32(3): 540-544 (2023) - [i6]Kiran S. Kedlaya, Swastik Kopparty:
On the degree of polynomials computing square roots mod p. CoRR abs/2311.10956 (2023) - [i5]Kiran S. Kedlaya, Swastik Kopparty:
On the degree of polynomials computing square roots mod p. Electron. Colloquium Comput. Complex. TR23 (2023)
2010 – 2019
- 2017
- [j14]Paul-Jean Cahen, Jean-Luc Chabert, Kiran S. Kedlaya:
Bhargava's Early Work: The Genesis of P-Orderings. Am. Math. Mon. 124(9): 773-790 (2017) - 2016
- [j13]Kiran S. Kedlaya, Andrew V. Sutherland:
A census of zeta functions of quartic K surfaces over. LMS J. Comput. Math. 19(A): 1-11 (2016) - 2015
- [p1]Kiran S. Kedlaya:
Sato-Tate groups of genus 2 curves. Advances on Superelliptic Curves and their Applications 2015: 117-136 - [i4]Kiran S. Kedlaya:
On the algebraicity of generalized power series. CoRR abs/1508.01836 (2015) - 2011
- [j12]Kiran S. Kedlaya, Christopher Umans:
Fast Polynomial Factorization and Modular Composition. SIAM J. Comput. 40(6): 1767-1802 (2011) - 2010
- [c5]Jennifer S. Balakrishnan, Robert W. Bradshaw, Kiran S. Kedlaya:
Explicit Coleman Integration for Hyperelliptic Curves. ANTS 2010: 16-31
2000 – 2009
- 2009
- [j11]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
- [c4]Kiran S. Kedlaya, Andrew V. Sutherland:
Computing L-Series of Hyperelliptic Curves. ANTS 2008: 312-326 - [c3]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. CCC 2008: 175-186 - [c2]Kiran S. Kedlaya, Christopher Umans:
Fast Modular Composition in any Characteristic. FOCS 2008: 146-155 - [i3]Kiran S. Kedlaya, Christopher Umans:
Fast polynomial factorization and modular composition. Computational Complexity of Discrete Problems 2008 - 2007
- [i2]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) - [i1]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j10]Kiran S. Kedlaya:
Quantum computation of zeta functions of curves. Comput. Complex. 15(1): 1-19 (2006) - 2005
- [j9]Kiran S. Kedlaya, James Gary Propp:
In search of Robbins stability. Adv. Appl. Math. 34(4): 659-668 (2005) - 2004
- [c1]Kiran S. Kedlaya:
Computing Zeta Functions via p-Adic Cohomology. ANTS 2004: 1-17 - 2001
- [j8]Kiran S. Kedlaya, Sasha Schwartz:
Problem 10885. Am. Math. Mon. 108(6): 566 (2001) - 2000
- [j7]Kiran S. Kedlaya:
Another Combinatorial Determinant. J. Comb. Theory A 90(1): 221-223 (2000) - [j6]Kiran S. Kedlaya:
Problem 10780. Am. Math. Mon. 107(1): 84 (2000) - [j5]Kiran S. Kedlaya, Marcin Mazur:
Incircle Partnerships: 10780. Am. Math. Mon. 107(10): 957-958 (2000)
1990 – 1999
- 1998
- [j4]Kiran S. Kedlaya:
Solving constrained Pell equations. Math. Comput. 67(222): 833-842 (1998) - 1997
- [j3]Kiran S. Kedlaya:
Large Product-Free Subsets of Finite Groups. J. Comb. Theory A 77(2): 339-343 (1997) - [j2]Kiran S. Kedlaya:
Urn Sampling and a Majorization Inequality. J. Comb. Theory A 79(1): 173-179 (1997) - 1996
- [j1]Kiran S. Kedlaya:
Outerplanar Partitions of Planar Graphs. J. Comb. Theory B 67(2): 238-248 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
