Informatikwissenschaften
FB IV - Wirtschafts- und Sozialwissenschaften, Mathematik, Informatikwissenschaften / Universität Trier
- 0651/
- 0651/
Fernau, Henning
Terminal distinguishable languages.AI&M. 2000
Czap, H.; Ohly, H.-P.; Rahmstorf, G. et al.
Theorienbildung mittels Künstlich Neuronaler Netze vom Typ MLP. In: Globalisierung und WissensorganisationGlobalisierung und Wissensorganisation. Bd. Globalisierung und Wissensorganisation. Würzburg. 2000 S. 391 - 398
Keßler, Christoph W.; Keßler, C. W.; di Martino, B.
Two Program Comprehension Tools for Automatic ParallelizationIEEE Concurrency. Bd. IEEE Concurrency. IEEE Computer Society Press 2000 S. 37 - 47
Fecht, C.; Seidl, H.
A faster solver for general systems of equationsScience of computer programming. Bd. 35. H. 2. Amsterdam [u.a.]: Elsevier 1999 S. 137 - 162
Meinel, Christoph; Sack, Harald
Algorithmic considerations for [Mod2]-OBDD reorderingTrier: Univ., Mathematik/Informatik 1999 7 S. (Trierer Forschungsberichte ; Nr. 99-19)
Fernau, Henning; Niedermeier, Rolf
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.MFCS. 1999 S. 387 - 397
Althoff, Klaus-Dieter; Bergmann, Ralph; Branting, Karl
Case-Based Reasoning and Development, Third International Conference, ICCBR-99, Seeon Monastery, Germany, July 27-30, 1999, ProceedingsSpringer 1999
Fernau, Henning; Stephan, Frank
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.J. Autom. Lang. Comb. Bd. 4. H. 2. 1999 S. 117 - 142
Mundhenk, M.
Complexity of propositional proof systems: tableaux, resolution, cutting-planes11th European Summerschool on Logic, Language, and Information. 1999
Seidl, H.; Neumann, A.
Contributed Papers - Linear Logic, Mu Calculus, Concurrency - On Guarding Nested FixpointsLecture notes in computer science. Bd. 1683. Berlin: Springer 1999 S. 484 - 498