Jürg Nievergelt

Home * People * Jürg Nievergelt



Jürg Nievergelt, 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 and data structures, interactive systems, user interfaces, heuristic and exhaustive search, and parallel computation.

=Selected Papers=

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. Communications of the ACM, Vol. 8, No. 6

1970 ...

 * Jürg Nievergelt, Chak-Kuen Wong (1971). On Binary Search Trees. IFIP 1971
 * Jürg Nievergelt, Chak-Kuen Wong (1973). Upper Bounds for the Total Path Length of Binary Trees. Journal of the ACM, Vol. 20, No. 1
 * Jürg Nievergelt (1977). Information content of chess positions. 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. Machine Intelligence 12 (eds. Jean Hayes Michie, Donald Michie, E. Tyugu). Clarendon Press, Oxford, 1991. ISBN 0-19-853823-5.

1980 ...

 * Jürg Nievergelt (1981). Trees as Data and File Structures. CAAP 1981
 * Anders Kierulf, Ken Chen, Jürg Nievergelt (1989). Smart Game Board and Go Explorer: A Case Study in Software and Knowledge Engineering. 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. Heuristic Programming in Artificial Intelligence 1

1990 ...

 * 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). 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, pdf
 * Christoph Wirth, Jürg Nievergelt (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2
 * Jürg Nievergelt, Fabian Mäser, Bernward Mann, Karsten Roeseler, Mathias Schulze, Christoph Wirth (1999). Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander. Informatik Spektrum 22, 45-48, pdf (German)

2000 ...

 * Raimond Reichert, Jürg Nievergelt, Werner Hartmann (2000). Ein spielerischer Einstieg in die Programmierung mit Java. Informatik Spektrum 23 (2000), Nr. 5, S. 309-315 (German) » Java
 * Werner Hartmann, Jürg Nievergelt, Raimond Reichert (2001). 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, Vol. 27, No. 3, pdf

=External Links=
 * Jürg Nievergelt Homepage
 * Beats Biblionetz - Personen: Jürg Nievergelt
 * The Mathematics Genealogy Project - Jürg Nievergelt

=References=

Up one level