Daniel Richardson

According to our database, Daniel Richardson authored at least 26 papers between 1968 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Relative deprivation and social identity in laboratory based riots: A model.

James Allen, Guillaume Dezecache, Daniel Richardson

Proceedings of the 42th Annual Meeting of the Cognitive Science Society, 2020

2007

Parallel computation in spiking neural nets.

Andrew Carnell, Daniel Richardson

Theor. Comput. Sci., 2007

Zero Tests for Constants in Simple Scientific Computation.

Daniel Richardson

Math. Comput. Sci., 2007

2006

Counterexamples to the uniformity conjecture.

Daniel Richardson, Ahmed El-Sonbaty

Comput. Geom., 2006

2005

Spiking neural nets with symbolic internal state.

Carl O'Dwyer, Daniel Richardson

Inf. Process. Lett., 2005

linear algebra for time series of spikes.

Andrew Carnell, Daniel Richardson

Proceedings of the 13th European Symposium on Artificial Neural Networks, 2005

2003

Use of algebraically independent numbers for zero recognition of polynomial terms.

Daniel Richardson, Ahmed El-Sonbaty

J. Complex., 2003

2002

What can we do with a Solution?

Simon Langley, Daniel Richardson

Proceedings of the Computability and Complexity in Analysis, 2002

Some observations on familiar numbers.

Daniel Richardson, Simon Langley

Proceedings of the Symbolic and Algebraic Computation, 2002

2000

The Uniformity Conjecture.

Daniel Richardson

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

Weak Wu Stratification in Rⁿ.

Daniel Richardson

J. Symb. Comput., 1999

1997

How to Recognize Zero.

Daniel Richardson

J. Symb. Comput., 1997

1996

Asymptotic Expansions of exp-log Functions.

Daniel Richardson, Bruno Salvy, John Shackell, Joris van der Hoeven

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Solution of Elementary Systems of Equations in a Box in <i>Rⁿ</i>.

Daniel Richardson

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

A Simplified Method of Recognizing Zero Among Elementary Constants.

Daniel Richardson

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994

The Identity Problem for Elementary Functions and Constants.

Daniel Richardson, John P. Fitch

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

A Zero Structure Theorem for Exponential Polynomials.

Daniel Richardson

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992

Computing the Topology of a Bounded Non-Algebraic Curve in the Plane.

Daniel Richardson

J. Symb. Comput., 1992

The Elementary Constant Problem.

Daniel Richardson

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991

Wu's Method and the Khovanskii Finiteness Theorem.

Daniel Richardson

J. Symb. Comput., 1991

Towards Computing Non Algebraic Cylindrical Decompositions.

Daniel Richardson

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.

Daniel Richardson

Math. Log. Q., 1988

1976

Continuous Self-Reproduction.

Daniel Richardson

J. Comput. Syst. Sci., 1976

1974

Sets of Theorems with Short Proofs.

Daniel Richardson

J. Symb. Log., 1974

1972

Tessellations with Local Transformations.

Daniel Richardson

J. Comput. Syst. Sci., 1972

1968

Some Undecidable Problems Involving Elementary Functions of a Real Variable.

Daniel Richardson

J. Symb. Log., 1968