Neil A. Gordon

According to our database1, Neil A. Gordon authored at least 12 papers between 1994 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Computational methods for finding long simple cycles in complex networks.
Knowl.-Based Syst., 2017

2014
Quantification of Temporal Fault Trees Based on Fuzzy Set Theory.
Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30, 2014

Using Simulation to Evaluate Dynamic Systems with Weibull or Lognormal Distributions.
Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30, 2014

2013
Quantification of Simultaneous-AND Gates in Temporal Fault Trees.
Proceedings of the New Results in Dependability and Computer Systems, 2013

2012
Aspects of the Segre variety S1, 1, 1(2).
Des. Codes Cryptography, 2012

Quantification of Priority-OR Gates in Temporal Fault Trees.
Proceedings of the Computer Safety, Reliability, and Security, 2012

2009
The cubic Segre variety in PG(5, 2).
Des. Codes Cryptography, 2009

2006
The Polynomial Degree of the GrassmannianG1, n, 2.
Des. Codes Cryptography, 2006

2005
Partial spreads in PG(4, 2) and flats in PG(9, 2) external to the Grassmannian G1, 4, 2.
Discrete Mathematics, 2005

The Classification of Flats in PG(9, 2) which are External to the Grassmannian G1, 4, 2.
Des. Codes Cryptography, 2005

2004
The Quintic Grassmannian G{1, 4, 2} in PG(9, 2).
Des. Codes Cryptography, 2004

1994
The Lines of PG(4, 2) Are the Points on a Quintic in PG(9, 2).
J. Comb. Theory, Ser. A, 1994


  Loading...