Daniel Richardson

According to our database1, Daniel Richardson authored at least 21 papers between 1968 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2007
Parallel computation in spiking neural nets.
Theor. Comput. Sci., 2007

Zero Tests for Constants in Simple Scientific Computation.
Mathematics in Computer Science, 2007

2006
Counterexamples to the uniformity conjecture.
Comput. Geom., 2006

2005
Spiking neural nets with symbolic internal state.
Inf. Process. Lett., 2005

linear algebra for time series of spikes.
Proceedings of the ESANN 2005, 2005

2003
Use of algebraically independent numbers for zero recognition of polynomial terms.
J. Complexity, 2003

2002
What can we do with a Solution?
Electr. Notes Theor. Comput. Sci., 2002

Some observations on familiar numbers.
Proceedings of the Symbolic and Algebraic Computation, 2002

2000
The Uniformity Conjecture.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Weak Wu Stratification in Rn.
J. Symb. Comput., 1999

1997
How to Recognize Zero.
J. Symb. Comput., 1997

1996
Asymptotic Expansions of exp-log Functions.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Solution of Elementary Systems of Equations in a Box in Rn.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
A Simplified Method of Recognizing Zero Among Elementary Constants.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994
The Identity Problem for Elementary Functions and Constants.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993
A Zero Structure Theorem for Exponential Polynomials.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992
The Elementary Constant Problem.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
Towards Computing Non Algebraic Cylindrical Decompositions.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1988
Non Standard Models of the Theory of Elementary Functions of a Real Variable.
Math. Log. Q., 1988

1974
Sets of Theorems with Short Proofs.
J. Symb. Log., 1974

1968
Some Undecidable Problems Involving Elementary Functions of a Real Variable.
J. Symb. Log., 1968


  Loading...