Difference between revisions of "Hank Dietz"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 29: Line 29:
 
* [[Hank Dietz]], [https://dblp.uni-trier.de/pers/hd/m/Mattox:Timothy Timothy Mattox] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/11596110_9 Compiler Optimizations Using Data Compression to Decrease Address Reference Entropy]''. [https://dblp.uni-trier.de/db/conf/lcpc/lcpc2002.html LCPC 2002], [https://link.springer.com/chapter/10.1007/11596110_9 pdf]
 
* [[Hank Dietz]], [https://dblp.uni-trier.de/pers/hd/m/Mattox:Timothy Timothy Mattox] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/11596110_9 Compiler Optimizations Using Data Compression to Decrease Address Reference Entropy]''. [https://dblp.uni-trier.de/db/conf/lcpc/lcpc2002.html LCPC 2002], [https://link.springer.com/chapter/10.1007/11596110_9 pdf]
 
* [[Hank Dietz]] (ed.) ('''2003'''). ''[https://link.springer.com/book/10.1007/3-540-35767-X Languages and Compilers for Parallel Computing]''. [https://dblp.org/db/conf/lcpc/lcpc2001 LCPC 2001], Revised Papers, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2624, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
* [[Hank Dietz]] (ed.) ('''2003'''). ''[https://link.springer.com/book/10.1007/3-540-35767-X Languages and Compilers for Parallel Computing]''. [https://dblp.org/db/conf/lcpc/lcpc2001 LCPC 2001], Revised Papers, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2624, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Hank Dietz]], [https://dblp.uni-trier.de/pers/hd/y/Young:Bobby_Dalton Bobby Dalton Young] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-13374-9_5 MIMD Interpretation on a GPU]''. [https://dblp.uni-trier.de/db/conf/lcpc/lcpc2009.html LCPC 2009], [http://aggregate.org/GPUMC/mogsimlcpc09slides.pdf slides.pdf]
+
* [[Hank Dietz]], [https://dblp.uni-trier.de/pers/hd/y/Young:Bobby_Dalton Bobby Dalton Young] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-13374-9_5 MIMD Interpretation on a GPU]''. [https://dblp.uni-trier.de/db/conf/lcpc/lcpc2009.html LCPC 2009], [http://aggregate.ee.engr.uky.edu/EXHIBITS/SC09/mogsimlcpc09final.pdf pdf], [http://aggregate.org/GPUMC/mogsimlcpc09slides.pdf slides.pdf]
 
==2010 ...==
 
==2010 ...==
 
* [[Hank Dietz]] ('''2012'''). ''[https://www.spiedigitallibrary.org/conference-proceedings-of-spie/8290/1/Reprocessing-anaglyph-images/10.1117/12.912212.short?SSO=1 Reprocessing anaglyph images]''. [https://dblp.uni-trier.de/db/conf/3dica/3dip2012.html 3DIP 2012], [http://aggregate.org/DIT/SPIEEI2012/spieei2012paper.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Anaglyph_3D Anaglyph 3D from Wikipedia]</ref>
 
* [[Hank Dietz]] ('''2012'''). ''[https://www.spiedigitallibrary.org/conference-proceedings-of-spie/8290/1/Reprocessing-anaglyph-images/10.1117/12.912212.short?SSO=1 Reprocessing anaglyph images]''. [https://dblp.uni-trier.de/db/conf/3dica/3dip2012.html 3DIP 2012], [http://aggregate.org/DIT/SPIEEI2012/spieei2012paper.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Anaglyph_3D Anaglyph 3D from Wikipedia]</ref>

Latest revision as of 23:59, 20 February 2020

Home * People * Hank Dietz

Hank Dietz [1]

Henry Gordon (Hank) Dietz,
an American electrical engineer, computer scientist and professor of electrical and computer engineering at University of Kentucky in Lexington, Kentucky. His research interests include high-performance computing and parallel computing along with programming language and optimizing compiler support, computer aided instruction, and computational photography and digital imaging [2]. Along with Randell J. Fisher, Hank Dietz coined the acronym SWAR for SIMD Within A Register, and maintains the SWAR site [3] along with the collection of The Aggregate Magic Algorithms [4]. Hank Dietz is further author of the early Go playing program Jim [5].

Selected Publications

[6]

1985 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level