The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jürg Nievergelt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  84. University computer curricula. [Citation Graph (, )][DBLP]


Search in 0.121secs, Finished in 0.127secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002