default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Ford 0001
Person information
- affiliation: Concordia University, Montreal, Canada
Other persons with the same name
- David Ford 0002 — Amlin, Wallingford, Oxfordshire, UK
- David Ford 0003 — Naval Post Graduate School, Department of Physics, Monterey, CA, USA
- David Ford 0004 — Texas A&M University, College Station, TX, USA
- David Ford 0005
![[0000-0002-3484-7619]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3484-7619")
— Met Office, Exeter, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1998
[j8]David Ford, Michael Pohst, Mario Daberkow, Nasser Haddad:
The S5 Extensions of Degree 6 with Minimum Discriminant. Exp. Math. 7(2): 121-124 (1998)- 1996
- [j7]David Ford, Kenneth W. Johnson:
Determinants of Latin Squares of Order 8. Exp. Math. 5(4): 317-325 (1996) - [j6]David Casperson, David Ford, John McKay:
Ideal Decompositions and Subfields. J. Symb. Comput. 21(2): 133-137 (1996) - 1993
- [j5]David Ford, Vijay Jha:
On Wendt's Determinant and Sophie Germain's Theorem. Exp. Math. 2(2): 113-120 (1993) - [j4]David J. Ford, Michael E. Pohst:
The Totally Real A6 Extension of Degree 6 with Minimum Discriminant. Exp. Math. 2(3): 231-232 (1993) - 1992
- [j3]David Ford, Michael Pohst:
The Totally Real A5 Extension of Degree 6 with Minimum Discriminant. Exp. Math. 1(3): 231-235 (1992) - 1990
- [j2]Marie-Hélène Mathieu, David Ford:
On p-adic Computation of the Rational Form of a Matrix. J. Symb. Comput. 10(5): 453-464 (1990) - 1987
- [j1]David J. Ford:
The Construction of Maximal Orders Over a Dedekind Domain. J. Symb. Comput. 4(1): 69-75 (1987)
Conference and Workshop Papers
- 2010
- [c4]David Ford, Olga Veres:
On the Complexity of the Montes Ideal Factorization Algorithm. ANTS 2010: 174-185 - 1996
- [c3]David Ford:
Minimum Discriminants of Primitive Sextic Fields. ANTS 1996: 141-143 - [c2]David Ford, George Havas:
A New Algorithm and Refined Bounds for Extended Gcd Computation. ANTS 1996: 145-150 - 1985
- [c1]David Ford, John McKay:
From Polynominals to Galois Groups. European Conference on Computer Algebra (2) 1985: 535-536
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:23 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:
