Ian Parberry On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes. [Citation Graph (0, 0)][DBLP] Aegean Workshop on Computing, 1986, pp:296-304 [Conf]
Ian Parberry, Pei Yuan Yan Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. [Citation Graph (0, 0)][DBLP] ICPP (3), 1989, pp:226-233 [Conf]
Ian Parberry An Efficient Algorithm for the Knight's Tour Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:73, n:3, pp:251-260 [Journal]
Ian Parberry A Guide for New Referees in Theoretical Computer Science [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:112, n:1, pp:96-116 [Journal]
Ian Parberry Scalability of a neural network for the knight's tour problem. [Citation Graph (0, 0)][DBLP] Neurocomputing, 1996, v:12, n:1, pp:19-33 [Journal]
Ian Parberry On Recurrent and Recursive Interconnection Patterns. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:22, n:6, pp:285-289 [Journal]
Ian Parberry An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:6, pp:363-367 [Journal]
Ian Parberry, Pei Yuan Yan Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:1, pp:88-99 [Journal]
Ian Parberry A Note on Nondeterminism in Small, Fast Parallel Computers. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1989, v:38, n:5, pp:766-767 [Journal]
Ian Parberry On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1987, v:51, n:, pp:239-247 [Journal]
Timothy Roden, Ian Parberry Clouds and stars: efficient real-time procedural sky rendering using 3D hardware. [Citation Graph (0, 0)][DBLP] Advances in Computer Entertainment Technology, 2005, pp:434-437 [Conf]