25,161
edits
Changes
Created page with "'''Home * People * Gunnar Andersson''' '''Gunnar Andersson''',<br/> a Swedish computer scientist and mathematician, Ph.D. from [https://en.wikipedia.org/wik..."
'''[[Main Page|Home]] * [[People]] * Gunnar Andersson'''
'''Gunnar Andersson''',<br/>
a Swedish computer scientist and mathematician, Ph.D. from [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology] in 2000 under [[Mathematician#VKann|Viggo Kann]]
on the topic of [https://en.wikipedia.org/wiki/Approximation_algorithm approximation algorithms] for [https://en.wikipedia.org/wiki/Optimization_problem optimization versions] of [https://en.wikipedia.org/wiki/NP-completeness NP-complete] [https://en.wikipedia.org/wiki/Decision_problem decision problems] <ref>[[Gunnar Andersson]] ('''2000'''). ''Some New Randomized Approximation Algorithms''. Ph.D. thesis, Department of Numerical Analysis and Computer Science, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], [http://radagast.se/thesis.pdf pdf]</ref> .
As [[Othello]] programmer, Gunnar Andersson is primary author of the strong Othello program ''Zebra''
<ref>[http://radagast.se/othello/zebra.html Zebra]</ref>
and its [[Windows]] freeware incarnation ''WZebra''
<ref>[http://radagast.se/othello/download.html Download WZebra]</ref>,
already incorporating advanced [[Bitboards|bitboard]] techniques like [[Kogge-Stone Algorithm]].
An older 2003 [[MMX]] implementation of [[Dumb7Fill]] in [[Assembly#InlineAssembly|inline assembly]] was used to determine [[Mobility|mobility]]
<ref>[http://radagast.se/othello/bitmob.c bitboard mobility] Copyright (c) 2003, [[Gunnar Andersson]]</ref>,
while the implementation by co-author [[Toshihiko Okuhara]] in ''Zebra'' looks [[Parallel Prefix Algorithms|parallel prefixed]]
<ref>bitbmob.c in [http://radagast.se/othello/zebra.tar.gz zebra.tar.gz]</ref>.
=Selected Publications=
<ref>[http://radagast.se/papers.html Gunnar Andersson, Research]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/a/Andersson:Gunnar dblp: Gunnar Andersson]</ref>
==1995 ...==
* [[Gunnar Andersson]], [https://www.mendeley.com/authors/37059608700/ Tomas Normark] ('''1995'''). ''Aggregation methods for large-scale location problems on networks''. Master's thesis, Department of Mathematics, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology]
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]] ('''1997'''). ''Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat''. [https://en.wikipedia.org/wiki/Electronic_Colloquium_on_Computational_Complexity Electronic Colloquium on Computational Complexity], Vol. 4, No. 22
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]] ('''1998'''). ''Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems''. [https://dblp.uni-trier.de/db/conf/random/random1998.html RANDOM 1998]
* [[Gunnar Andersson]], [https://dblp.org/pers/hd/f/Francis:Richard_L= Richard L. Francis], [https://www.mendeley.com/authors/37059608700/ Tomas Normark], [https://dblp.org/pers/hd/r/Rayco:M=_Brenda M. Brenda Rayco] ('''1998'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S096683499800045X?via%3Dihub Aggregation method experimentation for large-scale network location problems]''. [https://www.sciencedirect.com/journal/location-science Location Science], Vol. 6, Nos. 1–4
* [[Gunnar Andersson]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007/3-540-49116-3_22 An Approximation Algorithm for Max p-Section]''. [https://dblp.uni-trier.de/db/conf/stacs/stacs99.html STACS 1999]
==2000 ...==
* [[Gunnar Andersson]] ('''2000'''). ''Some New Randomized Approximation Algorithms''. Ph.D. thesis, Department of Numerical Analysis and Computer Science, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], advisor [[Mathematician#VKann|Viggo Kann]], [http://radagast.se/thesis.pdf pdf]
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]], [[Mathematician#JHaastad|Johan Håstad]] ('''2002'''). ''A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p''. [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], SE-100, [https://www.nada.kth.se/~johanh/e2lin2p.pdf pdf]
* [[Gunnar Andersson]], [https://dblp.uni-trier.de/pers/hd/b/Bjesse:Per Per Bjesse], [https://dblp.uni-trier.de/pers/hd/c/Cook:Byron Byron Cook], [https://dblp.uni-trier.de/pers/hd/h/Hanna:Ziyad Ziyad Hanna] ('''2002'''). ''A proof engine approach to solving combinational design automation problems''. [https://dblp.uni-trier.de/db/conf/dac/dac2002.html DAC 2002], [http://www.perbjesse.com/dac02.pdf pdf]
* [[Gunnar Andersson]], [https://dblp.uni-trier.de/pers/hd/b/Bjesse:Per Per Bjesse], [https://dblp.uni-trier.de/pers/hd/c/Cook:Byron Byron Cook], [https://dblp.uni-trier.de/pers/hd/h/Hanna:Ziyad Ziyad Hanna] ('''2003'''). ''[https://www.semanticscholar.org/paper/Design-automation-with-mixtures-of-proof-strategies-Andersson-Bjesse/432a24844eb1407bd5d68c7a1dc66909fd6f198f Design automation with mixtures of proof strategies for propositional logic]''. [[IEEE#TOCADICS|IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems]], Vol. 22, No. 8
=External Links=
* [http://radagast.se/ Gunnar Andersson's Homepage]
* [http://radagast.se/othello/ Gunnar's Othello page]
* [http://radagast.se/othello/howto.html Writing an Othello program]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=93625 Gunnar Andersson - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Andersson]]
[[Category:Othello Programmer|Andersson]]
'''Gunnar Andersson''',<br/>
a Swedish computer scientist and mathematician, Ph.D. from [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology] in 2000 under [[Mathematician#VKann|Viggo Kann]]
on the topic of [https://en.wikipedia.org/wiki/Approximation_algorithm approximation algorithms] for [https://en.wikipedia.org/wiki/Optimization_problem optimization versions] of [https://en.wikipedia.org/wiki/NP-completeness NP-complete] [https://en.wikipedia.org/wiki/Decision_problem decision problems] <ref>[[Gunnar Andersson]] ('''2000'''). ''Some New Randomized Approximation Algorithms''. Ph.D. thesis, Department of Numerical Analysis and Computer Science, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], [http://radagast.se/thesis.pdf pdf]</ref> .
As [[Othello]] programmer, Gunnar Andersson is primary author of the strong Othello program ''Zebra''
<ref>[http://radagast.se/othello/zebra.html Zebra]</ref>
and its [[Windows]] freeware incarnation ''WZebra''
<ref>[http://radagast.se/othello/download.html Download WZebra]</ref>,
already incorporating advanced [[Bitboards|bitboard]] techniques like [[Kogge-Stone Algorithm]].
An older 2003 [[MMX]] implementation of [[Dumb7Fill]] in [[Assembly#InlineAssembly|inline assembly]] was used to determine [[Mobility|mobility]]
<ref>[http://radagast.se/othello/bitmob.c bitboard mobility] Copyright (c) 2003, [[Gunnar Andersson]]</ref>,
while the implementation by co-author [[Toshihiko Okuhara]] in ''Zebra'' looks [[Parallel Prefix Algorithms|parallel prefixed]]
<ref>bitbmob.c in [http://radagast.se/othello/zebra.tar.gz zebra.tar.gz]</ref>.
=Selected Publications=
<ref>[http://radagast.se/papers.html Gunnar Andersson, Research]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/a/Andersson:Gunnar dblp: Gunnar Andersson]</ref>
==1995 ...==
* [[Gunnar Andersson]], [https://www.mendeley.com/authors/37059608700/ Tomas Normark] ('''1995'''). ''Aggregation methods for large-scale location problems on networks''. Master's thesis, Department of Mathematics, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology]
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]] ('''1997'''). ''Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat''. [https://en.wikipedia.org/wiki/Electronic_Colloquium_on_Computational_Complexity Electronic Colloquium on Computational Complexity], Vol. 4, No. 22
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]] ('''1998'''). ''Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems''. [https://dblp.uni-trier.de/db/conf/random/random1998.html RANDOM 1998]
* [[Gunnar Andersson]], [https://dblp.org/pers/hd/f/Francis:Richard_L= Richard L. Francis], [https://www.mendeley.com/authors/37059608700/ Tomas Normark], [https://dblp.org/pers/hd/r/Rayco:M=_Brenda M. Brenda Rayco] ('''1998'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S096683499800045X?via%3Dihub Aggregation method experimentation for large-scale network location problems]''. [https://www.sciencedirect.com/journal/location-science Location Science], Vol. 6, Nos. 1–4
* [[Gunnar Andersson]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007/3-540-49116-3_22 An Approximation Algorithm for Max p-Section]''. [https://dblp.uni-trier.de/db/conf/stacs/stacs99.html STACS 1999]
==2000 ...==
* [[Gunnar Andersson]] ('''2000'''). ''Some New Randomized Approximation Algorithms''. Ph.D. thesis, Department of Numerical Analysis and Computer Science, [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], advisor [[Mathematician#VKann|Viggo Kann]], [http://radagast.se/thesis.pdf pdf]
* [[Gunnar Andersson]], [[Mathematician#LEngebretsen|Lars Engebretsen]], [[Mathematician#JHaastad|Johan Håstad]] ('''2002'''). ''A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p''. [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology Royal Institute of Technology], SE-100, [https://www.nada.kth.se/~johanh/e2lin2p.pdf pdf]
* [[Gunnar Andersson]], [https://dblp.uni-trier.de/pers/hd/b/Bjesse:Per Per Bjesse], [https://dblp.uni-trier.de/pers/hd/c/Cook:Byron Byron Cook], [https://dblp.uni-trier.de/pers/hd/h/Hanna:Ziyad Ziyad Hanna] ('''2002'''). ''A proof engine approach to solving combinational design automation problems''. [https://dblp.uni-trier.de/db/conf/dac/dac2002.html DAC 2002], [http://www.perbjesse.com/dac02.pdf pdf]
* [[Gunnar Andersson]], [https://dblp.uni-trier.de/pers/hd/b/Bjesse:Per Per Bjesse], [https://dblp.uni-trier.de/pers/hd/c/Cook:Byron Byron Cook], [https://dblp.uni-trier.de/pers/hd/h/Hanna:Ziyad Ziyad Hanna] ('''2003'''). ''[https://www.semanticscholar.org/paper/Design-automation-with-mixtures-of-proof-strategies-Andersson-Bjesse/432a24844eb1407bd5d68c7a1dc66909fd6f198f Design automation with mixtures of proof strategies for propositional logic]''. [[IEEE#TOCADICS|IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems]], Vol. 22, No. 8
=External Links=
* [http://radagast.se/ Gunnar Andersson's Homepage]
* [http://radagast.se/othello/ Gunnar's Othello page]
* [http://radagast.se/othello/howto.html Writing an Othello program]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=93625 Gunnar Andersson - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Andersson]]
[[Category:Othello Programmer|Andersson]]
