default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Dür
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j18]Konrad Schwarz, Arne Dür:
Visualization of quasi-median networks. Discret. Appl. Math. 159(15): 1608-1616 (2011)- 2010
- [j17]David Geisler-Moroder
, Arne Dür:
A New Ward BRDF Model with Bounded Albedo. Comput. Graph. Forum 29(4): 1391-1398 (2010) - 2009
- [j16]David Geisler-Moroder, Arne Dür:
Color-rendering indices in global illumination methods. J. Electronic Imaging 18(4): 043015 (2009) - 2006
- [j15]Arne Dür:
An Improved Normalization for the Ward Reflectance Model. J. Graph. Tools 11(1): 51-59 (2006) - 2003
- [j14]Arne Dür, Sylvia Leimgruber:
A Practical List-Priority Algorithm for 3D Polygons. J. Graphics, GPU, & Game Tools 8(4): 25-36 (2003) - 1998
- [j13]Joachim Althaler, Arne Dür:
A Generalization of the Massey-Ding Algorithm. Appl. Algebra Eng. Commun. Comput. 9(1): 1-14 (1998) - 1996
- [j12]Joachim Althaler, Arne Dür:
Finite linear recurring sequences and homogeneous ideals. Appl. Algebra Eng. Commun. Comput. 7(5): 377-390 (1996) - 1994
- [j11]Arne Dür:
On the covering radius of Reed - Solomon codes. Discret. Math. 126(1-3): 99-105 (1994) - 1993
- [j10]Arne Dür, Johannes Grabmeier:
Applying Coding Theory to Sparse Interpolation. SIAM J. Comput. 22(4): 695-704 (1993) - [j9]Arne Dür:
Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder. IEEE Trans. Inf. Theory 39(2): 640-643 (1993) - 1992
- [j8]Arne Dür:
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes. IEEE Trans. Inf. Theory 38(2): 504-509 (1992) - 1991
- [j7]Arne Dür:
Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6. Discret. Appl. Math. 33(1-3): 95-107 (1991) - [j6]Arne Dür:
The decoding of extended Reed-Solomon codes. Discret. Math. 90(1): 21-40 (1991) - 1989
- [j5]Arne Dür:
On Computing the Canonical Form for a Binary Form of Odd Degree. J. Symb. Comput. 8(4): 327-333 (1989) - [j4]Arne Dür:
Correction to 'On the Computation of the Performance Probabilities for Block Codes with a Bounded-Distance Decoding Rule'. IEEE Trans. Inf. Theory 35(1): 211- (1989) - 1988
- [j3]Arne Dür:
On linear MDS codes of length q + 1 over GF(q) for even q. J. Comb. Theory A 49(1): 172-174 (1988) - [j2]Arne Dür:
On the computation of the performance probabilities for block codes with a bounded-distance decoding rule. IEEE Trans. Inf. Theory 34(1): 70-78 (1988) - 1987
- [j1]Arne Dür:
The automorphism groups of Reed-Solomon codes. J. Comb. Theory A 44(1): 69-82 (1987)
Conference and Workshop Papers
- 2010
- [c4]David Geisler-Moroder, Arne Dür:
Estimating Melatonin Suppression and Photosynthesis Activity in Real-World Scenes from Computer Generated Images. CGIV/MCS 2010: 346-352 - 2009
- [c3]David Geisler-Moroder, Arne Dür:
Color rendering indices in global illumination methods. Human Vision and Electronic Imaging 2009: 72401 - 1987
- [c2]Arne Dür:
On Generalized Minimum Distance Decoding. AAECC 1987: 202-215 - 1986
- [c1]Arne Dür:
The Weight Distribution of Double-Error-Correcting Goppa Codes. AAECC 1986: 29-42
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
