48 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke → Informatik, Wissen, Systeme 1
zu den Filteroptionen48 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke → Informatik, Wissen, Systeme
1
Acceleration of material flow simulations
using model coarsening by token sampling and online error estimation and accumulation controlling2014
Augmented & Virtual Reality in der Produktentstehung
Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VRElektronische Ressource, Paderborn : Heinz Nixdorf Institut, Universität Paderborn, 2016Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen
Elektronische Ressource, Paderborn, 2016A comparison between two variations of a pebble game on graphs
In: Automata, languages and programming. 1973 : Graz, Austria, July 16 - 20, 1979 (Lecture notes in computer science : 71), Jg. 1979, S. 411-421A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-87Dynamics and efficiency in topological self-stabilization
Elektronische Ressource, Paderborn, 2016Efficiency of universal parallel computers
In: Acta Informatica, Jg. 19.1983, S. 269-296Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-241Efficient simulations among several models of parallel computers
In: STACS 1984, Jg. 1984, S. 218-229Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Existence and properties of pure nash equilibria in budget games
Elektronische Ressource, Paderborn, 2016Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Jg. 1985, S. 413-420Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Hashing strategies for simulating shared memory on distributed memory machines
In: Parallel architectures and their efficient use : proceedings, Jg. 1993, S. 20-29Das Heinz-Nixdorf-Institut der Universität-GH Paderborn
In: Informatik-Spektrum, Jg. 1990, S. 231-232Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2