Jürg Nievergelt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 107

2006

Die Aussagekraft von BeispielenJürg Nievergelt, André Behr. insk, 29(4):281-286, 2006. [doi]

2005

Why Teach Introductory Computer Science? Reconciling Diverse Goals and ExpectationsJürg Nievergelt. issep 2005: 92-92 [doi]

Rendering anti-aliased line segmentsKeen-Han Wong, Xin Ouyang, Chi-Wan Lim, Tiow Seng Tan, Jürg Nievergelt. cgi 2005: 198-205 [doi]

2004

Computing Tigers and GoatsYew Jin Lim, Jürg Nievergelt. icga, 27(3):131-141, 2004.

2003

Kara: Ein theoriebasierter Ansatz für Lernumgebungen zu fundamentalen Konzepten der InformatikMarkus Brändle, Werner Hartmann, Jürg Nievergelt, Raimond Reichert, Tobias Schlatter. schule 2003: 201-210

Informatik zwischen Vision und IllusionJürg Nievergelt. insk, 26(6):402-405, 2003. [doi]

2002

Informatik und Bildung zwischen Wandel und BeständigkeitWerner Hartmann, Jürg Nievergelt. insk, 25(6):465-476, 2002. [doi]

2001

Kara, finite state machines, and the case for programming as part of general educationWerner Hartmann, Jürg Nievergelt, Raimond Reichert. vl 2001: 135-141 [doi]

Enumerating the k best plane spanning treesAmbros Marzetta, Jürg Nievergelt. comgeo, 18(1):55-64, 2001.

2000

1999

The parallel search bench ZRAM and its applicationsAdrian Brüngger, Ambros Marzetta, K. Fukuda, Jürg Nievergelt. anor, 90:45-63, 1999. [doi]

Overflow: CRASH! Mathematik und kombinatorisches Chaos prallen aufeinanderJürg Nievergelt, Fabian Mäser, Bernward Mann, Karsten Roeseler, Mathias Schulze, Christoph Wirth. insk, 22(1):45-48, 1999. [doi]

Memory-Efficient Enumeration of Constrained Spanning TreesJürg Nievergelt, Narsingh Deo, Ambros Marzetta. ipl, 72(1-2):47-53, 1999. [doi]

Zur Diskussion Gestellt: Roboter programmieren - ein Kinderspiel, Bewegt sich auch etwas in der Allgemeinbildung?Jürg Nievergelt. insk, 22(5):364-375, 1999. [doi]

Algorithms and data structures - with applications to graphics and geometryJürg Nievergelt, Klaus Hinrichs. vdf Lehrbuch, vdf, 1999.

Exhaustive and Heuristic Retrograde Analysis of the KPPKP EndgameChristoph Wirth, Jürg Nievergelt. icga, 22(2):67-80, 1999. [doi]

1996

Introduction to Geometric Computing: From Algorithms to SoftwareJürg Nievergelt. cismod 1997: 1-19

Spatial Data Structures: Concepts and Design ChoicesJürg Nievergelt, Peter Widmayer. cismod 1997: 153-197

1995

Metric Graphs Elastically Embeddable in the PlaneJürg Nievergelt, Narsingh Deo. ipl, 55(6):309-315, 1995. [doi]

Welchen Wert haben theoretische Grundlagen für die Berufspraxis? Gedanken zum Fundament des Informatikturms - OverflowJürg Nievergelt. insk, 18(6):342-344, 1995.

All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?Jürg Nievergelt, Ralph Gasser, Fabian Mäser, Christoph Wirth. In Jan van Leeuwen, editor, Computer Science Today: Recent Trends and Developments. Volume 1000 of Lecture Notes in Computer Science, pages 254-274, Springer, 1995.

1994

Es ist entschieden: Das Mühlespiel ist unentschieden - OverflowRalph Gasser, Jürg Nievergelt. insk, 17(5):314-317, 1994.

Das Go-Spiel, Mathematik und Computer - OverflowJürg Nievergelt. insk, 17(2):106-110, 1994.

Special Issue Editorial: Other Objects, or: What is unique about Spatial Data?Jürg Nievergelt, Michael Freeston. cj, 37(1):1-2, 1994.

Complexity, Algorithms, Programs, Systems: The Shifting FocusJürg Nievergelt. JSC, 17(4):297-310, 1994.

1993

Exploring the Interaction between Software and Knowledge Engineering using a Computer Game-Playing LabJürg Nievergelt. ifip3-4 1993: 17-28

Numerik des Chaos oder Chaos der Numerik? Über die Aussagekraft von Bildern - OverflowJürg Nievergelt, Peter Schorn. insk, 16(1):39-41, 1993.

Was ist Informatik-Didaktik? Gedanken über die Fachkenntniss des InformatiklehrersJürg Nievergelt. insk, 16(1):3-10, 1993.

Guard Files: Stabbing and Intersection Queries on Fat Spatial ObjectsJürg Nievergelt, Peter Widmayer. cj, 36(2):107-116, 1993.

Experiments in Computational Heuristcs and Their Lessons for Software and Knowledge EngineeringJürg Nievergelt. ac, 37:167-205, 1993.

1992

An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor ProblemsKlaus Hinrichs, Jürg Nievergelt, Peter Schorn. ACTA, 29(4):383-394, 1992.

Entscheidungsgrundlagen für die Normierung der ganzzahligen Arithmetik: Varianten der ::::div::::- und ::::mod::::-Operationen - OverflowJürg Nievergelt, J. Waldvogel. insk, 15(2):107-109, 1992.

Das SpringerproblemJürg Nievergelt, Lutz Prechelt, Ingo Wegener. insk, 15(3):169-172, 1992.

1991

1990

Zur Kombinatorik von n-in-a-row and Blockadespielen - OverflowRalph Gasser, Jürg Nievergelt. insk, 13(4):221-225, 1990.

Smart Game Board and Go Explorer: A Study in Software and Knowledge EngineeringAnders Kierulf, Ken Chen, Jürg Nievergelt. CACM, 33(2):152-166, 1990.

Computer Science for Teachers: A Quest for Classics and How to Present ThemJürg Nievergelt. iccal 1990: 2-15

Schulbeispiele zur Rekursion - OverflowJürg Nievergelt. insk, 13(2):106-108, 1990.

Das Zahlenkreuz - Eiger-Nordwand des parallelen Rechnens? OverflowJürg Nievergelt. insk, 13(6):344-346, 1990.

1989

7 ± 2 Criteria for Assessing and Comparing Spatial data StructuresJürg Nievergelt. ssd 1990: 3-27 [doi]

Wie wachsen Quad-Bäume? OverflowPeter Schorn, Jürg Nievergelt. insk, 12(2):97-101, 1989.

The Behavior of Shared Objects: Concepts, Pitfalls, and a New ModelJørgen Staunstrup, Jürg Nievergelt. ipl, 30(3):145-151, 1989.

Wie soll die Fakultätsfunktion programmiert werden? OverflowJürgen F. H. Winkler, Jürg Nievergelt. insk, 12(4):220-221, 1989.

1988

1986

Der Computer mit einem einzigen Befehl - OverflowJürg Nievergelt. insk, 9(3):188, 1986.

1985

Die Fünf-Finger-Maus: Eine Fallstudie zur Synthese von Hardware, Software und PsychologieDavid Ackermann, Jürg Nievergelt. softerg 1985: 376-385

Interactive Deductive Data Management - the Smart Data Interaction PackageEdoardo S. Biagioni, Klaus Hinrichs, C. Muller, Jürg Nievergelt. wi 1985: 208-220

Die Flagge von Alfanumerica - OverflowJürg Nievergelt. insk, 8(3):159, 1985.

Die Flagge von Alfanumerica - OverflowJürg Nievergelt. insk, 8(5):290, 1985.

Storage and Access Structures for Geometric Data BasesJürg Nievergelt, Klaus Hinrichs. fodo 1985: 441-455

EditorialYutaka Ohno, Jürg Nievergelt. fgcs, 1(5):255, 1985. [doi]

A five-key mouse with built-in dialog controlKunio Ohno, Ken-ichi Fukaya, Jürg Nievergelt. sigchi, 17(1):29-34, 1985. [doi]

Can an Operating System Support Consistent User Dialogs? Experience with the Prototype XS-2Jan Stelovsky, Jürg Nievergelt, Hirotsugo Sugaya, Edoardo S. Biagioni. acm 1985: 476-483

1984

Guest Editor s Introduction to Special Issue on Computational GeometryA. Robin Forrest, Leonidas J. Guibas, Jürg Nievergelt. tog, 3(4):241-243, 1984. [doi]

Space Sweep Solves Intersection of Convex PolyhedraStefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt. ACTA, 21:501-519, 1984.

A comparative study of man-machine interfaces in interactive systemsK. Maeda, Y. Miyake, Jürg Nievergelt, Y. Saito. sigchi, 16(2):44-61, 1984. [doi]

The Grid File: An Adaptable, Symmetric Multikey File StructureJürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik. TODS, 9(1):38-71, 1984. [doi]

Die n-te GenerationJürg Nievergelt. insk, 7(4):237-242, 1984.

Computing with geometric objectsJürg Nievergelt. cca, 18(2):19, 1984. [doi]

1983

The Grid File: A Data Structure to Support Proximity Queries on Spatial ObjectsKlaus Hinrichs, Jürg Nievergelt. wg 1984: 100-113

Die Gestaltung der Mensch-Maschine-SchnittstelleJürg Nievergelt. gi 1983: 41-50

Die Gestaltung der Mensch-Maschine-SchnittstelleJürg Nievergelt. btw 1983: 1-10

Gestaltung interaktiver Programme - mit Anwendungsbeispielen für den UnterrichtJürg Nievergelt, Andrea Ventura. Teubner, 1983.

1982

XS-1: An Integrated Interactive System and Its KernelG. Beretta, Helmar Burkhart, Peter Fink, Jürg Nievergelt, Jan Stelovsky, Hirotsugo Sugaya. ICSE 1982: 340-349

Plane-Sweep Algorithms for Intersecting Geometric FiguresJürg Nievergelt, Franco P. Preparata. CACM, 25(10):739-747, 1982.

What is a Correct Behaviour of a File Under Concorrent Access?Jürg Nievergelt, Jørgen Staunstrup. ddb 1982: 93-103

1981

The Grid File: An Adaptable, Symmetric Multi-Key File StructureJürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik. eci 1981: 236-251

Trees as Data and File StructuresJürg Nievergelt. caap 1981: 35-45

Monitoring Program Execution: A SurveyBernhard Plattner, Jürg Nievergelt. Computer, 14(11):76-93, 1981.

1980

Structure-oriented EditorsH. Burkhardt, Jürg Nievergelt. ir 1980: 164-181

Computer Science Education: An Emerging Consensus on Basic ConceptsJürg Nievergelt. ifip 1980: 927-933

A Pragmatic Introduction to Courseware DesignJürg Nievergelt. Computer, 13(9):7-21, 1980. [doi]

1979

Extendible Hashing - A Fast Access Method for Dynamic FilesRonald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong. TODS, 4(3):315-344, 1979. [doi]

A Simple Model of Processor - Resource Utilization in Networks of Communicating ModulesB. Speelpenning, Jürg Nievergelt. TC, 28(12):927-929, 1979.

1978

XS-0: a self-explanatory school computerJürg Nievergelt, Hans-Peter Frei, Helmar Burkhart, C. Jacobi, Bernhard Pattner, Hirotsugo Sugaya, B. Weibel, J. Weydert. SIGCSE, 10(4):66-69, 1978. [doi]

1977

Information content of chess positionsJürg Nievergelt. sigart, 62:13-15, 1977. [doi]

1975

An automatic tutor for introductory programming studentsRonald L. Danielson, Jürg Nievergelt. sigcse 1975: 47-50 [doi]

1974

Binary Search Trees and File OrganisationJürg Nievergelt. ACM Comput. Surv., 6(3):195-207, 1974.

From teaching-machine to automatic tutor: The changing man-machine interfaceJürg Nievergelt, Thomas R. Wilcox. sigcse 1974: 46 [doi]

Difference-preserving codesFranco P. Preparata, Jürg Nievergelt. TIT, 20(5):643-649, 1974. [doi]

1973

Upper Bounds for the Total Path Length of Binary TreesJürg Nievergelt, C. K. Wong. JACM, 20(1):1-6, 1973. [doi]

Binary Search Trees of Bounded BalanceJürg Nievergelt, Edward M. Reingold. SICOMP, 2(1):33-43, 1973.

Automating introductory computer science coursesJürg Nievergelt, Edward M. Reingold. sigcse 1973: 24-25 [doi]

1972

Bounds on the Weighted Path Length of Binary TreesJürg Nievergelt, J. Pradels, C. K. Wong, P. C. Yue. ipl, 1(6):220-225, 1972.

Binary Search Trees of Bounded BalanceJürg Nievergelt, Edward M. Reingold. stoc 1972: 137-142

What Machines Can and Cannot DoJürg Nievergelt, J. C. Farrar. ACM Comput. Surv., 4(2):81-96, 1972.

Binary Search Trees and File OrganizationJürg Nievergelt. SIGMOD 1972: 165-187 [doi]

1971

On Binary Search TreesJürg Nievergelt, C. K. Wong. ifip 1971: 91-98

1970

Bounce-and-Skip. A Technique for Directing the Flow of Control in ProgramsJürg Nievergelt, M. I. Irland. cj, 13(3):261-262, 1970.

On the Time Required for Timing - The Halting Problem RephrasedJürg Nievergelt. TC, 19(5):458-459, 1970. [doi]

Sign in or sign up to see more results.

runs on WebDSL