Dursun A. Bulutoglu

According to our database, Dursun A. Bulutoglu authored at least 11 papers between 2007 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays.

Dursun A. Bulutoglu

CoRR, April, 2026

2023

A bit-parallel tabu search algorithm for finding E(s²)-optimal and minimax-optimal supersaturated designs.

Luis B. Morales, Dursun A. Bulutoglu

CoRR, 2023

The dimension of an orbitope based on a solution to the Legendre pair problem.

Kristopher N. Kilpatrick, Dursun A. Bulutoglu

CoRR, 2023

A Bit-Parallel Tabu Search Algorithm for Finding E s 2 -Optimal and Minimax-Optimal Supersaturated Designs.

Luis B. Morales, Dursun A. Bulutoglu

Comput. Math. Methods, 2023

2022

Finding the dimension of a non-empty orthogonal array polytope.

Dursun A. Bulutoglu

Discret. Optim., 2022

2021

A Legendre pair of length 77 using complementary binary matrices with fixed marginals.

Jonathan S. Turner, Ilias S. Kotsireas, Dursun A. Bulutoglu, Andrew J. Geyer

Des. Codes Cryptogr., 2021

2019

Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays.

Andrew J. Geyer, Dursun A. Bulutoglu, Kenneth Joseph Ryan

Discret. Optim., 2019

2016

The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program.

David M. Arquette, Dursun A. Bulutoglu

LMS J. Comput. Math., 2016

2015

Algorithms for finding generalized minimum aberration designs.

Dursun A. Bulutoglu, Kenneth Joseph Ryan

J. Complex., 2015

2010

Minimum Aberration Fractional Factorial Designs With Large <i>N</i>.

Kenneth Joseph Ryan, Dursun A. Bulutoglu

Technometrics, 2010

2007

An analysis of XML compression efficiency.

Christopher J. Augeri, Dursun A. Bulutoglu, Barry E. Mullins, Rusty O. Baldwin, Leemon C. Baird III

Proceedings of the Workshop on Experimental Computer Science, 2007