default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürg Nievergelt
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2006
[j69]Jürg Nievergelt, André Behr:
Die Aussagekraft von Beispielen. Inform. Spektrum 29(4): 281-286 (2006)- 2005
- [c33]Keen-Han Wong, Xin Ouyang, Chi-Wan Lim, Tiow Seng Tan, Jürg Nievergelt:
Rendering anti-aliased line segments. Computer Graphics International 2005: 198-205 - [c32]Jürg Nievergelt:
Why Teach Introductory Computer Science? Reconciling Diverse Goals and Expectations. ISSEP 2005: 92-92 - 2004
- [j68]Yew Jin Lim, Jürg Nievergelt:
Computing Tigers and Goats. J. Int. Comput. Games Assoc. 27(3): 131-141 (2004) - 2003
- [j67]Jürg Nievergelt:
Informatik zwischen Vision und Illusion. Inform. Spektrum 26(6): 402-405 (2003) - [c31]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 - 2002
- [j66]Werner Hartmann, Jürg Nievergelt:
Informatik und Bildung zwischen Wandel und Beständigkeit. Inform. Spektrum 25(6): 465-476 (2002) - 2001
- [j65]Ambros Marzetta, Jürg Nievergelt:
Enumerating the k best plane spanning trees. Comput. Geom. 18(1): 55-64 (2001) - [c30]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 - 2000
- [j64]Raimond Reichert, Jürg Nievergelt, Werner Hartmann:
Ein spielerischer Einstieg in die Programmierung mit Java, Kara to Java - erste Schritte beim Programmieren. Inform. Spektrum 23(5): 309-315 (2000) - [j63]Nora Sleumer, Jürg Nievergelt:
Erfahrungen und Gedanken zur Frauenfoerderung in der Informatik. Inform. Spektrum 23(6): 370-372 (2000) - [c29]Jürg Nievergelt:
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power. SOFSEM 2000: 18-35 - [p4]Jürg Nievergelt, Peter Widmayer:
Spatial Data Structures: Concepts and Design Choices. Handbook of Computational Geometry 2000: 725-764
1990 – 1999
- 1999
- [b2]Jürg Nievergelt, Klaus H. Hinrichs:
Algorithms and data structures - with applications to graphics and geometry. vdf Lehrbuch, vdf 1999, ISBN 978-3-7281-2523-1, pp. I-XVI, 1-350 - [j62]Adrian Brüngger, Ambros Marzetta, K. Fukuda, Jürg Nievergelt:
The parallel search bench ZRAM and its applications. Ann. Oper. Res. 90: 45-63 (1999) - [j61]Christoph Wirth, Jürg Nievergelt:
Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. J. Int. Comput. Games Assoc. 22(2): 67-80 (1999) - [j60]Jürg Nievergelt, Fabian Mäser, Bernward Mann, Karsten Roeseler, Mathias Schulze, Christoph Wirth:
Overflow: CRASH! Mathematik und kombinatorisches Chaos prallen aufeinander. Inform. Spektrum 22(1): 45-48 (1999) - [j59]Jürg Nievergelt:
Zur Diskussion Gestellt: "Roboter programmieren" - ein Kinderspiel, Bewegt sich auch etwas in der Allgemeinbildung? Inform. Spektrum 22(5): 364-375 (1999) - [j58]Jürg Nievergelt, Narsingh Deo, Ambros Marzetta:
Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72(1-2): 47-53 (1999) - 1997
- [e2]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. Lecture Notes in Computer Science 1340, Springer 1997, ISBN 3-540-63818-0 [contents] - 1996
- [p3]Jürg Nievergelt:
Introduction to Geometric Computing: From Algorithms to Software. Algorithmic Foundations of Geographic Information Systems 1996: 1-19 - [p2]Jürg Nievergelt, Peter Widmayer:
Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems 1996: 153-197 - 1995
- [j57]Jürg Nievergelt:
Welchen Wert haben theoretische Grundlagen für die Berufspraxis? Gedanken zum Fundament des Informatikturms - Overflow. Inform. Spektrum 18(6): 342-344 (1995) - [j56]Jürg Nievergelt, Narsingh Deo:
Metric Graphs Elastically Embeddable in the Plane. Inf. Process. Lett. 55(6): 309-315 (1995) - [p1]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 - 1994
- [j55]Jürg Nievergelt, Michael Freeston:
Special Issue Editorial: Other Objects, or: What is unique about Spatial Data? Comput. J. 37(1): 1-2 (1994) - [j54]Jürg Nievergelt:
Das Go-Spiel, Mathematik und Computer - Overflow. Inform. Spektrum 17(2): 106-110 (1994) - [j53]Ralph Gasser, Jürg Nievergelt:
Es ist entschieden: Das Mühlespiel ist unentschieden - Overflow. Inform. Spektrum 17(5): 314-317 (1994) - [j52]Jürg Nievergelt:
Complexity, Algorithms, Programs, Systems: The Shifting Focus. J. Symb. Comput. 17(4): 297-310 (1994) - [e1]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. Lecture Notes in Computer Science 884, Springer 1994, ISBN 3-540-58795-0 [contents] - 1993
- [j51]Jürg Nievergelt:
Experiments in Computational Heuristics and Their Lessons for Software and Knowledge Engineering. Adv. Comput. 37: 167-205 (1993) - [j50]Jürg Nievergelt, Peter Widmayer:
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Comput. J. 36(2): 107-116 (1993) - [j49]Jürg Nievergelt:
Was ist Informatik-Didaktik? Gedanken über die Fachkenntniss des Informatiklehrers. Inform. Spektrum 16(1): 3-10 (1993) - [j48]Jürg Nievergelt, Peter Schorn:
Numerik des Chaos oder Chaos der Numerik? Über die Aussagekraft von Bildern - Overflow. Inform. Spektrum 16(1): 39-41 (1993) - [c28]Jürg Nievergelt:
Exploring the Interaction between Software and Knowledge Engineering using a Computer Game-Playing Lab. Software Engineering Education 1993: 17-28 - 1992
- [j47]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems. Acta Informatica 29(4): 383-394 (1992) - [j46]Jürg Nievergelt, J. Waldvogel:
Entscheidungsgrundlagen für die Normierung der ganzzahligen Arithmetik: Varianten der div- und mod-Operationen - Overflow. Inform. Spektrum 15(2): 107-109 (1992) - [j45]Jürg Nievergelt, Lutz Prechelt, Ingo Wegener:
Das Springerproblem. Inform. Spektrum 15(3): 169-172 (1992) - 1991
- [j44]Jürg Nievergelt:
Die fünf Grundoperationen der ganzzahligen Arithmetik und das dis-mod-Problem - Overflow. Inform. Spektrum 14(1): 43-44 (1991) - [j43]Jürg Nievergelt:
Über das div-mod-Problem und die Normierung ganzzahliger Arithmetik sowie ein Rückblick auf Zahlenkreuze - Overflow. Inform. Spektrum 14(6): 351-354 (1991) - [c27]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 - [c26]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 - 1990
- [j42]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) - [j41]Jürg Nievergelt:
Schulbeispiele zur Rekursion - Overflow. Inform. Spektrum 13(2): 106-108 (1990) - [j40]Ralph Gasser, Jürg Nievergelt:
Zur Kombinatorik von "n-in-a-row" and Blockadespielen - Overflow. Inform. Spektrum 13(4): 221-225 (1990) - [j39]Jürg Nievergelt:
Das Zahlenkreuz - Eiger-Nordwand des parallelen Rechnens? Overflow. Inform. Spektrum 13(6): 344-346 (1990) - [c25]Jürg Nievergelt:
Computer Science for Teachers: A Quest for Classics and How to Present Them. ICCAL 1990: 2-15
1980 – 1989
- 1989
- [j38]Peter Schorn, Jürg Nievergelt:
Wie wachsen Quad-Bäume? Overflow. Inform. Spektrum 12(2): 97-101 (1989) - [j37]Jürgen F. H. Winkler, Jürg Nievergelt:
Wie soll die Fakultätsfunktion programmiert werden? Overflow. Inform. Spektrum 12(4): 220-221 (1989) - [j36]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) - [c24]Jürg Nievergelt:
7 ± 2 Criteria for Assessing and Comparing Spatial data Structures. SSD 1989: 3-27 - 1988
- [j35]Jürg Nievergelt, Peter Schorn:
Das Rätsel der verzopften Geraden - Overflow. Inform. Spektrum 11(3): 163-165 (1988) - [j34]Jürg Nievergelt, Peter Schorn:
Geradenprobleme mit superlinearem Wachstum - Overflow. Inform. Spektrum 11(4): 214-217 (1988) - [j33]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
Plane-Sweep Solves the Closest Pair Problem Elegantly. Inf. Process. Lett. 26(5): 255-261 (1988) - [c23]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
A Sweep Algorithm for the All-Nearest-Neighbors Problem. Workshop on Computational Geometry 1988: 43-54 - [c22]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited. WG 1988: 442-457 - 1986
- [j32]Jürg Nievergelt:
Der Computer mit einem einzigen Befehl - Overflow. Inform. Spektrum 9(3): 188 (1986) - 1985
- [j31]Yutaka Ohno, Jürg Nievergelt:
Editorial. Future Gener. Comput. Syst. 1(5): 255 (1985) - [j30]Jürg Nievergelt:
Die Flagge von Alfanumerica - Overflow. Inform. Spektrum 8(3): 159 (1985) - [j29]Jürg Nievergelt:
Die Flagge von Alfanumerica - Overflow. Inform. Spektrum 8(5): 290 (1985) - [j28]Kunio Ohno, Ken-ichi Fukaya, Jürg Nievergelt:
A five-key mouse with built-in dialog control. ACM SIGCHI Bull. 17(1): 29-34 (1985) - [c21]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 1985: 476-483 - [c20]Jürg Nievergelt, Klaus H. Hinrichs:
Storage and Access Structures for Geometric Data Bases. FODO 1985: 441-455 - [c19]David Ackermann, Jürg Nievergelt:
Die Fünf-Finger-Maus: Eine Fallstudie zur Synthese von Hardware, Software und Psychologie. Software-Ergonomie 1985: 376-385 - [c18]Edoardo S. Biagioni, Klaus H. Hinrichs, Carlo Muller, Jürg Nievergelt:
Interactive Deductive Data Management - the Smart Data Interaction Package. Wissensbasierte Systeme 1985: 208-220 - 1984
- [j27]Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt:
Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica 21: 501-519 (1984) - [j26]Jürg Nievergelt:
Computing with geometric objects. SIGSAM Bull. 18(2): 19 (1984) - [j25]Jürg Nievergelt:
Die n-te Generation. Inform. Spektrum 7(4): 237-242 (1984) - [j24]K. Maeda, Yoshio Miyake, Jürg Nievergelt, Yasuki Saito:
A comparative study of man-machine interfaces in interactive systems. ACM SIGCHI Bull. 16(2): 44-61 (1984) - [j23]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) - [j22]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) - 1983
- [b1]Jürg Nievergelt, Andrea Ventura:
Gestaltung interaktiver Programme - mit Anwendungsbeispielen für den Unterricht. Teubner 1983, ISBN 978-3-519-02509-2, pp. 1-124 - [c17]Jürg Nievergelt:
Die Gestaltung der Mensch-Maschine-Schnittstelle. Sprachen für Datenbanken 1983: 1-10 - [c16]Jürg Nievergelt:
Die Gestaltung der Mensch-Maschine-Schnittstelle. GI Jahrestagung 1983: 41-50 - [c15]Klaus H. Hinrichs, Jürg Nievergelt:
The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. WG 1983: 100-113 - 1982
- [j21]Jürg Nievergelt, Franco P. Preparata:
Plane-Sweep Algorithms for Intersecting Geometric Figures. Commun. ACM 25(10): 739-747 (1982) - [c14]Jürg Nievergelt, Jørgen Staunstrup:
What is a Correct Behaviour of a File Under Concorrent Access? DDB 1982: 93-103 - [c13]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 - 1981
- [j20]Bernhard Plattner, Jürg Nievergelt:
Monitoring Program Execution: A Survey. Computer 14(11): 76-93 (1981) - [c12]Jürg Nievergelt:
Trees as Data and File Structures. CAAP 1981: 35-45 - [c11]Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik:
The Grid File: An Adaptable, Symmetric Multi-Key File Structure. ECI 1981: 236-251 - 1980
- [j19]Jürg Nievergelt:
A Pragmatic Introduction to Courseware Design. Computer 13(9): 7-21 (1980) - [c10]Jürg Nievergelt:
Computer Science Education: An Emerging Consensus on Basic Concepts. IFIP Congress 1980: 927-933 - [c9]H. Burkhardt, Jürg Nievergelt:
Structure-oriented Editors. Textverarbeitung und Informatik 1980: 164-181
1970 – 1979
- 1979
- [j18]Bert Speelpenning, Jürg Nievergelt:
A Simple Model of Processor - Resource Utilization in Networks of Communicating Modules. IEEE Trans. Computers 28(12): 927-929 (1979) - [j17]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) - 1978
- [j16]Jürg Nievergelt, Hans-Peter Frei, Helmar Burkhart, C. Jacobi, Bernhard Plattner, Hirotsugo Sugaya, B. Weibel, J. Weydert:
XS-0: a self-explanatory school computer. ACM SIGCSE Bull. 10(4): 66-69 (1978) - 1977
- [j15]Jürg Nievergelt:
Information content of chess positions. SIGART Newsl. 62: 13-15 (1977) - 1975
- [c8]Ronald L. Danielson, Jürg Nievergelt:
An automatic tutor for introductory programming students. SIGCSE 1975: 47-50 - 1974
- [j14]Jürg Nievergelt:
Binary Search Trees and File Organisation. ACM Comput. Surv. 6(3): 195-207 (1974) - [j13]Franco P. Preparata, Jürg Nievergelt:
Difference-preserving codes. IEEE Trans. Inf. Theory 20(5): 643-649 (1974) - [c7]Dick B. Simmons, Edward J. McCluskey, Aaron Finerman, Michael L. Dertouzos, Jürg Nievergelt:
University computer curricula. AFIPS National Computer Conference 1974: 1028 - [c6]Jürg Nievergelt, Thomas R. Wilcox:
From teaching-machine to automatic tutor: The changing man-machine interface. SIGCSE 1974: 46 - 1973
- [j12]Jürg Nievergelt, C. K. Wong:
Upper Bounds for the Total Path Length of Binary Trees. J. ACM 20(1): 1-6 (1973) - [j11]Jürg Nievergelt, Edward M. Reingold:
Binary Search Trees of Bounded Balance. SIAM J. Comput. 2(1): 33-43 (1973) - [c5]Jürg Nievergelt, Edward M. Reingold:
Automating introductory computer science courses. SIGCSE 1973: 24-25 - 1972
- [j10]Jürg Nievergelt, J. C. Farrar:
What Machines Can and Cannot Do. ACM Comput. Surv. 4(2): 81-96 (1972) - [j9]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) - [c4]Jürg Nievergelt:
Binary Search Trees and File Organization. SIGFIDET Workshop 1972: 165-187 - [c3]Jürg Nievergelt, Edward M. Reingold:
Binary Search Trees of Bounded Balance. STOC 1972: 137-142 - 1971
- [c2]Jürg Nievergelt, C. K. Wong:
On Binary Search Trees. IFIP Congress (1) 1971: 91-98 - 1970
- [j8]Jürg Nievergelt, Marek I. Irland:
Bounce-and-Skip. A Technique for Directing the Flow of Control in Programs. Comput. J. 13(3): 261-262 (1970) - [j7]Jürg Nievergelt:
Syllabus for low level performance for the qualifying examination in computer science. ACM SIGCSE Bull. 2(2): 43-53 (1970) - [j6]Jürg Nievergelt:
On the Time Required for Timing - The Halting Problem Rephrased. IEEE Trans. Computers 19(5): 458-459 (1970)
1960 – 1969
- 1969
- [j5]Jürg Nievergelt, Kenneth J. Travers:
Computer education for secondary school mathematics teachers. ACM SIGCSE Bull. 1(4): 7-9 (1969) - [j4]Jürg Nievergelt, Marek I. Irland:
Bounce-and-skip: a technique for directing the flow of control in programs. ACM SIGPLAN Notices 4(5): 29-31 (1969) - 1965
- [j3]Jürg Nievergelt:
On the automatic simplification of computer programs. Commun. ACM 8(6): 366-370 (1965) - [j2]Jürg Nievergelt:
Fixed versus selfmodifying programs. Comput. J. 8(3): 244-245 (1965) - [c1]Jürg Nievergelt:
Partially ordered classes of finite automata. SWCT 1965: 229-234 - 1964
- [j1]Jürg Nievergelt:
Parallel methods for integrating ordinary differential equations. Commun. ACM 7(12): 731-733 (1964)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
