Results 1  10
of
8,084
Generating Necklaces
, 1992
"... A kcolor, nbead necklace is an equivalence class of kary ntuples under rotation. In this paper, we analyze an algorithm due to Fredricksen, Kessler, and Maiorana (FKM), to show that necklaces can be generated in constant amortized time. We also present a new approach to generating necklaces whic ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
A kcolor, nbead necklace is an equivalence class of kary ntuples under rotation. In this paper, we analyze an algorithm due to Fredricksen, Kessler, and Maiorana (FKM), to show that necklaces can be generated in constant amortized time. We also present a new approach to generating necklaces
Generating Necklaces and Strings with Forbidden Substrings
 in Computing and Combinatorics, Lecture Notes in Comput. Sci. 1858
"... Given a length m string f over a kary alphabet and a positive integer n, we develop efficient algorithms to generate (a) all kary strings of length n that have no substring equal to f , (b) all kary circular strings of length n that have no substring equal to f , and (c) all kary necklaces ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Given a length m string f over a kary alphabet and a positive integer n, we develop efficient algorithms to generate (a) all kary strings of length n that have no substring equal to f , (b) all kary circular strings of length n that have no substring equal to f , and (c) all kary necklaces
An Efficient Algorithm for Generating Necklaces with Fixed Density
 SIAM J. Comput
, 1999
"... A kary necklace is an equivalence class of kary strings under rotation. A necklace of fixed density is a necklace where the number of zeroes is fixed. We present a fast, simple, recursive algorithm for generating (i.e., listing) fixed density kary necklaces or aperiodic necklaces. The algorithm i ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
A kary necklace is an equivalence class of kary strings under rotation. A necklace of fixed density is a necklace where the number of zeroes is fixed. We present a fast, simple, recursive algorithm for generating (i.e., listing) fixed density kary necklaces or aperiodic necklaces. The algorithm
A New Algorithm for Generating Necklaces (Extended Abstract)
, 1990
"... Terry MinYih Wang Carla D. Savage Department of Computer Science North Carolina State University Raleigh, North Carolina 27695 July 12, 1990 Abstract In this paper we present an algorithm for generating the lexicographically smallest representatives of all the nbead necklaces in kcolors. T ..."
Abstract
 Add to MetaCart
Terry MinYih Wang Carla D. Savage Department of Computer Science North Carolina State University Raleigh, North Carolina 27695 July 12, 1990 Abstract In this paper we present an algorithm for generating the lexicographically smallest representatives of all the nbead necklaces in k
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
, 2000
"... this paper ## Sawada 23 developed an algorithm to generate kary bracelets in constant ## amortized time. Proskurowski et al. 17 show that the orbits of the ' Z. Z. Z . composition of b and d can be generated in amortized Oktime, which is CAT if k is fixed. It remains an interesting challenge ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
this paper ## Sawada 23 developed an algorithm to generate kary bracelets in constant ## amortized time. Proskurowski et al. 17 show that the orbits of the ' Z. Z. Z . composition of b and d can be generated in amortized Oktime, which is CAT if k is fixed. It remains an interesting challenge
Generating Lyndon brackets. An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2
 J. Algorithms
"... and irreducible polynomials over GF(2) ..."
A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity
 JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY
, 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract

Cited by 615 (1 self)
 Add to MetaCart
In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are blackandwhite line drawings executed according to a set of rules that provide consistency of pictorial representation. The pictures have been standardized on four variables of central relevance to memory and cognitive processing: name agreement, image agreement, familiarity, and visual complexity. The intercorrelations among the four measures were low, suggesting that the) ' are indices of different attributes of the pictures. The concepts were selected to provide exemplars from several widely studied semantic categories. Sources of naming variance, and mean familiarity and complexity of the exemplars, differed significantly across the set of categories investigated. The potential significance of each of the normative variables to a number of semantic and episodic memory tasks is discussed.
Running Head: Generating Lyndon brackets Mail to:
, 2002
"... algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2) ..."
Abstract
 Add to MetaCart
algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)
Results 1  10
of
8,084