default search action
Russell J. Bradford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j15]Russell J. Bradford
, James H. Davenport
The DEWCAD project: pushing back the doubly exponential wall of cylindrical algebraic decomposition. ACM Commun. Comput. Algebra 55(3): 107-111 (2021) - [i23]Russell J. Bradford, James H. Davenport, Matthew England, AmirHosein Sadeghimanesh
The DEWCAD Project: Pushing Back the Doubly Exponential Wall of Cylindrical Algebraic Decomposition. CoRR abs/2106.08740 (2021) - 2020
- [j14]Russell J. Bradford
Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98: 84-119 (2020) - [j13]Matthew England
Cylindrical algebraic decomposition with equational constraints. J. Symb. Comput. 100: 38-71 (2020)
2010 – 2019
- 2019
- [e1]James H. Davenport, Dongming Wang, Manuel Kauers, Russell J. Bradford:
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019. ACM 2019, ISBN 978-1-4503-6084-5 [contents] - [i22]Russell J. Bradford, Christopher J. Sangwin, Supreeth P. Shashikumar, Shamim Nemati:
Does the "Artificial Intelligence Clinician" learn optimal treatment strategies for sepsis in intensive care? CoRR abs/1902.03271 (2019) - [i21]Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu
Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks. CoRR abs/1902.04882 (2019) - [i20]Matthew England, Russell J. Bradford, James H. Davenport:
Cylindrical Algebraic Decomposition with Equational Constraints. CoRR abs/1903.08999 (2019) - 2018
- [c42]Casey B. Mulligan, Russell J. Bradford, James H. Davenport, Matthew England, Zak Tonks:
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics. SC-Square@FLOC 2018: 48 - [d2]Casey B. Mulligan, Russell J. Bradford, James H. Davenport
Datset of automated economic reasoning problems for QE / SMT. Version 1. Zenodo, 2018 [all versions] - [d1]Casey B. Mulligan, Russell J. Bradford, James H. Davenport
Datset of automated economic reasoning problems for QE / SMT. Version 2. Zenodo, 2018 [all versions] - [i19]Casey B. Mulligan, Russell J. Bradford, James H. Davenport, Matthew England, Zak Tonks:
Quantifier Elimination for Reasoning in Economics. CoRR abs/1804.10037 (2018) - [i18]Casey B. Mulligan, Russell J. Bradford, James H. Davenport, Matthew England, Zak Tonks:
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics. CoRR abs/1806.11447 (2018) - 2017
- [c41]Russell J. Bradford
A Case Study on the Parametric Occurrence of Multiple Steady States. ISSAC 2017: 45-52 - [i17]Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber:
A Case Study on the Parametric Occurrence of Multiple Steady States. CoRR abs/1704.08997 (2017) - 2016
- [j12]Russell J. Bradford
Truth table invariant cylindrical algebraic decomposition. J. Symb. Comput. 76: 1-35 (2016) - [c40]Ralph Potter, Russell J. Bradford
A C++ Programming Model for Heterogeneous System Architecture. ISC Workshops 2016: 433-450 - 2015
- [c39]Matthew England
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition. ISSAC 2015: 165-172 - [c38]Ralph Potter, Paul Keir
Kernel composition in SYCL. IWOCL 2015: 11:1-11:7 - [i16]Matthew England, Russell J. Bradford, James H. Davenport:
Improving the use of equational constraints in cylindrical algebraic decomposition. CoRR abs/1501.04466 (2015) - 2014
- [j11]Matthew England
Branch cuts in maple 17. ACM Commun. Comput. Algebra 48(1/2): 24-27 (2014) - [j10]David J. Wilson, Russell J. Bradford
Cylindrical Algebraic Sub-Decompositions. Math. Comput. Sci. 8(2): 263-288 (2014) - [c37]Russell J. Bradford
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains. CASC 2014: 44-58 - [c36]Victor Lazzarini, John ffitch, Joseph Timoney, Russell J. Bradford:
Streaming Spectral Processing with Consumer-Level Graphics Processing Units. DAFx 2014: 115-122 - [c35]Matthew England
Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition. ICMS 2014: 450-457 - [c34]Matthew England
Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting. ICMS 2014: 458-465 - [c33]Matthew England
Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition. CICM 2014: 45-60 - [c32]David J. Wilson, Matthew England
Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition. SYNASC 2014: 53-60 - [i15]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Truth Table Invariant Cylindrical Algebraic Decomposition. CoRR abs/1401.0645 (2014) - [i14]David J. Wilson, Russell J. Bradford, James H. Davenport, Matthew England:
Cylindrical Algebraic Sub-Decompositions. CoRR abs/1401.0647 (2014) - [i13]Russell J. Bradford, Changbo Chen, James H. Davenport, Matthew England, Marc Moreno Maza, David J. Wilson:
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains. CoRR abs/1401.6310 (2014) - [i12]Matthew England, Russell J. Bradford, Changbo Chen, James H. Davenport, Marc Moreno Maza, David J. Wilson:
Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. CoRR abs/1404.6371 (2014) - [i11]Matthew England, David J. Wilson, Russell J. Bradford, James H. Davenport:
Using the Regular Chains Library to build cylindrical algebraic decompositions by projecting and lifting. CoRR abs/1405.6090 (2014) - [i10]Matthew England, Russell J. Bradford, James H. Davenport, David J. Wilson:
Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. CoRR abs/1405.6094 (2014) - [i9]David J. Wilson, Matthew England, Russell J. Bradford, James H. Davenport:
Using the distribution of cells by dimension in a cylindrical algebraic decomposition. CoRR abs/1409.1781 (2014) - 2013
- [c31]Russell J. Bradford
Cylindrical algebraic decompositions for boolean combinations. ISSAC 2013: 125-132 - [c30]Russell J. Bradford
Optimising Problem Formulation for Cylindrical Algebraic Decomposition. MKM/Calculemus/DML 2013: 19-34 - [c29]Matthew England
Understanding Branch Cuts of Expressions. MKM/Calculemus/DML 2013: 136-151 - [c28]David J. Wilson, James H. Davenport
A "Piano Movers" Problem Reformulated. SYNASC 2013: 53-60 - [i8]Russell J. Bradford, James H. Davenport, Matthew England, David J. Wilson:
Optimising Problem Formulation for Cylindrical Algebraic Decomposition. CoRR abs/1304.7222 (2013) - [i7]Matthew England, Russell J. Bradford, James H. Davenport, David J. Wilson:
Understanding Branch Cuts of Expressions. CoRR abs/1304.7223 (2013) - [i6]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Cylindrical Algebraic Decompositions for Boolean Combinations. CoRR abs/1304.7603 (2013) - [i5]Matthew England, Edgardo S. Cheb-Terrab, Russell J. Bradford, James Harold Davenport, David J. Wilson:
Branch Cuts in Maple 17. CoRR abs/1308.6523 (2013) - [i4]David J. Wilson, James H. Davenport, Matthew England, Russell J. Bradford:
A "Piano Movers" Problem Reformulated. CoRR abs/1309.1588 (2013) - 2012
- [j9]David J. Wilson, Russell J. Bradford
A repository for CAD examples. ACM Commun. Comput. Algebra 46(3/4): 67-69 (2012) - [c27]David J. Wilson, Russell J. Bradford
Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases. AISC/MKM/Calculemus 2012: 280-294 - [c26]James H. Davenport
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc. SYNASC 2012: 83-88 - [i3]David J. Wilson, Russell J. Bradford, James H. Davenport:
Speeding up Cylindrical Algebraic Decomposition by Gröbner Bases. CoRR abs/1205.6285 (2012) - [i2]James H. Davenport, Russell J. Bradford, Matthew England, David J. Wilson:
Program Verification in the presence of complex numbers, functions with branch cuts etc. CoRR abs/1212.5417 (2012) - 2011
- [c25]Russell J. Bradford, John ffitch, Richard W. Dobson:
Real-time Sliding Phase Vocoder using a Commodity GPU. ICMC 2011 - [i1]Saif Al-Kuwari, James H. Davenport, Russell J. Bradford:
Cryptographic Hash Functions: Recent Design Trends and Security Notions. IACR Cryptol. ePrint Arch. 2011: 565 (2011) - 2010
- [j8]Nalina Phisanbut, Russell J. Bradford, James H. Davenport:
Geometry of branch cuts. ACM Commun. Comput. Algebra 44(3/4): 132-135 (2010)
2000 – 2009
- 2009
- [c24]Russell J. Bradford
A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy. Calculemus/MKM 2009: 75-89 - 2008
- [c23]Richard W. Dobson, John ffitch, Russell J. Bradford:
High-Performance audio Computing - a position Paper. ICMC 2008 - 2007
- [j7]James C. Beaumont, Russell J. Bradford
Testing elementary function identities using CAD. Appl. Algebra Eng. Commun. Comput. 18(6): 513-543 (2007) - [c22]Russell J. Bradford, Richard W. Dobson, John ffitch:
The sliding phase vocoder. ICMC 2007 - 2005
- [c21]James C. Beaumont, Nalina Phisanbut, Russell J. Bradford:
Practical Simplification of Elementary Functions Using CAD. Algorithmic Algebra and Logic 2005: 35-39 - [c20]Russell J. Bradford, Richard W. Dobson, John ffitch:
Sliding is smoother than jumping. ICMC 2005 - [c19]James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut:
Adherence is better than adjacency: computing the Riemann index using CAD. ISSAC 2005: 37-44 - 2004
- [c18]James C. Beaumont, Russell J. Bradford
A poly-algorithmic approach to simplifying elementary functions. ISSAC 2004: 27-34 - 2003
- [c17]James C. Beaumont, Russell J. Bradford
Better simplification of elementary functions through power series. ISSAC 2003: 30-36 - 2002
- [j6]Russell J. Bradford
Reasoning about the Elementary Functions of Complex Analysis. Ann. Math. Artif. Intell. 36(3): 303-318 (2002) - [c16]Russell J. Bradford
Towards better simplification of elementary functions. ISSAC 2002: 16-22 - [c15]Rob Simmonds, Carey L. Williamson, Russell J. Bradford, Martin F. Arlitt, Brian W. Unger:
Web server benchmarking using parallel WAN emulation. SIGMETRICS 2002: 286-287 - 2001
- [c14]Russell J. Bradford, Rob Simmonds, Brian W. Unger:
Packet Reading for Network Emulation. MASCOTS 2001: 150-157 - 2000
- [c13]Russell J. Bradford, Rob Simmonds, Brian W. Unger:
A Parallel Discrete Event IP Network Emulator. MASCOTS 2000: 315-322 - [c12]Rob Simmonds, Russell J. Bradford, Brian W. Unger:
Applying parallel discrete event simulation to network emulation. PADS 2000: 15-22
1990 – 1999
- 1999
- [c11]David Power, Russell J. Bradford
A Library for Parallel Modular Arithmetic. Euro-Par 1999: 1476-1483 - 1998
- [c10]Julian A. Padget
A pi-calculus Model of a Spanish Fish Market - Preliminary Report. AMET 1998: 166-188 - 1996
- [j5]Russell J. Bradford:
An implementation of Telos in Common Lisp. Object Oriented Syst. 3: 31-49 (1996) - [j4]Russell J. Bradford, Alun Thomas:
Markov chain Monte Carlo methods for family trees using a parallel processor. Stat. Comput. 6(1): 67-75 (1996) - 1994
- [c9]Michael C. Fairhurst, N. Higson, C. Clar, Russell J. Bradford, W. Clark, E. Pringle:
Automatic Image Processing in Developmental Testing of Visual-Motor Integration. ICCHP 1994: 329-335 - 1993
- [j3]Russell J. Bradford, David De Roure:
EuLisp in Education. LISP Symb. Comput. 6(1-2): 99-118 (1993) - 1992
- [c8]Russell J. Bradford
Algebraic Simplification of Multiple-Valued Functions. DISCO 1992: 13-21 - 1991
- [j2]Julian A. Padget
Concurrent Object-Oriented Programming in Lisp. Comput. J. 34(4): 311-319 (1991) - 1990
- [c7]Russell J. Bradford:
A Parallelization of the Buchberger Algorithm. ISSAC 1990: 296
1980 – 1989
- 1989
- [c6]Russell J. Bradford:
Some Results on the Defect. ISSAC 1989: 129-135 - 1988
- [c5]Russell J. Bradford
Effective Tests for Cyclotonic Polynomials. ISSAC 1988: 244-251 - 1987
- [c4]Russell J. Bradford:
Hermite normal forms for integer matrices. EUROCAL 1987: 315-316 - [c3]John A. Abbott, Russell J. Bradford, James H. Davenport:
Factorisation of Polynominals: Old Ideas and Recent Results. Trends in Computer Algebra 1987: 81-91 - 1986
- [c2]Russell J. Bradford
Enlarging the REDUCE domain of computation. SYMSAC 1986: 100-106 - [c1]John A. Abbott, Russell J. Bradford, James H. Davenport:
The Bath algebraic number package. SYMSAC 1986: 250-253 - 1985
- [j1]John A. Abbott, Russell J. Bradford, James H. Davenport:
A remark on factorisation. SIGSAM Bull. 19(2): 31-33 (1985)
Coauthor Index
James H. Davenport
aka: James Harold Davenport
aka: James Harold Davenport
[j15] [i23] [j14] [j13] [e1] [i21] [i20] [c42] [d2] [d1] [i19] [i18] [c41] [i17] [j12] [c39] [i16] [j11] [j10] [c37] [c35] [c34] [c33] [c32] [i15] [i14] [i13] [i12] [i11] [i10] [i9] [c31] [c30] [c29] [c28] [i8] [i7] [i6] [i5] [i4] [j9] [c27] [c26] [i3] [i2] [i1] [j8] [c24] [j7] [c19] [c18] [c17] [j6] [c16] [c5] [c3] [c1] [j1]
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-12-13 20:07 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: