25,161
edits
Changes
Created page with "'''Home * People * Jürg Nievergelt''' FILE:nievergelt.jpg|border|right|thumb|link=http://www.jn.inf.ethz.ch/index.html| Jürg Nievergelt <ref>[http://www..."
'''[[Main Page|Home]] * [[People]] * Jürg Nievergelt'''
[[FILE:nievergelt.jpg|border|right|thumb|link=http://www.jn.inf.ethz.ch/index.html| Jürg Nievergelt <ref>[http://www.jn.inf.ethz.ch/index.html Jürg Nievergelt Homepage]</ref> ]]
'''Jürg Nievergelt''',<br/>
a Swiss mathematician and computer scientist. Jürg Nievergelt has been full Professor of Computer Science at the [[ETH Zurich]] from 1975 until his retirement in 2003. His research interests covers [[Algorithms|algorithms]] and [[Data|data structures]], interactive systems, [https://en.wikipedia.org/wiki/User_interface user interfaces], heuristic and [[Brute-Force|exhaustive search]], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computation] <ref>[http://www.jn.inf.ethz.ch/research.html Prof. Jürg Nievergelt - Research]</ref>.
=Selected Papers=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://beat.doebe.li/bibliothek/p01118.html Beats Biblionetz - Personen: Jürg Nievergelt]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nievergelt:J=uuml=rg dblp: Jürg Nievergelt]</ref>
==1965 ...==
* [[Jürg Nievergelt]] ('''1965'''). ''Applications of automata theory to programming''. Ph.D. thesis, [[University of Illinois at Urbana-Champaign]]
* [[Jürg Nievergelt]] ('''1965'''). ''On the automatic simplification of computer programs''. [[ACM#Communications|Communications of the ACM]], Vol. 8, No. 6
==1970 ...==
* [[Jürg Nievergelt]], [[Mathematician#CKWong|Chak-Kuen Wong]] ('''1971'''). ''On Binary Search Trees''. [[Conferences#IFIP5|IFIP 1971]]
* [[Jürg Nievergelt]], [[Mathematician#CKWong|Chak-Kuen Wong]] ('''1973'''). ''Upper Bounds for the Total Path Length of Binary Trees''. [[ACM#Journal|Journal of the ACM]], Vol. 20, No. 1
* [[Jürg Nievergelt]] ('''1977'''). ''[[Workshop Chess and Mathematics#Information|Information content of chess positions]].'' [[ACM#SIG|ACM SIGART Newsletter]], Vol. 62, pp. 13-14. Reprinted as: ''Information content of chess positions: Implications for game-specific knowledge of chess players'', pp. 283-289. [http://www.doc.ic.ac.uk/~shm/MI/mi12.html Machine Intelligence 12] (eds. [[Jean Hayes Michie]], [[Donald Michie]], [http://www.cs.ioc.ee/~tyugu/ E. Tyugu]). Clarendon Press, Oxford, 1991. ISBN 0-19-853823-5.
==1980 ...==
* [[Jürg Nievergelt]] ('''1981'''). ''Trees as Data and File Structures''. [https://dblp.uni-trier.de/db/conf/caap/caap81.html CAAP 1981]
* [[Anders Kierulf]], [[Keh-Hsun Chen|Ken Chen]], [[Jürg Nievergelt]] ('''1989'''). ''Smart Game Board and Go Explorer: A Case Study in Software and Knowledge Engineering''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Anders Kierulf]], [[Jürg Nievergelt]] ('''1989'''). ''Swiss Explorer blunders its way into winning the first computer Go Olympiad''. [[1st Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 1]]
==1990 ...==
* [[Keh-Hsun Chen|Ken Chen]], [[Anders Kierulf]], [[Martin Müller]], [[Jürg Nievergelt]] ('''1990'''). ''The Design and Evolution of Go Explorer''. [[Computers, Chess, and Cognition]], pp. 271-285 » [[Go]]
* [[Jürg Nievergelt]] ('''1990'''). ''[http://beat.doebe.li/bibliothek/t02526.html Computer science for teachers]''. 3rd Intern. Conference on Computer Assisted Learning
* [[Ralph Gasser]], [[Jürg Nievergelt]] ('''1994'''). ''Es ist entschieden: Das Mühlespiel ist unentschieden''. Overflow. Informatik Spektrum, Vol. 17, No. 5 » [[Nine Men’s Morris]]
* [[Jürg Nievergelt]], [[Ralph Gasser]], [[Fabian Mäser]], [[Christoph Wirth]] ('''1995'''). ''All the Needles in a Haystack: Can Exhaustive Search Overcom Combinatorial Chaos?'' Lecture Notes in Computer Science, [http://www.cis.umassd.edu/~ivalova/Spring08/cis412/Old/NH-ESOCC.PDF pdf]
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]
* [[Jürg Nievergelt]], [[Fabian Mäser]], Bernward Mann, [http://www.math.uni-goettingen.de/roeseler/ Karsten Roeseler], [http://www.math.okstate.edu/~mschulze/ Mathias Schulze], [[Christoph Wirth]] ('''1999'''). ''Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander''. Informatik Spektrum 22, 45-48, [http://www.math.okstate.edu/~mschulze/download/crash.pdf pdf] (German)
==2000 ...==
* [http://beat.doebe.li/bibliothek/p01018.html Raimond Reichert], [[Jürg Nievergelt]], [http://beat.doebe.li/bibliothek/p00342.html Werner Hartmann] ('''2000'''). ''[http://beat.doebe.li/bibliothek/t02012.html Ein spielerischer Einstieg in die Programmierung mit Java]''. Informatik Spektrum 23 (2000), Nr. 5, S. 309-315 (German) » [[Java]]
* [http://beat.doebe.li/bibliothek/p00342.html Werner Hartmann], [[Jürg Nievergelt]], [http://beat.doebe.li/bibliothek/p01018.html Raimond Reichert] ('''2001'''). ''[http://beat.doebe.li/bibliothek/t03418.html Kara, finite state machines, and the case for programming as part of general education]''. Symposia on Human-Centric Computing Languages and Environments
* [[Yew Jin Lim]], [[Jürg Nievergelt]] ('''2004'''). ''Computing Tigers and Goats.'' [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]], [http://www.yewjin.com/storage/papers/Computing_Tigers_And_Goats.pdf pdf] <ref>[http://www.mastersgames.com/rules/tigers-goats-rules.htm Rules for Tigers and Goats]</ref> <ref>[https://en.wikipedia.org/wiki/Bagh-Chal Bagh-Chal from Wikipedia]</ref>
=External Links=
* [http://www.jn.inf.ethz.ch/index.html Jürg Nievergelt Homepage]
* [http://beat.doebe.li/bibliothek/p01118.html Beats Biblionetz - Personen: Jürg Nievergelt]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=812 The Mathematics Genealogy Project - Jürg Nievergelt]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:nievergelt.jpg|border|right|thumb|link=http://www.jn.inf.ethz.ch/index.html| Jürg Nievergelt <ref>[http://www.jn.inf.ethz.ch/index.html Jürg Nievergelt Homepage]</ref> ]]
'''Jürg Nievergelt''',<br/>
a Swiss mathematician and computer scientist. Jürg Nievergelt has been full Professor of Computer Science at the [[ETH Zurich]] from 1975 until his retirement in 2003. His research interests covers [[Algorithms|algorithms]] and [[Data|data structures]], interactive systems, [https://en.wikipedia.org/wiki/User_interface user interfaces], heuristic and [[Brute-Force|exhaustive search]], and [https://en.wikipedia.org/wiki/Parallel_computing parallel computation] <ref>[http://www.jn.inf.ethz.ch/research.html Prof. Jürg Nievergelt - Research]</ref>.
=Selected Papers=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://beat.doebe.li/bibliothek/p01118.html Beats Biblionetz - Personen: Jürg Nievergelt]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nievergelt:J=uuml=rg dblp: Jürg Nievergelt]</ref>
==1965 ...==
* [[Jürg Nievergelt]] ('''1965'''). ''Applications of automata theory to programming''. Ph.D. thesis, [[University of Illinois at Urbana-Champaign]]
* [[Jürg Nievergelt]] ('''1965'''). ''On the automatic simplification of computer programs''. [[ACM#Communications|Communications of the ACM]], Vol. 8, No. 6
==1970 ...==
* [[Jürg Nievergelt]], [[Mathematician#CKWong|Chak-Kuen Wong]] ('''1971'''). ''On Binary Search Trees''. [[Conferences#IFIP5|IFIP 1971]]
* [[Jürg Nievergelt]], [[Mathematician#CKWong|Chak-Kuen Wong]] ('''1973'''). ''Upper Bounds for the Total Path Length of Binary Trees''. [[ACM#Journal|Journal of the ACM]], Vol. 20, No. 1
* [[Jürg Nievergelt]] ('''1977'''). ''[[Workshop Chess and Mathematics#Information|Information content of chess positions]].'' [[ACM#SIG|ACM SIGART Newsletter]], Vol. 62, pp. 13-14. Reprinted as: ''Information content of chess positions: Implications for game-specific knowledge of chess players'', pp. 283-289. [http://www.doc.ic.ac.uk/~shm/MI/mi12.html Machine Intelligence 12] (eds. [[Jean Hayes Michie]], [[Donald Michie]], [http://www.cs.ioc.ee/~tyugu/ E. Tyugu]). Clarendon Press, Oxford, 1991. ISBN 0-19-853823-5.
==1980 ...==
* [[Jürg Nievergelt]] ('''1981'''). ''Trees as Data and File Structures''. [https://dblp.uni-trier.de/db/conf/caap/caap81.html CAAP 1981]
* [[Anders Kierulf]], [[Keh-Hsun Chen|Ken Chen]], [[Jürg Nievergelt]] ('''1989'''). ''Smart Game Board and Go Explorer: A Case Study in Software and Knowledge Engineering''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Anders Kierulf]], [[Jürg Nievergelt]] ('''1989'''). ''Swiss Explorer blunders its way into winning the first computer Go Olympiad''. [[1st Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 1]]
==1990 ...==
* [[Keh-Hsun Chen|Ken Chen]], [[Anders Kierulf]], [[Martin Müller]], [[Jürg Nievergelt]] ('''1990'''). ''The Design and Evolution of Go Explorer''. [[Computers, Chess, and Cognition]], pp. 271-285 » [[Go]]
* [[Jürg Nievergelt]] ('''1990'''). ''[http://beat.doebe.li/bibliothek/t02526.html Computer science for teachers]''. 3rd Intern. Conference on Computer Assisted Learning
* [[Ralph Gasser]], [[Jürg Nievergelt]] ('''1994'''). ''Es ist entschieden: Das Mühlespiel ist unentschieden''. Overflow. Informatik Spektrum, Vol. 17, No. 5 » [[Nine Men’s Morris]]
* [[Jürg Nievergelt]], [[Ralph Gasser]], [[Fabian Mäser]], [[Christoph Wirth]] ('''1995'''). ''All the Needles in a Haystack: Can Exhaustive Search Overcom Combinatorial Chaos?'' Lecture Notes in Computer Science, [http://www.cis.umassd.edu/~ivalova/Spring08/cis412/Old/NH-ESOCC.PDF pdf]
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]
* [[Jürg Nievergelt]], [[Fabian Mäser]], Bernward Mann, [http://www.math.uni-goettingen.de/roeseler/ Karsten Roeseler], [http://www.math.okstate.edu/~mschulze/ Mathias Schulze], [[Christoph Wirth]] ('''1999'''). ''Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander''. Informatik Spektrum 22, 45-48, [http://www.math.okstate.edu/~mschulze/download/crash.pdf pdf] (German)
==2000 ...==
* [http://beat.doebe.li/bibliothek/p01018.html Raimond Reichert], [[Jürg Nievergelt]], [http://beat.doebe.li/bibliothek/p00342.html Werner Hartmann] ('''2000'''). ''[http://beat.doebe.li/bibliothek/t02012.html Ein spielerischer Einstieg in die Programmierung mit Java]''. Informatik Spektrum 23 (2000), Nr. 5, S. 309-315 (German) » [[Java]]
* [http://beat.doebe.li/bibliothek/p00342.html Werner Hartmann], [[Jürg Nievergelt]], [http://beat.doebe.li/bibliothek/p01018.html Raimond Reichert] ('''2001'''). ''[http://beat.doebe.li/bibliothek/t03418.html Kara, finite state machines, and the case for programming as part of general education]''. Symposia on Human-Centric Computing Languages and Environments
* [[Yew Jin Lim]], [[Jürg Nievergelt]] ('''2004'''). ''Computing Tigers and Goats.'' [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]], [http://www.yewjin.com/storage/papers/Computing_Tigers_And_Goats.pdf pdf] <ref>[http://www.mastersgames.com/rules/tigers-goats-rules.htm Rules for Tigers and Goats]</ref> <ref>[https://en.wikipedia.org/wiki/Bagh-Chal Bagh-Chal from Wikipedia]</ref>
=External Links=
* [http://www.jn.inf.ethz.ch/index.html Jürg Nievergelt Homepage]
* [http://beat.doebe.li/bibliothek/p01118.html Beats Biblionetz - Personen: Jürg Nievergelt]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=812 The Mathematics Genealogy Project - Jürg Nievergelt]
=References=
<references />
'''[[People|Up one level]]'''
