25 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke 3
zu den Filteroptionen25 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke
3
- Alle Titel
- Klassifikation (DDC)
- Informatik, Informationswissenschaft, allgemeine Werke
- Informatik, Wissen, Systeme
- Bibliografien
- Bibliotheks- und Informationswissenschaften
- Enzyklopädien, Faktenbücher
- Zeitschriften, fortlaufende Sammelwerke
- Verbände, Organisationen, Museen
- Publizistische Medien, Journalismus, Verlagswesen
- Allgemeine Sammelwerke, Zitatensammlungen
- Handschriften, seltene Bücher
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
In: SIAM journal on algebraic and discrete methods, Jg. 7.1986 H. 4, S. 505-5122009
A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-3222009Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Jg. 18.1984, S. 239-2422009Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-1192009Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-7472009IngridKG
a FAIR knowledge graph of graffitiIn: Scientific Data, Jg. 10 H. 318, S. 1-12Elektronische Ressource, Paderborn : Universitätsbibliothek, 2023The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Jg. 8.1977, S. 371-3822009Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Jg. 1985, S. 929-9372009Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Jg. 1985, S. 195-2112009Multilingual Relation Extraction: A Survey
In: IEEE Access, Band 13 (2025), Seite 151907-151933Paderborn : Universitätsbibliothek, 2025Petri net based description, analysis and simulation of concurrent processes
In: ACM SIGDA Newsletters, Jg. 1977, S. 15-272009A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-6762009A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-742009Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-2642009