Jürg Nievergelt

  • ETH Zurich, Switzerland

According to our database1, Jürg Nievergelt authored at least 104 papers between 1964 and 2006.

Collaborative distances:


IEEE Fellow

IEEE Fellow 1986, "For contributions to the field of data and file structures.".



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Die Aussagekraft von Beispielen.
Inform. Spektrum, 2006

Why Teach Introductory Computer Science? Reconciling Diverse Goals and Expectations.
Proceedings of the From Computer Literacy to Informatics Fundamentals, International Conference on Informatics in Secondary Schools, 2005

Rendering anti-aliased line segments.
Proceedings of the Computer Graphics International 2005, 2005

Computing Tigers and Goats.
J. Int. Comput. Games Assoc., 2004

Informatik zwischen Vision und Illusion.
Inform. Spektrum, 2003

Kara: Ein theoriebasierter Ansatz für Lernumgebungen zu fundamentalen Konzepten der Informatik.
Proceedings of the Informatische Fachkonzepte im Unterricht, 2003

Informatik und Bildung zwischen Wandel und Beständigkeit.
Inform. Spektrum, 2002

Enumerating the k best plane spanning trees.
Comput. Geom., 2001

Kara, finite state machines, and the case for programming as part of general education.
Proceedings of the 2002 IEEE CS International Symposium on Human-Centric Computing Languages and Environments (HCC 2001), 2001

Erfahrungen und Gedanken zur Frauenfoerderung in der Informatik.
Inform. Spektrum, 2000

Ein spielerischer Einstieg in die Programmierung mit Java, Kara to Java - erste Schritte beim Programmieren.
Inform. Spektrum, 2000

Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Spatial Data Structures: Concepts and Design Choices.
Proceedings of the Handbook of Computational Geometry, 2000

Memory-Efficient Enumeration of Constrained Spanning Trees.
Inf. Process. Lett., 1999

Overflow: CRASH! Mathematik und kombinatorisches Chaos prallen aufeinander.
Inform. Spektrum, 1999

Zur Diskussion Gestellt: "Roboter programmieren" - ein Kinderspiel, Bewegt sich auch etwas in der Allgemeinbildung?
Inform. Spektrum, 1999

Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.
J. Int. Comput. Games Assoc., 1999

The parallel search bench ZRAM and its applications.
Ann. Oper. Res., 1999

Algorithms and data structures - with applications to graphics and geometry.
vdf Lehrbuch, vdf, ISBN: 978-3-7281-2523-1, 1999

Spatial Data Structures: Concepts and Design Choices.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Introduction to Geometric Computing: From Algorithms to Software.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Metric Graphs Elastically Embeddable in the Plane.
Inf. Process. Lett., 1995

Welchen Wert haben theoretische Grundlagen für die Berufspraxis? Gedanken zum Fundament des Informatikturms - Overflow.
Inform. Spektrum, 1995

All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

Complexity, Algorithms, Programs, Systems: The Shifting Focus.
J. Symb. Comput., 1994

Das Go-Spiel, Mathematik und Computer - Overflow.
Inform. Spektrum, 1994

Es ist entschieden: Das Mühlespiel ist unentschieden - Overflow.
Inform. Spektrum, 1994

Special Issue Editorial: Other Objects, or: What is unique about Spatial Data?
Comput. J., 1994

Numerik des Chaos oder Chaos der Numerik? Über die Aussagekraft von Bildern - Overflow.
Inform. Spektrum, 1993

Was ist Informatik-Didaktik? Gedanken über die Fachkenntniss des Informatiklehrers.
Inform. Spektrum, 1993

Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects.
Comput. J., 1993

Experiments in Computational Heuristics and Their Lessons for Software and Knowledge Engineering.
Adv. Comput., 1993

Exploring the Interaction between Software and Knowledge Engineering using a Computer Game-Playing Lab.
Proceedings of the Software Engineering Education, Proceedings of the IFIP WG3.4/SEARCC (SRIG on Education and Training) Working Conference, Hong Kong, 28 September, 1993

Entscheidungsgrundlagen für die Normierung der ganzzahligen Arithmetik: Varianten der <i>div</i>- und <i>mod</i>-Operationen - Overflow.
Inform. Spektrum, 1992

Das Springerproblem.
Inform. Spektrum, 1992

An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems.
Acta Informatica, 1992

Über das div-mod-Problem und die Normierung ganzzahliger Arithmetik sowie ein Rückblick auf Zahlenkreuze - Overflow.
Inform. Spektrum, 1991

Die fünf Grundoperationen der ganzzahligen Arithmetik und das dis-mod-Problem - Overflow.
Inform. Spektrum, 1991

Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board.
Proceedings of the Hypertext/Hypermedia, 1991

XYZ: A Project in Experimental Geometric Computation.
Proceedings of the Computational Geometry, 1991

Das Zahlenkreuz - Eiger-Nordwand des parallelen Rechnens? Overflow.
Inform. Spektrum, 1990

Schulbeispiele zur Rekursion - Overflow.
Inform. Spektrum, 1990

Zur Kombinatorik von "n-in-a-row" and Blockadespielen - Overflow.
Inform. Spektrum, 1990

Smart Game Board and Go Explorer: A Study in Software and Knowledge Engineering.
Commun. ACM, 1990

Computer Science for Teachers: A Quest for Classics and How to Present Them.
Proceedings of the Computer Assisted Learning, 3rd International Conference, 1990

The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model.
Inf. Process. Lett., 1989

Wie soll die Fakultätsfunktion programmiert werden? Overflow.
Inform. Spektrum, 1989

Wie wachsen Quad-Bäume? Overflow.
Inform. Spektrum, 1989

7 ± 2 Criteria for Assessing and Comparing Spatial data Structures.
Proceedings of the Design and Implementation of Large Spatial Databases, 1989

Plane-Sweep Solves the Closest Pair Problem Elegantly.
Inf. Process. Lett., 1988

Geradenprobleme mit superlinearem Wachstum - Overflow.
Inform. Spektrum, 1988

Das Rätsel der verzopften Geraden - Overflow.
Inform. Spektrum, 1988

A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

A Sweep Algorithm for the All-Nearest-Neighbors Problem.
Proceedings of the Computational Geometry and its Applications, 1988

Der Computer mit einem einzigen Befehl - Overflow.
Inform. Spektrum, 1986

A five-key mouse with built-in dialog control.
ACM SIGCHI Bull., 1985

Die Flagge von Alfanumerica - Overflow.
Inform. Spektrum, 1985

Future Gener. Comput. Syst., 1985

Interactive Deductive Data Management - the Smart Data Interaction Package.
Proceedings of the Wissensbasierte Systeme, 1985

Die Fünf-Finger-Maus: Eine Fallstudie zur Synthese von Hardware, Software und Psychologie.
Proceedings of the Software-Ergonomie '85, 1985

Storage and Access Structures for Geometric Data Bases.
Proceedings of the Foundations of Data Organization, 1985

Can an Operating System Support Consistent User Dialogs? Experience with the Prototype XS-2.
Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

Guest Editor's Introduction to Special Issue on Computational Geometry.
ACM Trans. Graph., 1984

The Grid File: An Adaptable, Symmetric Multikey File Structure.
ACM Trans. Database Syst., 1984

A comparative study of man-machine interfaces in interactive systems.
ACM SIGCHI Bull., 1984

Die n-te Generation.
Inform. Spektrum, 1984

Computing with geometric objects.
SIGSAM Bull., 1984

Space Sweep Solves Intersection of Convex Polyhedra.
Acta Informatica, 1984

The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects.
Proceedings of the WG '83, 1983

Die Gestaltung der Mensch-Maschine-Schnittstelle.
Proceedings of the Sprachen für Datenbanken, 1983

Gestaltung interaktiver Programme - mit Anwendungsbeispielen für den Unterricht.
Teubner, ISBN: 978-3-519-02509-2, 1983

Plane-Sweep Algorithms for Intersecting Geometric Figures.
Commun. ACM, 1982

XS-1: An Integrated Interactive System and Its Kernel.
Proceedings of the Proceedings, 1982

What is a Correct Behaviour of a File Under Concorrent Access?
Proceedings of the Second International Symposium on Distributed Data Bases, 1982

Monitoring Program Execution: A Survey.
Computer, 1981

The Grid File: An Adaptable, Symmetric Multi-Key File Structure.
Proceedings of the Trends in Information Processing Systems, 1981

Trees as Data and File Structures.
Proceedings of the CAAP '81, 1981

A Pragmatic Introduction to Courseware Design.
Computer, 1980

Structure-oriented Editors.
Proceedings of the Textverarbeitung und Informatik, 1980

Computer Science Education: An Emerging Consensus on Basic Concepts.
Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

Extendible Hashing - A Fast Access Method for Dynamic Files.
ACM Trans. Database Syst., 1979

A Simple Model of Processor - Resource Utilization in Networks of Communicating Modules.
IEEE Trans. Computers, 1979

XS-0: a self-explanatory school computer.
ACM SIGCSE Bull., 1978

Information content of chess positions.
SIGART Newsl., 1977

An automatic tutor for introductory programming students.
Proceedings of the 5th SIGCSE Technical Symposium on Computer Science Education, 1975

Difference-preserving codes.
IEEE Trans. Inf. Theory, 1974

Binary Search Trees and File Organisation.
ACM Comput. Surv., 1974

From teaching-machine to automatic tutor: The changing man-machine interface.
Proceedings of the 4th SIGCSE Technical Symposium on Computer Science Education, 1974

University computer curricula.
Proceedings of the American Federation of Information Processing Societies: 1974 National Computer Conference, 1974

Binary Search Trees of Bounded Balance.
SIAM J. Comput., 1973

Upper Bounds for the Total Path Length of Binary Trees.
J. ACM, 1973

Automating introductory computer science courses.
Proceedings of the 3rd SIGCSE Technical Symposium on Computer Science Education, 1973

Bounds on the Weighted Path Length of Binary Trees.
Inf. Process. Lett., 1972

What Machines Can and Cannot Do.
ACM Comput. Surv., 1972

Binary Search Trees and File Organization.
Proceedings of 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control, Denver, Colorado, USA, November 29, 1972

On Binary Search Trees.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

On the Time Required for Timing - The Halting Problem Rephrased.
IEEE Trans. Computers, 1970

Syllabus for low level performance for the qualifying examination in computer science.
ACM SIGCSE Bull., 1970

Bounce-and-skip: a technique for directing the flow of control in programs.
ACM SIGPLAN Notices, 1969

Computer education for secondary school mathematics teachers.
ACM SIGCSE Bull., 1969

Fixed versus selfmodifying programs.
Comput. J., 1965

On the automatic simplification of computer programs.
Commun. ACM, 1965

Partially ordered classes of finite automata
Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

Parallel methods for integrating ordinary differential equations.
Commun. ACM, 1964