• Publications
  • Influence
The Mobius Cubes
  • P. Cull, S. M. Larson
  • Computer Science
  • The Sixth Distributed Memory Computing Conference…
  • 28 April 1991
By rearranging some of the connections in the hypercube, we obtain our Mobius cubes which have smaller distances (as measured in communication links) between processors. While the n-dimensionalExpand
  • 116
  • 16
Difference Equations: From Rabbits to Chaos
Preface * Fibonacci Numbers * Homogeneous Linear Recurrence Relations * Finite Difference Equations * Generating Functions * Nonnegative Difference Equations * Leslie's Population Matrix Model *Expand
  • 100
  • 9
Local and global stability for population models
  • P. Cull
  • Mathematics
  • Biological Cybernetics
  • 1 July 1986
In general, local stability does not imply global stability. We show that this is true even if one only considers population models.We show that a population model is globally stable if and only ifExpand
  • 57
  • 6
The Möbius Cubes
The Mobius cubes are hypercube variants that give better performance with the same number of links and processors. We show that the diameter of the Mobius cubes is about one half the diameter of theExpand
  • 121
  • 5
Computing fibonacci numbers quickly
We investigate the running time of several algorithms to compute the nth element of the Fibonacci sequence. Since the nth Fibonacci number grows exponentially with n, the number of bit operationsExpand
  • 15
  • 4
The periodic limit for the Leslie model
Abstract If adjacent fertility rates in the Leslie population model are not assumed to be strictly positive, population distributions need not converge to the so-called stable age distribution.Expand
  • 30
  • 3
Perfect codes on graphs
  • P. Cull
  • Computer Science
  • Proceedings of IEEE International Symposium on…
  • 29 June 1997
The set of codewords for a standard error-correcting code can be viewed as a subset of the vertices of a hypercube. Two vertices are adjacent in a hypercube exactly when their Hamming distance is 1.Expand
  • 55
  • 2
Error-correcting codes on the towers of Hanoi graphs
Abstract A perfect one-error-correcting code on a graph is a subset of the vertices so that no two vertices in the subset are adjacent and each vertex not in the subset is adjacent to exactly oneExpand
  • 45
  • 2
Exact learning of tree patterns from queries and counterexamples
We consider learning tree patterns from queries. The instances are ordered and unordered trees with nodes labeled by constant identifiers. The concepts are tree patterns and unions of tree patternsExpand
  • 25
  • 2
Exact learning of unordered tree patterns from queries
We consider learning tree patterns from queries extending our preceding work [Amoth, Cull, & Tadepalli, 1998]. The instances in this paper are unordered trees with nodes labeled by constantExpand
  • 29
  • 2
  • PDF