68 citations · 142 across the 15 of their papers we have counts for
15 papers
Determining the group that sends each Legendre pair to an equivalent Legendre pair
Dursun Bulutoglu, Daniel Baczkowski, Joshua Yauney
In this paper we determine the structure of the group of all operations that send each Legendre pair to an equivalent Legendre pair.
Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays
Dursun Bulutoglu
We provide a method for parallelizing the branch-and-bound with isomorphism pruning algorithm developed by Margot [Symmetric ILP: Coloring and small integers, Discrete Optimization…
An Analysis of XML Compression Efficiency
Christopher James Augeri, Barry E. Mullins, Leemon C. Baird +2
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We pr…
Decimation classes of nonnegative integer vectors using multisets
Daniel M. Baczkowski, Dursun A. Bulutoglu
We describe how previously known methods for determining the number of decimation classes of density binary vectors can be extended to nonnegative integer vectors, where the ve…
A bit-parallel tabu search algorithm for finding E()-optimal and minimax-optimal supersaturated designs
Luis B. Morales, Dursun A. Bulutoglu
We prove the equivalence of two-symbol supersaturated designs (SSDs) with (even) rows, columns, , where , and…
The dimension of an orbitope based on a solution to the Legendre pair problem
Kristopher N. Kilpatrick, Dursun A. Bulutoglu
The Legendre pair problem is a particular case of a rank- semidefinite description problem that seeks to find a pair of vectors each of length s…