Stuart G. Hoggar

According to our database, Stuart G. Hoggar authored at least 12 papers between 1982 and 1999.

Collaborative distances:

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

1999

Making Music with Algorithms: A Case-Study System.

Kenneth B. McAlpine, Eduardo R. Miranda, Stuart G. Hoggar

Comput. Music. J., 1999

1998

Fractal Compression and the Jigsaw Property I.

Stuart G. Hoggar, Lindsey Menzies

Comput. J., 1998

1997

Weight enumerators of codes derived from polynomial product algorithms.

Stuart G. Hoggar

Discret. Math., 1997

1995

Faster fractal pictures by finite fields and far rings.

Stuart G. Hoggar, I. McFarlane

Discret. Math., 1995

1994

Optimal Drivers for the 'Random' Iteration Algorithm.

I. McFarlane, Stuart G. Hoggar

Comput. J., 1994

1992

t-Designs with general angle set.

Stuart G. Hoggar

Eur. J. Comb., 1992

Mathematics for computer graphics.

Stuart G. Hoggar

Cambridge tracts in theoretical computer science 14, Cambridge University Press, ISBN: 978-0-521-37574-0, 1992

1991

Inverse Displacement Mapping.

John W. Patterson, Stuart G. Hoggar, James R. Logie

Comput. Graph. Forum, 1991

1989

Tight 4 and 5-designs in projective spaces.

Stuart G. Hoggar

Graphs Comb., 1989

Tight t-Designs and Squarefree Integers.

Eiichi Bannai, Stuart G. Hoggar

Eur. J. Comb., 1989

1984

Parameters of t-Designs in 𝔽<i>P</i>^d-1.

Stuart G. Hoggar

Eur. J. Comb., 1984

1982

t-Designs in Projective Spaces.

Stuart G. Hoggar

Eur. J. Comb., 1982