default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Ford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i2]Kevin Ford, Denka Kutzarova, George Shakan:
Explicit RIP matrices: an update. CoRR abs/2108.01794 (2021)
2010 – 2019
- 2015
- [j12]Sam Coppens, Ruben Verborgh
, Sébastien Peyrard, Kevin Ford, Tom Creighton, Rebecca S. Guenther, Erik Mannens, Rik Van de Walle:
PREMIS OWL - A semantic long-term preservation model. Int. J. Digit. Libr. 15(2-4): 87-101 (2015) - 2014
- [j11]Kevin Ford, Florian Luca, Pieter Moree:
Values of the Euler Φ-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields. Math. Comput. 83(287): 1447-1476 (2014) - [j10]Benjamin Lansdell, Kevin Ford, J. Nathan Kutz:
A Reaction-Diffusion Model of Cholinergic Retinal Waves. PLoS Comput. Biol. 10(12) (2014) - 2011
- [j9]Kevin Ford, Florian Luca:
The Number of Solutions of λ(x)=n. Integers 11A: Article9 (2011) - [c1]Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova:
Breaking the k2 barrier for explicit RIP matrices. STOC 2011: 637-644 - 2010
- [j8]Kevin Ford, Jason Sneed:
Chebyshev's Bias for Products of Two Primes. Exp. Math. 19(4): 385-398 (2010) - [i1]Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova:
Explicit constructions of RIP matrices and related problems. CoRR abs/1008.4535 (2010)
2000 – 2009
- 2006
- [j7]Kevin Ford, Robin Chapman:
Ratio of Consecutive Divisors: 11097. Am. Math. Mon. 113(5): 464 (2006) - 2005
- [j6]Bernardo Recamán Santos, Michail Reid, Kevin Ford:
Cycling via Common Divisors: 11019. Am. Math. Mon. 112(3): 277-278 (2005) - 2004
- [j5]Kevin Ford:
Problem 11097. Am. Math. Mon. 111(7): 625 (2004) - 2003
- [j4]Kevin Ford:
Maximal Collections of Intersecting Arithmetic Progressions. Comb. 23(2): 263-281 (2003) - 2002
- [j3]Kevin Ford:
An explicit sieve bound and small values of σ(ф(m)). Period. Math. Hung. 43(1-2): 15-29 (2002) - 2000
- [j2]Mihály Bencze, Dan Saracino, Allen Stenger, S. Amghibech, Jean Anglesio, R. Bauer, A. Siegel, David M. Bloom, G. L. Body, David Callan, Robin J. Chapman, Kevin Ford, Stephen M. Gagola Jr., N. Gauthier, W. V. Grounds, T. Hagedorn, R. T. Koether, N. Komanda, R. N. Krishnan, K.-W. Lau, John H. Lindsey II, L. E. Mattics, C. A. Minh, H. N. Ozsoylev, C. Y. Yildirim, P. G. Poonacha, N. R. Sanjeev, C. Popescu, J. Robertson, H.-J. Sieffert, Jeffrey O. Shallit, N. C. Singer, Albert Stadler, D. C. Terr, T. V. Triff, T. Trimble, Pavel Trojovský:
A Recurrence Generating Multiples of Primes: 10655. Am. Math. Mon. 107(3): 281-282 (2000) - [j1]Kevin Ford, Kee-Wai Lau:
Asymptotics of a Recurrent Sequence: 10682. Am. Math. Mon. 107(4): 374-375 (2000)
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 2025-01-09 13:14 CET 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:
