Arne Dür

According to our database1, Arne Dür authored at least 21 papers between 1986 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Visualization of quasi-median networks.
Discret. Appl. Math., 2011

2010
A New Ward BRDF Model with Bounded Albedo.
Comput. Graph. Forum, 2010

Estimating Melatonin Suppression and Photosynthesis Activity in Real-World Scenes from Computer Generated Images.
Proceedings of the 5th European Conference on Colour in Graphics, 2010

2009
Color rendering indices in global illumination methods.
Proceedings of the Human Vision and Electronic Imaging XIV, 2009

2006
An Improved Normalization for the Ward Reflectance Model.
J. Graph. Tools, 2006

2003
A Practical List-Priority Algorithm for 3D Polygons.
J. Graphics, GPU, & Game Tools, 2003

1998
A Generalization of the Massey-Ding Algorithm.
Appl. Algebra Eng. Commun. Comput., 1998

1996
Finite linear recurring sequences and homogeneous ideals.
Appl. Algebra Eng. Commun. Comput., 1996

1994
On the covering radius of Reed - Solomon codes.
Discret. Math., 1994

1993
Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder.
IEEE Trans. Inf. Theory, 1993

Applying Coding Theory to Sparse Interpolation.
SIAM J. Comput., 1993

1992
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes.
IEEE Trans. Inf. Theory, 1992

1991
The decoding of extended Reed-Solomon codes.
Discret. Math., 1991

Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6.
Discret. Appl. Math., 1991

1989
Correction to 'On the Computation of the Performance Probabilities for Block Codes with a Bounded-Distance Decoding Rule'.
IEEE Trans. Inf. Theory, 1989

On Computing the Canonical Form for a Binary Form of Odd Degree.
J. Symb. Comput., 1989

1988
On the computation of the performance probabilities for block codes with a bounded-distance decoding rule.
IEEE Trans. Inf. Theory, 1988

On linear MDS codes of length <i>q</i> + 1 over <i>GF</i>(<i>q</i>) for even <i>q</i>.
J. Comb. Theory A, 1988

1987
The automorphism groups of Reed-Solomon codes.
J. Comb. Theory A, 1987

On Generalized Minimum Distance Decoding.
Proceedings of the Applied Algebra, 1987

1986
The Weight Distribution of Double-Error-Correcting Goppa Codes.
Proceedings of the Applied Algebra, 1986


  Loading...