Centre for Environmental Science & Sustainability
University of Western Ontario
London, Ontario, N6A 5B7
(519) 679-8105 (home office)
August 5, 1941, London, Ontario
1. PRESENT UWO RANK AND STATUS: Professor Emeritus
2. INITIAL UWO APPOINTMENT: Lecturer July 1 1968
3. DATE TENURE CONFERRED: July 1 1974
Full Professor July 1 1 2000
Professor Emeritus (Waterloo) June 30 2004
Past: analysis of algorithms, artificial intelligence, automata and languages, combinatorics and combinatorial algorithms, computation and complexity theory, computer logic, discrete structures, scientific
and industrial simulationPresent: population biology; studies in randomness
1. 1970. Primal Graphs, Aeq. Math. 4: 326-328.
2. 1972. The chromatic number of a class of two-manifolds, Manuscripta Math. 6: 311-319.
3. 1973. Tours in machines and digraphs, IEEE Trans.Comput. 7: 635-639 (with A. L. Szilard).
4. 1973. Wagner's theorem for torus graphs, Discrete Math. 4: 139-149.
5. 1974. Three species of connection in complexes, Stud.Sci. Math. Hung. 9: 331-339.
6. 1974. Higher dimensional tree structures, J. Comb. Th. 17: 160-169.
7. 1974. Generating the nine-point graphs, Math. Comp. 28: 833-838 (with H. H. Baker and A. L. Szilard).
8. 1975. Degree sequences in complexes and hypergraphs, Proc. Am. Math. Soc. 53: 535-546.
9. 1976. The adjacency graph of a complex, Czech. Math. J. 26: 137-144 (with F. Harary).
10. 1976. The bandwidth of a graph: some recent results, Proc. 7th S.E. Conf on Graph Th., Comb. and Comput. Baton Rouge, La.: 273-288.
11. 1976. The intersection numbers of a complex, Aeq. Math. 14: 357-362.
12. 1977. Embedding graphs in Euclidean three-space, Am. Math. Monthly 84: 372-373.
13. 1977. Convex partitions of R^{3 }with applications to Crum's problem and Knuth's post-office problem,Utilitas Math. 12: 193-197 (with V. K. Vranch).
14. 1977. Threshold matrices and the state-assignment problem for neural nets, Proc. 8th S. E. Conf on Graph Th,, Comb. and Comput. Baton Rouge, La.: 227-245.
15. 1977. On the chromatic numbers of a simplicial complex, J. Comb. Inf. and Sys. Sci. 2: 28-35 (with F. Harary).
16. 1977. Signal optimization: a case study in the teaching of computer simulation, Simulation Councils Proceedings Series 7: 213-220 (with C. B. Richards).
17. 1978. Spool motors: compact storage of a stretched elastic medium, Mech. and Mach. Th. 13: 245-250.
18. 1978. Analysis of a steepest-descent image-matching algorithm, Pattern Recog. 10: 31-39.
19. 1978. Three classes of graph invariants and their powers, Proc. 9th S. E. Conf on Graph Th., Comb. and Comput. Boca Raton, Fla.: 243-263.
20. 1979. Diagonal tree codes, Information and Control, 40: 234-239.
21. 1979. A size limit for uniformly pulsating sources of electromagnetic radiation, Astophys. Lett. 20: 49-52.
22. 1979. A fast, approximate gap-minimization algorithm, Proc. 10th S. E. Conf. on Graph Th., Comb. and Comput. Boca Raton, Fla.: 349-365.
23. 1980. The embedding dimension of a graph, Ars Comb. 9: 77-90.
24. 1980. Centroid companion trees, Congressus Numerantium 28: 351-367.
25. 1981. Oriented, two-dimensional circuits, Discrete Math. 33: 149-163 (with F. Harary).
26. 1982. Graph bandwidth: a survey of theory and applications, J. Graph Th. 6: 223-254 (with P. Z. Chinn, J. Chvatalova, and N. E. Gibbs).
27. 1982. Linear time transformations between combinatorial problems, Internat. J. Comp. Math. 11: 91-110.
28. 1983. Average-time testing of satisfiability algorithms, Congressus Numerantium 39: 305-325 (with T. R. S. Walsh and D. L. Wehlau).
29. 1983. An optimal diagonal tree code, SIAM J. Alg and Disc. Math. 4,1: 42-49.
30. 1985. A methodology for average-time testing of graph algorithms, Congressus Numerantium 47: 273-284 (with T. R. S. Walsh).
31. 1986. Generic reduction computers, Congressus Numerantium 54: 21-38.
32. 1989. Fast Turing reductions of combinatorial problems and their algorithms, Proc. 3rd Internat. Conf. on Combinatorics, vol 555 of the N. Y. Acad. of Sciences: 171-180.
33. 1990. Single neuron studies, Congressus Numerantium 77: 77-85.
34. 1991. On the efficient simulation of finite automata by neural networks, J. A. C. M. vol 38 #2: 495-514 (with N. Alon and T. J. Ott).
35. 1992. A run-length slice line-drawing algorithm without division operations, (A. Kilgour, L. Kjeldahl, eds.) EUROGRAPHICS '92, vol II, no. 3: c-268-77.
36. 1997. A dynamical model of abundance in natural communities. COENOSES 12 (2&3): 67-76.
37. 1998. A general theory of the sampling process with applications to the "veil line." Theor. Pop. Biol. 54: 294-302.
38. 1998 A dynamical model of communities and a new species-abundance distribution. Biological Bulletin 198: 152-165.
39. 2001 The forest and the trees: romancing the J-curve. Math. Intelligencer 23 (3): 27 - 34.
40. 2003 The stochastic community and the logistic-J distribution. Acta Oecologica 24: 221-229.
41. 2004 Debruijn graphs and sequences. Chapter 4.4 in Handbook of Graph Theory (J. L. Gross, J. Yellen, eds.) CRC Press, Boca Raton FL.
42. 2008. Cellular Automata. pp 541-550 in The Encyclopedia of Ecology (S. E. Jorgensen & Brian Fath, eds.) Elsevier, Oxford.
1. 1976. A grey-level character set for the production of pictures at a printing terminal, ACM Sigraph Newsletter 10: 14-25.
2. 1976. A teleconferencing program: progress report, Dept. of Communications, Ottawa, May 1976.
3. 1976. Two low-level vision projects, CSCSI Newsletter, 1 (3): 37-41.
4. 1977. Image-matching in the context of a semi-autonomous 'Mars Rover', CSCSI Newsletter 1 (4): 42-43.
5. 1979. Logic circuits in the plane: minimal crossovers, SIGACT News 10 (3): 38-48.
6. 1979. Exploring the Planiverse, J. Rec. Math. 12: 16-20.
7. 1985. Logical problems arising in the specification of a generic reduction computer, SPOCC (Special Problems in Communication and Computation) Workshop, Bell Communications Research, Morristown, N. J. Aug 1985.
8. 1986. Generic reduction computers, Computer Architecture Technical Committee Newsletter, IEEE Computer Society, March 1986, 25-47.
9. 1999. On Fiddib Har. Chapter 16 in Imaginary Numbers (W. Frucht ed.)
John Wiley & Sons, New York.
2. 1977. Complexity of nearest neighbour searching in three and higher
dimensions, UWO DCS Tech. Rep. #28, June 1977.
3. 1978. Two-dimensional computing, UWO DCS Tech. Rep. #39, May 1978.
4. 1981. The Computation of bandwidth and folding number for trees, UWO
DCS Tech. Rep. #60, June 1981.
5. 1981-84. Fast Turing reductions between problems in NP, UWO DCS Tech.
Rep. #s 68-75, 1981-84.
2. 1976. Complexity of nearest neighbour searching in three dimensions, Carnegie Mellon University, Pittsburgh, Pa. 1976 (abstract on page 40 of Algorithms and Complexity: Proceedings of a Symposium on New Directions and Recent Results in Algorithms and Complexity, April 1976).
3. 1977. Generalizing MacLane's theorem, U. of Waterloo, Dept. of Combinatorics and Optimization, July 1977.
4. 1978. Trees for botanists, UWO Dept. of Plant Sciences, June 1978.
5. 1978. Six combinatorial problems in computer science, U. of Toronto, Dept. of Computer Science, Sept. 1978.
6. 1979. The Steiner problem, AT&T Bell Laboratories, Long Branch, N. J. April, 1979.
7. 1979. Embedding dimension of graphs, Third Michigan Graph Theory Symposium, Ann Arbor, Mich. May, 1979.
8. 1979. Reconstructing (0,1)-matrices, MIGHTY-IV Conference, Purdue University at Fort Wayne, Fort Wayne, Ind. Oct. 1979.
9. 1979. Reconstructing (0,1)-matrices, U. of Waterloo, Dept. of Combinatorices and Optimization, Oct. 1979.
10. 1980. Two-dimensional physics, UWO Dept. of Physics, Oct. 1980.
11. 1980. Cook's Theorem for combinatorists, Reading University, Dept. of Mathematics, Reading, England, Nov. 1980.
12. 1980. Cook's Theorem for Combinatorists, Oxford University, The Mathematical Institute, Oxford, Nov. 1980.
13. 1980. The combinatorial implications of Cook's Theorem, U. of Warwick, Dept. of Computer Science, Coventry, England, Nov.1980.
14. 1980. Linear-time combinatorial transformations, CUNY Hunter College, New York, Dec. 1980.
15. 1981. Algebraic, topological and combinatorial aspects of Steiner quasigroups, American Math. Soc. Annual Meeting, San Francisco, Calif. Jan. 1981.
16. 1981. Linear-time transformations between NP-complete problems, U. of Paris-Sud, Orsay, France, Feb. 1981.
17. 1981. Linear reductions between combinatorial problems, U. of Reading, Dept. of Mathematics, Reading, England, May, 1981.
18. 1981. Linear-time transformations between NP-complete problems, Manchester U. Manchester, England, Feb. 1981.
19. 1981. The Planiverse, Royal Military College, Kingston, Ont. Oct.1981.
20. 1981. Reduction strategies for algorithms in NP, UWO Dept. of Computer Science, Oct. 1981.
21. 1981. NP-completeness of the crossing-number problem, Ottawa VLSI Conference, Dec. 1981.
22. 1982. Polynomial transforms and invariants, U. of Central Florida, Dept. of Mathematics, Orlando, Fla. June,1982.
23. 1982. Fast Turing reductions, Annual ACM Conference, Indianapolis, Ind. Feb. 1982.
24. 1982. Fast Turing reductions, U. of Toronto, Dept. of Computer Science, Toronto, Ont. March, 1982.
25. 1982. The Planiverse, Miami U. Dept. of Mathematics, Oxford, Ohio, Oct. 1982.
26. 1982. The bandwidth problem: a survey, The Stevens Institute of Technology, Dept. of Mathematics, Hoboken, N. J. Oct. 1982.
27. 1982. Testing satisfiability algorithms, UWO Dept. of Computer Science, Nov. 1982.
28. 1983. An efficient version of Cook's generic reduction, UWO Dept. of Computer Science, March, 1983.
29. 1983. TRANSAT, Carlton U. Dept. of Computer Science, May, 1983.
30. 1984. Planiverse preview, IBM Yorktown, Yorktown Heights, N.Y. Feb. 1984.
31. 1984. Non-deterministic programming in TRANSAT, UWO Dept. of Computer Science, March, 1984.
32. 1984. The Planiverse, Brown University Multidimensional Colloquium, Providence, R. I. Oct. 1984.
33. 1984. The Planiverse, Fermilabs, Chicago, Ill. Nov. 1984.
34. 1985. Generic reduction computers, McMaster U. Computer Science Dept. Hamilton, Ont. March, 1985.
35. 1985. Generic reduction computers, UWO Dept. of Computer Science, March, 1985.
36. 1985. The Mandelbrot set, ACM Conference on Information Retrieval, Montreal, Que. June 5, 1985.
37. 1985. Generic reduction computers, Bell Communications Research, Morristown, N. J. Aug. 19, 1985.
38. 1987. Combinatorics as logic, Miami U. Oxford, Oh. Oct. 9. 1987.
39. 1988. Efficient embeddings of neural nets, Bell Communications Research, Morristown, N. J. 1988.
40. 1989. Neural nets and their problems, Dalhousie U. Halifax, Nova Scotia, May 10, 1989.
41. 1989. Neural nets and their problems, U. of Wisconsin, Dept. of Mathematics, Madison, Wis. May 18, 1989.
42. 1989. Dynamics, chaos and fractals, U. of Toronto, Dept. of Physics, Oct, 1989.
43. 1990. Dynamics, chaos and fractals, Dept. of Computer Science, U. of Missouri at Columbia, March, 1990.
44. 1991. Dynamics, chaos and fractals, Dept. of Computer Science, U. of Windsor, May 1991.
45. 1992. Dynamical systems, chaos and fractals, University of Victoria, Dept. of Computer Science (LACIR), Feb. 27, 1992.
46. 1992. Strengths and weaknesses in the neural net paradigm, University of Victoria, Dept. of Computer Science (LACIR), Feb. 28, 1992.
47. 1996. Micro-ecology in a small stream, EMAN Second National Meeting, Halifax, NS, January 1996
48. 1996. Yes we have no neutrons. IEEE Dallas Ft. Worth. TX March 20 1996.
49. 1996. How to create innumeracy in school children. Canadian Math. Soc. U of Western Ontario, Dec. 6, 1996.
50. 1997. The crisis in biodiversity research. Ontario Ethology and Ecology Colloquium. U of Western Ontario. London, Ontario. May 12, 1997.
51. 1999. What is biodiversity. Biology Dept. U of New Brunswick. Fredericton NB, February 10, 1998.
52. 1999. Aquatic microbial communities. Workshop, Ecology and Evolution Div. UWO. June 7, 1999.
53. 2000. Do aliens do math? The Nagle Lecture. U of South Florida, Tampa FL. October 15, 2000.
54. 2000. Biodiversity and statistics. U of South Florida, Tampa FL. October 14, 2000.
55. 2001. Education and the math abuse detective. ESSO Centre for Mathematics Education. U of Western Ontario, April 21, 2001.
56. 2001. Do aliens do math? AMATYC Annual Meeting. Toronto, ON. November 6, 2001.
57. 2004. Using the logistic-J distribution to estimate species richness.
ERW Colloquium. UWO Environmental Science Program. London Ontario. April
22, 2004.
1. 1972. Artificial intelligence, CIPS Computer Magazine, Sept.: 6-7.
2. 1974. Two-dimensional crystallography, The Science Terrapin, UWO Fac, of Sci., #1: 12-15.
3. 1975. The famous four-colour problem, The Science Terrapin, UWO Fac. of Sci. #2: 14-17.
4. 1984. In the game called Core War hostile programs engage in a battle of bits, Computer Recreations,Scientific American, May: 14-22.
5. 1984. On the spaghetti computer and other analog gadgets for problem solving, Computer Recreations,Scientific American, June: 19-26.
6. 1984. A program that plays checkers can often stay one jump ahead, Computer Recreations, Scientific American, July: 19-26.
7. 1984. A computer trap for the busy beaver, the hardest-working Turing machine, Computer Recreations, Scientific American, Aug.: 14-23.
8. 1984. The failings of a digital eye suggest there can be no sight without insight, Computer Recreations, Scientific American, Sept.: 22-34.
9. 1984. A computational garden sprouting anagrams, pangrams and few weeds, Computer Recreations, Scientific Amercan, Oct: 20-27.
10. 1984. Yin and yang: recursion and iteration, the tower of Hanoi and the Chinese rings, Computer Recreations, Scientific American, Nov: 19-28.
11. 1984. Sharks and fish wage an ecological war on the toroidal planet Wa-Tor, Computer Recreations, Scientific American, Dec: 14-22.
12. 1985. Artificial insanity: when a schizophrenic program meets a computerized analyst, Computer Recreations, Scientific American, Jan: 14-20.
13. 1985. An expert system outperforms mere mortals as it conquers the feared dumgeons of doom, Computer Recreations, Scientific American, Feb: 18-21.
14. 1985. A Core War bestiary of viruses, worms and other threats to computer memories, Computer Recreations, Scientific American, March: 14-23.
15. 1985. Five easy pieces for a do-loop and random number generator, Computer recreations, Scientific American, April: 20-30.
16. 1985. Building computers in one dimension sheds light on irreducibly complicated phenomena, Computer Recreations, Scientific American, May:18-30.
17. 1985. Analog gadgets that solve a diversity of problems and raise an array of questions, Computer Recreations, Scientific American, June: 18-29.
18. 1985. A circuitous odyssey from Robotropolis to the electronic gates of Silicon Valley. Computer Recreations, Scientific American, July: 14-19.
19. 1985. A computer microscope zooms in for a close look at the most complicated object in mathematics, Computer Recreations,Scientific American, Aug: 16-24.
20. 1985. At Bell Labs work is play and terminal deseases are benign, Computer Recreations, Scientific American, Sept: 18-24.
21. 1985. Bill's baffling burr, Coffin's cornucopia, Engel's enigma, Computer Recreations, Scientific American, Oct: 16-28.
22. 1985. Exploring the field of genetic algorithms in a primordial computer sea full of flibs, Computer Recreations, Scientific American, Nov: 21-32.
23. 1985. The search for an invisible ruler that will help radio astronomers measure the Earth, Computer Recreations, Scientific American, Dec: 16-26.
24. 1986. How close encounters with star clusters are achieved with a computer telescope, Computer Recreations, Scientific American, Jan: 16-25.
25. 1986. The King (a chess program) is dead, long live the King (a chess machine), Computer Recreations, Scientific American, Feb: 13-21.
26. 1986. How a pair of dull-witted programs can look like geniuses on IQ tests, Computer Recreations, Scientific American, March: 14-21.
27. 1986. A program for rotating four-dimensional hypercubes induces dimentional dimentia, Computer Recreations, Scientific American, April: 14-23.
28. 1986. Branching phylogenies of the paleozoic and the fortunes of English family names, Computer Recreations, Scientific American, May: 16-27.
29. 1986. A sublime flight of fancy over a deserted data base, Computer Recreations, Scientific American, July: 16-24.
30. 1986. Digital prestidigitation: the fine art of magic and illusion by computer, Computer Recreations, Scientific American, Aug: 17-25.
31. 1986. Wallpaper for the mind: computer images that are almost, but not quite, repetitive, Computer Recreations, Scientific American, Sept: 14-23.
32. 1986. The compleat computer caricaturist and a whimsical tour of face space, Computer Recreations, Scientific American, Oct: 20-27.
33. 1986. Star Trek emerges from the underground to a place in the home computer arcade, Computer Recreations, Scientific American, Nov: 14-17.
34. 1986. Of fractal mountains, graftal plants and other computer graphics at Pixar, Computer Recreations, Scientific American, Dec: 14-20.
35. 1987. A program called MICE nibbles its way to victory at the first Core War tournament, Computer Recreations, Scientific American, Jan: 14-20.
36. 1987. The game of Life aquires some successors in three dimensions, Computer Recreations, Scientific American, Feb: 8-13.
37. 1987. Braitenberg memoirs: vehicles for probing behavior roam a dark plain marked by lights, Computer Recreations, Scientific American, March: 16-24.
38. 1987. The sound of computing is music to the ears of some, Computer Recreations, Scientific American, April: 14-21.
39. 1987. Of bulls, bears, and programs in the pit, Computer Recreations, Scientific American, May: 16-21.
40. 1987. Algopuzzles: wherein trains of thought follow algorithmic tracks to solutions, Computer Recreations, Scientific American, June: 128-131.
41. 1987. Probing the strange attractions of chaos, Computer Recreations, Scientific American, July: 108-111.
42. 1987. Word ladders and a tower of Babel lead to computational heights defying assault, Computer Recreations, Scientific American, Aug: 108-111.
43. 1987. Divers personalities search for social equilibrium at a computer party, Computer Recreations, Scientific American, Sept: 112-117.
44. 1987. After MAD: a computer game of nuclear strategy that ends in a prisoner's dilemma, Computer Recreations, Scientific American, Oct.: 174-177.
45. 1987. Beauty and Profundity: The Mandelbrot set and a flock of its cousins called Julia, Computer Recreations, Scientific American, Nov: 140-143.
46. 1987. Simple special effects illustrate the art of converting algorithms into programs, Scientific American, Dec: 142-146.
47. 1988. Nanotechnology: wherein molecular computers control tiny circulatory submarines, Computer Recreations, Scientific American, Jan: 100-103.
48. 1988. A blind watchmaker surveys the land of biomorphs, Computer Recreations, Scientific American, Feb: 128-131.
49. 1988. A home computer laboratory in which balls become gases, liquids and critical masses, Computer Recreations, Scientific American, March: 114-117.
50. 1988. An ancient rope-and-pulley computer is unearthed in the jungle of Apraphul, Computer Recreations, Scientific American, April: 118-122.
51. 1988. The invisible professor holds a chalk-talk session on the display monitor, Computer Recreations, Scientific American, May: 118-121.
52. 1988. Imagination meets geometry in the crystalline realm of latticeworks, Computer Recreations, Scientific American, June: 120-TK.
53. 1988. How to pan for primes in numerical gravel, Computer Recreations, Scientific American, Computer Recreations, July: 120-123.
54. 1988. The hodge-podge machine makes waves, Computer Recreations, Scientific American, Aug: 104-107.
55. 1988. Old and new three-dimensonal mazes, Computer Recreations, Scientific American, Sept: 136-139.
56. 1988. On making and breaking codes: Part I, Computer Recreations, Scientific American, Oct: 136-139.
57. 1988. On making and breaking codes: Part II, Computer Recreations, Scientific American, Nov: 142-145.
58. 1988. Random walks that lead to fractal crowds, Computer Recreations, Scientific American, Dec. 1988, 116-119.
59. 1989. People puzzles: theme and variations, Computer Recreations, Scientific American, Jan: 106-109.
60. 1989. A tour of the Mandelbrot set aboard the Mandelbus, Computer Recreations, Scientific American, Feb:108-111.
61. 1989. Of worms, viruses and Core War, Computer Recreations, Scientific American, March: 110-113.
62. 1989. A matter fabricator provides matter for thought, Computer Recreations, Scientific American, April: 116-119.
63. 1989. Simulated evolution: wherein bugs learn to hunt bacteria, Computer Recreations, Scientific American, May: 138-141.
64. 1989. A potpourri of programmed prose and prosody, Computer Recreations, Scientific American, June: 122-125.
65. 1989. Catch of the day: biomorphs on Truchet tiles, served with popcorn and snails, Computer Recreations, Scientific American, July: 110-113.
66. 1989. A cellular universe of debris, droplets, defects and demons, Computer Recreations, Scientific American, Aug: 102-105.
67. 1989. Two-dimensional Turing machines and tur-mites make tracks on a plane, Computer Recreations, Scientific American, Sept: 180-182.
68. 1989. A Tinkertoy computer that plays tic-tac-toe, Computer Recreations, Scientific American, Oct:120-121.
69. 1989. A microgolf game gives professionals and amateurs an equal chance for a hole in one, Computer Recreations, Scientific American, Nov: 120-T122.
70. 1989. A Pandora's box of minds, machines and metaphysics, Computer Recreations, Scientific American, Dec: 140-142.
71. 1990. The cellular automata programs that create wireworld, rugworld and other diversions, Computer Recreations, Scientific American, Jan: 146-149.
72. 1990. Lunar infants, lotteries and meteorites expose the dangers of math abuse, Computer Recreations, Scientific American, March: 118-121.
73. 1990. How to transform flights of fancy into fractal flora or fauna, Computer Recreations, Scientific American, May: 126-129.
74. 1990. Four fractal elements: earth, air, fire and water, Computer Adventures, Algorithm 1.4, May: 8-11.
75. 1990. An odd journey along even roads leads to home in Golygon City, Mathematical Recreations, Scientific American, July: 118-122.
76. 1990. Critical events in a computer sandpile, Computer Adventures, Algorithm 1.5 July: 7-9.
77. 1990. How to resurrect a cat from its grin, Mathematical Recreations, Scientific American, Sept: 174-177.
78. 1990. The great screensaver programming contest, Computer Adventures, Algorithm 1.6, Sept: 8-11.
79. 1990. A compendium of math abuse from around the world, Mathematical Recreations, Scientific American, Nov: 142-TK.
80. 1990. Bringing Tur-mites to life, Computer Adventures, Algorithm 1.7, Nov: 7-11.
81. 1991. Tools for computer graphics make an invisible world seem less alien, Mathematical Recreations, Scientific American, Jan: 118-121.
82. 1990. Computing with neurons, Computer Adventures, Algorithm 2.1, Jan: 8-10.
83. 1991. A menu of mathematical morsels, topological tidbits and puzzling plums, Mathematical Recreations, Scientific American, March: 116-119.
84. 1991. Hanging wallpaper for the mind, Easy Pieces, Algorithm 2.2, March: 5-7.
85. 1991. Compositions by Chaosky, Computer Adventures, Algorithm 2.2, March: 10-12.
86. 1991. The theory of rigidity, or how to brace youself against unlikely accidents, Mathematical Recreations, Scientific American, May: 126-128.
87. 1991. A computer grid illustrates social networks and epidemics, Computer Adventures, Algorithm 2.3, May: 10-12.
88. 1991. Insectoids invade a field of robots, Mathematical Recreations, Scientific American, July: 118-121.
89. 1991. Leaping into Lyapunov space, Mathematical Recreations, Scientific American, Sept: 178-180.
90. 1991. Exploring fractals, Science Probe!, Oct, 1991, 49-57, 109.
91. 1991. Macroscopic molecules and alphabets soup, Computer Adventures, Algorithm 2.4, Oct: 10-13.
92. 1992. Passing for human, Science and the Citizen, Scientific American, Jan: 31-32.
93. 1992. Could M. V. Shaney win the Loebner prize? Computer Adventures, Algorithm 3.1, Jan: 12-14.
94. 1992. On weather in a jar and water wheels, Computer Recreations, Algorithm 3.2, April: 10-12.
95. 1992. Fossil statistics, forecasting the forecaster, and the Galilean cannon, Genesis, Science Probe!, July: 97-100.
96. 1992. Tree Enterprise, Planting a backyard forest then giving it away, Harrowsmith, Oct: 64-69.
97. 1992. Programming a Neural Net; Computer Recreations, Algorithm 3,4, Oct: 11-15.
97. 1992. From the Speed of Light to the World of Numbers; Genesis, Science Probe!, Nov: 109-112.
98. 1993. An avalanche of Words on the Subject of Programming; Computer
Recreations, Algorithm 4.1, Jan: 13-17.
2. The Armchair Universe, W. H. Freeman, New York, 1988.
3. The Turing Omnibus, Computer Science Press, New York, 1989.
4. The Magic Machine, W. H. Freeman, New York, 1990.
5. 200 Percent of Nothing, John Wiley & Sons, New York, 1993
6. The New Turing Omnibus, Computer Science Press, New York, 1993.
7. The Tinkertoy Computer and Other Machinations, W. H. Freeman, New York, 1993.
8. Introductory Computer Science, Computer Science Press. New
York, 1996.
9. Yes, We Have No Neutrons : An Eye-Opening Tour Through the Twists and Turns of Bad Science, John Wiley & Sons, New York, 1997.
10. Hungry Hollow: The Story of a Natural Place, Copernicus/Springer, New York, 1998.
11. A Mathematical Mystery Tour. John Wiley & sons, New York, 1999.
12. Beyond Reason. John Wiley & Sons, New York, 2004.
2. The Book of Gables, private publication of lithographs (25 copies),
London, Ont. 1961.
3. Houses of London, private publication of lithographs (30 copies),
London, Ont. 1962.
4. The slaughterhouse, Alphabet, 1962.
5. The Snowflake, (unpublished novel), Ann Arbor, Mich. 1967, winner
of the Hopwood Award for Novels, 1967.
6. Garlic and Onions: an Account of Travels in the Middle East, private publication (12 copies), London, Ont. 1974.
7. Two-dimensional Science and Technology, 1st ed. private publication
(100 copies), London, Ontario, 1979.
8. Two-dimensional Science and Technology, 2nd ed. private publication
(500 copies), London, Ont. 1980.
9. A Symposium on Two-dimensional Science and Technology, (A. K. Dewdney,
ed.) private publication (300 copies), London, Ont. 1982.
10. A Second Symposium on Two-dimensional Science and Technology, (A.
K. Dewdney & R. Lapidus, eds.) private publication (500 copies?),
London, Ont. 1983?.
11. The Donovan Jones, Algorithm 1.2, Jan. 1990.
12. The prisoner of Baghdad, Algofiction, Algorithm 1.4, May 1990.
13. Vat Man, Algofiction, Algorithm 1.5, July, 1990.
14. Programming Roger, Algofiction, Algorithm 1.7, Nov. 1990.
2. Four Girls, 3 min. B&W and colour sound, Ann Arbor, Mich. 1967.
3. The Maltese Cross Movement, 7 min B&W and colour animated and live action, Ann Arbor, Mich. 1967. winner- Canadian Artists '68 Exhibition non-narrative film category.
4. Wildwood Flower, 4 min colour sound animated and live action, London, Ont. 1973.
Current:
Ecological Society of America
Past:
American Mathematical Society
Association for Computing Machinery
British Society for the History of Mathematics
Canadian
Information Processing Society
Canadian Society for Computational
Studies in Intelligence
Society for Industrial and Applied
Mathematics
Aug. 1985-Jul. 1986
Aug. 1986-Jul. 1987
Aug. 1988-Jul.
1989
Infoquest Corp. Computer Virus Workshop, Toronto, Ont.
Dec. 1988-May 1989
IMAX film consultant, Aug 1995 to 1997
Member, Near East Cultural and Educational Foundation, Toronto, Ontario, 1983 to 2005
Editor and founder of Algorithm, a quarterly magazine of recreational programming, 1989-93.
Member, Mixedwood Plain Ecological Science Committee (Environment Canada), May 1994 to April 1998, Coordinator of MWP ESC from May 1998 to May 2000.
Member, Springwater Forest Protection Committee, Catfish Creek Conservation Authority, Aylmer, Ontario, July 1996 to July 1997.
Member, McIlwraith Field Naturalists, London, Ontario, April 1999 to present.
Member, Thames Talbot Land Trust: 2005 to present.
Chair of Stewards Committee, Newport Forest (TTLT)