A. K. Dewdney

Affiliations:
  • University of Western Ontario, Canada


According to our database1, A. K. Dewdney authored at least 11 papers between 1973 and 1995.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1995
Der Turing Omnibus - eine Reise durch die Informatik mit 66 Stationen.
Springer, ISBN: 978-3-540-57780-5, 1995

1992
A Run-Length Slice Line Drawing Algorithm without Division Operations.
Comput. Graph. Forum, 1992

1991
Efficient Simulation of Finite Automata by Neural Nets.
J. ACM, 1991

1986
Experiments with a generic reduction computer.
SIGACT News, 1986

1982
The bandwidth problem for graphs and matrices - a survey.
J. Graph Theory, 1982

1981
Oriented two-dimensional circuits.
Discret. Math., 1981

1979
Diagonal Tree Codes
Inf. Control., February, 1979

Logic circuits in the plane: minimal crossovers.
SIGACT News, 1979

1978
Analysis of a steepest-descent image-matching algorithm.
Pattern Recognit., 1978

1973
Tours in Machines and Digraphs.
IEEE Trans. Computers, 1973

Wagner's theorem for Torus graphs.
Discret. Math., 1973


  Loading...