| 2006 |
|---|
| 87 | EE | Jürg Nievergelt,
André Behr:
Die Aussagekraft von Beispielen.
Informatik Spektrum 29(4): 281-286 (2006) |
| 2005 |
|---|
| 86 | EE | Jürg Nievergelt:
Why Teach Introductory Computer Science? Reconciling Diverse Goals and Expectations.
ISSEP 2005: 92-92 |
| 2004 |
|---|
| 85 | | Yew Jin Lim,
Jürg Nievergelt:
Computing Tigers and Goats.
ICGA Journal 27(3): 131-141 (2004) |
| 2003 |
|---|
| 84 | | Markus Brändle,
Werner Hartmann,
Jürg Nievergelt,
Raimond Reichert,
Tobias Schlatter:
Kara: Ein theoriebasierter Ansatz für Lernumgebungen zu fundamentalen Konzepten der Informatik.
INFOS 2003: 201-210 |
| 83 | EE | Jürg Nievergelt:
Informatik zwischen Vision und Illusion.
Informatik Spektrum 26(6): 402-405 (2003) |
| 2002 |
|---|
| 82 | EE | Werner Hartmann,
Jürg Nievergelt:
Informatik und Bildung zwischen Wandel und Beständigkeit.
Informatik Spektrum 25(6): 465-476 (2002) |
| 2001 |
|---|
| 81 | EE | Werner Hartmann,
Jürg Nievergelt,
Raimond Reichert:
Kara, finite state machines, and the case for programming as part of general education.
HCC 2001: 135-141 |
| 80 | | Ambros Marzetta,
Jürg Nievergelt:
Enumerating the k best plane spanning trees.
Comput. Geom. 18(1): 55-64 (2001) |
| 2000 |
|---|
| 79 | EE | Jürg Nievergelt:
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power.
SOFSEM 2000: 18-35 |
| 78 | EE | Raimond Reichert,
Jürg Nievergelt,
Werner Hartmann:
Ein spielerischer Einstieg in die Programmierung mit Java, Kara to Java - erste Schritte beim Programmieren.
Informatik Spektrum 23(5): 309-315 (2000) |
| 77 | EE | Nora Sleumer,
Jürg Nievergelt:
Erfahrungen und Gedanken zur Frauenfoerderung in der Informatik.
Informatik Spektrum 23(6): 370-372 (2000) |
| 1999 |
|---|
| 76 | EE | Jürg Nievergelt,
Narsingh Deo,
Ambros Marzetta:
Memory-Efficient Enumeration of Constrained Spanning Trees.
Inf. Process. Lett. 72(1-2): 47-53 (1999) |
| 75 | EE | Jürg Nievergelt,
Fabian Mäser,
Bernward Mann,
Karsten Roeseler,
Mathias Schulze,
Christoph Wirth:
Overflow: CRASH! Mathematik und kombinatorisches Chaos prallen aufeinander.
Informatik Spektrum 22(1): 45-48 (1999) |
| 74 | EE | Jürg Nievergelt:
Zur Diskussion Gestellt: "Roboter programmieren" - ein Kinderspiel, Bewegt sich auch etwas in der Allgemeinbildung?
Informatik Spektrum 22(5): 364-375 (1999) |
| 1997 |
|---|
| 73 | | Marc J. van Kreveld,
Jürg Nievergelt,
Thomas Roos,
Peter Widmayer:
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, Udine, Italy, September 16-20, 1996
Springer 1997 |
| 1996 |
|---|
| 72 | | Jürg Nievergelt:
Introduction to Geometric Computing: From Algorithms to Software.
Algorithmic Foundations of Geographic Information Systems 1996: 1-19 |
| 71 | | Jürg Nievergelt,
Peter Widmayer:
Spatial Data Structures: Concepts and Design Choices.
Algorithmic Foundations of Geographic Information Systems 1996: 153-197 |
| 1995 |
|---|
| 70 | | Jürg Nievergelt,
Ralph Gasser,
Fabian Mäser,
Christoph Wirth:
All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?
Computer Science Today 1995: 254-274 |
| 69 | EE | Jürg Nievergelt,
Narsingh Deo:
Metric Graphs Elastically Embeddable in the Plane.
Inf. Process. Lett. 55(6): 309-315 (1995) |
| 68 | | Jürg Nievergelt:
Welchen Wert haben theoretische Grundlagen für die Berufspraxis? Gedanken zum Fundament des Informatikturms - Overflow.
Informatik Spektrum 18(6): 342-344 (1995) |
| 1994 |
|---|
| 67 | | Jürg Nievergelt,
Thomas Roos,
Hans-Jörg Schek,
Peter Widmayer:
IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings
Springer 1994 |
| 66 | | Jürg Nievergelt,
Michael Freeston:
Special Issue Editorial: Other Objects, or: What is unique about Spatial Data?
Comput. J. 37(1): 1-2 (1994) |
| 65 | | Jürg Nievergelt:
Das Go-Spiel, Mathematik und Computer - Overflow.
Informatik Spektrum 17(2): 106-110 (1994) |
| 64 | | Ralph Gasser,
Jürg Nievergelt:
Es ist entschieden: Das Mühlespiel ist unentschieden - Overflow.
Informatik Spektrum 17(5): 314-317 (1994) |
| 63 | | Jürg Nievergelt:
Complexity, Algorithms, Programs, Systems: The Shifting Focus.
J. Symb. Comput. 17(4): 297-310 (1994) |
| 1993 |
|---|
| 62 | | Jürg Nievergelt:
Exploring the Interaction between Software and Knowledge Engineering using a Computer Game-Playing Lab.
Software Engineering Education 1993: 17-28 |
| 61 | | Jürg Nievergelt:
Experiments in Computational Heuristcs and Their Lessons for Software and Knowledge Engineering.
Advances in Computers 37: 167-205 (1993) |
| 60 | | Jürg Nievergelt,
Peter Widmayer:
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects.
Comput. J. 36(2): 107-116 (1993) |
| 59 | | Jürg Nievergelt:
Was ist Informatik-Didaktik? Gedanken über die Fachkenntniss des Informatiklehrers.
Informatik Spektrum 16(1): 3-10 (1993) |
| 58 | | Jürg Nievergelt,
Peter Schorn:
Numerik des Chaos oder Chaos der Numerik? Über die Aussagekraft von Bildern - Overflow.
Informatik Spektrum 16(1): 39-41 (1993) |
| 1992 |
|---|
| 57 | | Klaus Hinrichs,
Jürg Nievergelt,
Peter Schorn:
An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems.
Acta Inf. 29(4): 383-394 (1992) |
| 56 | | Jürg Nievergelt,
J. Waldvogel:
Entscheidungsgrundlagen für die Normierung der ganzzahligen Arithmetik: Varianten der div- und mod-Operationen - Overflow.
Informatik Spektrum 15(2): 107-109 (1992) |
| 55 | | Jürg Nievergelt,
Lutz Prechelt,
Ingo Wegener:
Das Springerproblem.
Informatik Spektrum 15(3): 169-172 (1992) |
| 1991 |
|---|
| 54 | | Anders Kierulf,
Ralph Gasser,
Peter M. Geiser,
Martin Müller,
Jürg Nievergelt,
Christoph Wirth:
Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board.
Hypertext/Hypermedia 1991: 174-180 |
| 53 | | Jürg Nievergelt,
Peter Schorn,
Michele De Lorenzi,
Christoph Ammann,
Adrian Brüngger:
XYZ: A Project in Experimental Geometric Computation.
Workshop on Computational Geometry 1991: 171-186 |
| 52 | | Jürg Nievergelt:
Die fünf Grundoperationen der ganzzahligen Arithmetik und das dis-mod-Problem - Overflow.
Informatik Spektrum 14(1): 43-44 (1991) |
| 51 | | Jürg Nievergelt:
Über das div-mod-Problem und die Normierung ganzzahliger Arithmetik sowie ein Rückblick auf Zahlenkreuze - Overflow.
Informatik Spektrum 14(6): 351-354 (1991) |
| 1990 |
|---|
| 50 | | Jürg Nievergelt:
Computer Science for Teachers: A Quest for Classics and How to Present Them.
ICCAL 1990: 2-15 |
| 49 | | Anders Kierulf,
Ken Chen,
Jürg Nievergelt:
Smart Game Board and Go Explorer: A Study in Software and Knowledge Engineering.
Commun. ACM 33(2): 152-166 (1990) |
| 48 | | Jürg Nievergelt:
Schulbeispiele zur Rekursion - Overflow.
Informatik Spektrum 13(2): 106-108 (1990) |
| 47 | | Ralph Gasser,
Jürg Nievergelt:
Zur Kombinatorik von "n-in-a-row" and Blockadespielen - Overflow.
Informatik Spektrum 13(4): 221-225 (1990) |
| 46 | | Jürg Nievergelt:
Das Zahlenkreuz - Eiger-Nordwand des parallelen Rechnens? Overflow.
Informatik Spektrum 13(6): 344-346 (1990) |
| 1989 |
|---|
| 45 | EE | Jürg Nievergelt:
7 ± 2 Criteria for Assessing and Comparing Spatial data Structures.
SSD 1989: 3-27 |
| 44 | | Jørgen Staunstrup,
Jürg Nievergelt:
The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model.
Inf. Process. Lett. 30(3): 145-151 (1989) |
| 43 | | Peter Schorn,
Jürg Nievergelt:
Wie wachsen Quad-Bäume? Overflow.
Informatik Spektrum 12(2): 97-101 (1989) |
| 42 | | Jürgen F. H. Winkler,
Jürg Nievergelt:
Wie soll die Fakultätsfunktion programmiert werden? Overflow.
Informatik Spektrum 12(4): 220-221 (1989) |
| 1988 |
|---|
| 41 | | Klaus Hinrichs,
Jürg Nievergelt,
Peter Schorn:
A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited.
WG 1988: 442-457 |
| 40 | | Klaus Hinrichs,
Jürg Nievergelt,
Peter Schorn:
A Sweep Algorithm for the All-Nearest-Neighbors Problem.
Workshop on Computational Geometry 1988: 43-54 |
| 39 | | Klaus Hinrichs,
Jürg Nievergelt,
Peter Schorn:
Plane-Sweep Solves the Closest Pair Problem Elegantly.
Inf. Process. Lett. 26(5): 255-261 (1988) |
| 38 | | Jürg Nievergelt,
Peter Schorn:
Das Rätsel der verzopften Geraden - Overflow.
Informatik Spektrum 11(3): 163-165 (1988) |
| 37 | | Jürg Nievergelt,
Peter Schorn:
Geradenprobleme mit superlinearem Wachstum - Overflow.
Informatik Spektrum 11(4): 214-217 (1988) |
| 1986 |
|---|
| 36 | | Jürg Nievergelt:
Der Computer mit einem einzigen Befehl - Overflow.
Informatik Spektrum 9(3): 188 (1986) |
| 1985 |
|---|
| 35 | | Jan Stelovsky,
Jürg Nievergelt,
Hirotsugo Sugaya,
Edoardo S. Biagioni:
Can an Operating System Support Consistent User Dialogs? Experience with the Prototype XS-2.
ACM Annual Conference - The range of computing: mid-80's perspective 1985: 476-483 |
| 34 | | Jürg Nievergelt,
Klaus Hinrichs:
Storage and Access Structures for Geometric Data Bases.
FODO 1985: 441-455 |
| 33 | | David Ackermann,
Jürg Nievergelt:
Die Fünf-Finger-Maus: Eine Fallstudie zur Synthese von Hardware, Software und Psychologie.
Software-Ergonomie 1985: 376-385 |
| 32 | | Edoardo S. Biagioni,
Klaus Hinrichs,
C. Muller,
Jürg Nievergelt:
Interactive Deductive Data Management - the Smart Data Interaction Package.
Wissensbasierte Systeme 1985: 208-220 |
| 31 | | Jürg Nievergelt:
Die Flagge von Alfanumerica - Overflow.
Informatik Spektrum 8(3): 159 (1985) |
| 30 | | Jürg Nievergelt:
Die Flagge von Alfanumerica - Overflow.
Informatik Spektrum 8(5): 290 (1985) |
| 1984 |
|---|
| 29 | EE | Jürg Nievergelt,
Hans Hinterberger,
Kenneth C. Sevcik:
The Grid File: An Adaptable, Symmetric Multikey File Structure.
ACM Trans. Database Syst. 9(1): 38-71 (1984) |
| 28 | EE | A. Robin Forrest,
Leonidas J. Guibas,
Jürg Nievergelt:
Guest Editor's Introduction to Special Issue on Computational Geometry.
ACM Trans. Graph. 3(4): 241-243 (1984) |
| 27 | | Stefan Hertel,
Martti Mäntylä,
Kurt Mehlhorn,
Jürg Nievergelt:
Space Sweep Solves Intersection of Convex Polyhedra.
Acta Inf. 21: 501-519 (1984) |
| 26 | | Jürg Nievergelt:
Die n-te Generation.
Informatik Spektrum 7(4): 237-242 (1984) |
| 1983 |
|---|
| 25 | | Jürg Nievergelt:
Die Gestaltung der Mensch-Maschine-Schnittstelle.
GI Jahrestagung 1983: 41-50 |
| 24 | | Jürg Nievergelt:
Die Gestaltung der Mensch-Maschine-Schnittstelle.
Sprachen für Datenbanken 1983: 1-10 |
| 23 | | Klaus Hinrichs,
Jürg Nievergelt:
The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects.
WG 1983: 100-113 |
| 1982 |
|---|
| 22 | | Jürg Nievergelt,
Jørgen Staunstrup:
What is a Correct Behaviour of a File Under Concorrent Access?
DDB 1982: 93-103 |
| 21 | | G. Beretta,
Helmar Burkhart,
Peter Fink,
Jürg Nievergelt,
Jan Stelovsky,
Hirotsugo Sugaya:
XS-1: An Integrated Interactive System and Its Kernel.
ICSE 1982: 340-349 |
| 20 | | Jürg Nievergelt,
Franco P. Preparata:
Plane-Sweep Algorithms for Intersecting Geometric Figures.
Commun. ACM 25(10): 739-747 (1982) |
| 1981 |
|---|
| 19 | | Jürg Nievergelt:
Trees as Data and File Structures.
CAAP 1981: 35-45 |
| 18 | | Jürg Nievergelt,
Hans Hinterberger,
Kenneth C. Sevcik:
The Grid File: An Adaptable, Symmetric Multi-Key File Structure.
ECI 1981: 236-251 |
| 17 | | Bernhard Plattner,
Jürg Nievergelt:
Monitoring Program Execution: A Survey.
IEEE Computer 14(11): 76-93 (1981) |
| 1980 |
|---|
| 16 | | Jürg Nievergelt:
Computer Science Education: An Emerging Consensus on Basic Concepts.
IFIP Congress 1980: 927-933 |
| 15 | | H. Burkhardt,
Jürg Nievergelt:
Structure-oriented Editors.
Textverarbeitung und Informatik 1980: 164-181 |
| 1979 |
|---|
| 14 | EE | Ronald Fagin,
Jürg Nievergelt,
Nicholas Pippenger,
H. Raymond Strong:
Extendible Hashing - A Fast Access Method for Dynamic Files.
ACM Trans. Database Syst. 4(3): 315-344 (1979) |
| 13 | | B. Speelpenning,
Jürg Nievergelt:
A Simple Model of Processor - Resource Utilization in Networks of Communicating Modules.
IEEE Trans. Computers 28(12): 927-929 (1979) |
| 1974 |
|---|
| 12 | | Jürg Nievergelt:
Binary Search Trees and File Organisation.
ACM Comput. Surv. 6(3): 195-207 (1974) |
| 1973 |
|---|
| 11 | EE | Jürg Nievergelt,
C. K. Wong:
Upper Bounds for the Total Path Length of Binary Trees.
J. ACM 20(1): 1-6 (1973) |
| 10 | | Jürg Nievergelt,
Edward M. Reingold:
Binary Search Trees of Bounded Balance.
SIAM J. Comput. 2(1): 33-43 (1973) |
| 1972 |
|---|
| 9 | EE | Jürg Nievergelt:
Binary Search Trees and File Organization.
SIGFIDET Workshop 1972: 165-187 |
| 8 | | Jürg Nievergelt,
Edward M. Reingold:
Binary Search Trees of Bounded Balance
STOC 1972: 137-142 |
| 7 | | Jürg Nievergelt,
J. C. Farrar:
What Machines Can and Cannot Do.
ACM Comput. Surv. 4(2): 81-96 (1972) |
| 6 | | Jürg Nievergelt,
J. Pradels,
C. K. Wong,
P. C. Yue:
Bounds on the Weighted Path Length of Binary Trees.
Inf. Process. Lett. 1(6): 220-225 (1972) |
| 1971 |
|---|
| 5 | | Jürg Nievergelt,
C. K. Wong:
On Binary Search Trees.
IFIP Congress (1) 1971: 91-98 |
| 1970 |
|---|
| 4 | | Jürg Nievergelt,
M. I. Irland:
Bounce-and-Skip. A Technique for Directing the Flow of Control in Programs.
Comput. J. 13(3): 261-262 (1970) |
| 1965 |
|---|
| 3 | | Jürg Nievergelt:
Partially ordered classes of finite automata
FOCS 1965: 229-234 |
| 2 | EE | Jürg Nievergelt:
On the automatic simplification of computer programs.
Commun. ACM 8(6): 366-370 (1965) |
| 1964 |
|---|
| 1 | EE | Jürg Nievergelt:
Parallel methods for integrating ordinary differential equations.
Commun. ACM 7(12): 731-733 (1964) |
