 | 2007 |
|---|
| 19 |       | Daniel Richardson:
Zero Tests for Constants in Simple Scientific Computation.
Mathematics in Computer Science 1(1): 21-37 (2007) |
| 18 | | Andrew Carnell,
Daniel Richardson:
Parallel computation in spiking neural nets.
Theor. Comput. Sci. 386(1-2): 57-72 (2007) |
| 2006 |
|---|
| 17 | | Daniel Richardson,
Ahmed El-Sonbaty:
Counterexamples to the uniformity conjecture.
Comput. Geom. 33(1-2): 58-64 (2006) |
| 2005 |
|---|
| 16 | | Andrew Carnell,
Daniel Richardson:
linear algebra for time series of spikes.
ESANN 2005: 363-368 |
| 15 | | Carl O'Dwyer,
Daniel Richardson:
Spiking neural nets with symbolic internal state.
Inf. Process. Lett. 95(6): 529-536 (2005) |
| 2003 |
|---|
| 14 | | Daniel Richardson,
Ahmed El-Sonbaty:
Use of algebraically independent numbers for zero recognition of polynomial terms.
J. Complexity 19(5): 631-637 (2003) |
| 2002 |
|---|
| 13 | | Daniel Richardson,
Simon Langley:
Some observations on familiar numbers.
ISSAC 2002: 214-220 |
| 12 | | Simon Langley,
Daniel Richardson:
What can we do with a Solution?
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 2000 |
|---|
| 11 | | Daniel Richardson:
The Uniformity Conjecture.
CCA 2000: 253-272 |
| 1999 |
|---|
| 10 |  | Daniel Richardson:
Weak Wu Stratification in Rn.
J. Symb. Comput. 28(1-2): 213-223 (1999) |
| 1996 |
|---|
| 9 | | Daniel Richardson:
Solution of Elementary Systems of Equations in a Box in Rn.
ISSAC 1996: 120-126 |
| 8 | | Daniel Richardson,
Bruno Salvy,
John Shackell,
Joris van der Hoeven:
Asymptotic Expansions of exp-log Functions.
ISSAC 1996: 309-313 |
| 1995 |
|---|
| 7 | | Daniel Richardson:
A Simplified Method of Recognizing Zero Among Elementary Constants.
ISSAC 1995: 104-109 |
| 1994 |
|---|
| 6 | | Daniel Richardson,
John Fitch:
The Identity Problem for Elementary Functions and Constants.
ISSAC 1994: 285-290 |
| 1993 |
|---|
| 5 | | Daniel Richardson:
A Zero Structure Theorem for Exponential Polynomials.
ISSAC 1993: 144-151 |
| 1992 |
|---|
| 4 | | Daniel Richardson:
The Elementary Constant Problem.
ISSAC 1992: 108-116 |
| 1991 |
|---|
| 3 | | Daniel Richardson:
Towards Computing Non Algebraic Cylindrical Decompositions.
ISSAC 1991: 247-255 |
| 1974 |
|---|
| 2 | | Daniel Richardson:
Sets of Theorems with Short Proofs.
J. Symb. Log. 39(2): 235-242 (1974) |
| 1968 |
|---|
| 1 | | Daniel Richardson:
Some Undecidable Problems Involving Elementary Functions of a Real Variable.
J. Symb. Log. 33(4): 514-520 (1968) |
