Sammlungen der UB Paderborn / Informatik, Wissen, Systeme [101-120]

Channel characterization in 60GHz
Dimce, Sigrid ; Dressler, Falko ; Karl, Holger
Elektronische Ressource, Paderborn, 2019
Characterizations of time-bounded computations by limited primitive recursion
Monien, Burkhard
In: Automata, languages and programming, Jg. 2.1974, S. 280-293
Classification and approximation of geometric location problems
Brauer, Sascha ; Blömer, Johannes ; Röglin, Heiko
Elektronische Ressource, Paderborn, 2019
CogniCrypt - the secure integration of cryptographic software
Stefan, Krüger ; Bodden, Eric ; Ali, Karim
Elektronische Ressource, Paderborn, 2020
Cognitive imperialism
Keil-Slawik, Reinhard
In: Stanford Humanities Review, Jg. 4.1994 H. P.1, S. 72-74
Collective graph exploration
Dynia, Mirosław
2007
Collusion-resistant cost-sharing mechanisms
design techniques, analyses, trade-offs
Schoppmann, Florian
2009
A combined simulation and optimization based method for predictive - reactive scheduling of flexible production systems subject to execution exceptions
Mahajan, Kiran R.
2007
Comparing approaches for the automatic generation of system models in generative systems engineering
Becker, Martin ; Mollahassani Madjdabadi, Damun ; Göbel, Jens Christian
In: 1st International Symposium : March 24 – 26, 2026, Heinz Nixdorf Institute, Paderborn University / is organized by the Chair for Product Creation at Heinz Nixdorf Institute ; Editors: Prof. Dr.-Ing. Iris Graessler (Paderborn University), Seite 149-158
A comparison between two variations of a pebble game on graphs
Meyer auf der Heide, Friedhelm
In: Automata, languages and programming. 1973 : Graz, Austria, July 16 - 20, 1979 (Lecture notes in computer science : 71), Jg. 1979, S. 411-421
A comparison of two variations of a pebble game on graphs
Meyer auf der Heide, Friedhelm
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322
Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks
Kolb, Christina ; Scheideler, Christian ; Meyer auf der Heide, Friedhelm
Elektronische Ressource, Paderborn, 2022
Compilation for instruction parallel processors
Kastens, Uwe
In: Compiler compilers, Jg. 1990, S. 179-192
Compiler-driven dynamic reconfiguration of architectural variants
Hußmann, Michael
2008
The complexity of embedding graphs into binary trees
Monien, Burkhard
In: Fundamentals of computation theory, Jg. 5, S. 300-309
Computational analysis and mitigation of textual media bias
Chen, Wei-Fan ; Wachsmuth, Henning ; Stein, Benno
Elektronische Ressource, Paderborn, 2024
A computationally inexpensive and flexible simulation model for molecular communication
Drees, Jan Peter ; Dressler, Falko ; Karl, Holger
Elektronische Ressource, Paderborn, 2019
Computergestützte Disposition im schienengebundenen Personentransport
ein kundenorientierter Ansatz
Biederbick, Claus
2006
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
Meyer auf der Heide, Friedhelm
In: STACS 1989, Jg. 1989, S. 181-192
Computing on encrypted data using trusted execution environments
Fischer, Andreas ; Bodden, Eric ; Kerschbaum, Florian
Elektronische Ressource, Paderborn, 2021
Gehe zu Seiten

Publizieren

Besondere Sammlungen

Digitalisierungsservice

Hilfe

Impressum

Datenschutz

Channel characterization in 60GHz

Characterizations of time-bounded computations by limited primitive recursion

Classification and approximation of geometric location problems

CogniCrypt - the secure integration of cryptographic software

Cognitive imperialism

Collective graph exploration

Collusion-resistant cost-sharing mechanisms

A combined simulation and optimization based method for predictive - reactive scheduling of flexible production systems subject to execution exceptions

Comparing approaches for the automatic generation of system models in generative systems engineering

A comparison between two variations of a pebble game on graphs

A comparison of two variations of a pebble game on graphs

Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks

Compilation for instruction parallel processors

Compiler-driven dynamic reconfiguration of architectural variants

The complexity of embedding graphs into binary trees

Computational analysis and mitigation of textual media bias

A computationally inexpensive and flexible simulation model for molecular communication

Computergestützte Disposition im schienengebundenen Personentransport

Computing minimum spanning forests on 1- and 2-dimensional processor arrays

Computing on encrypted data using trusted execution environments