Detail page

Media

Goethe-Universität Frankfurt am Main. Fachbereich Informatik

Interner Bericht / Fachbereich Informatik, Johann Wolfgang Goethe-Universität Frankfurt a.M.

Frankfurt, M.: [Verlag nicht ermittelbar], 1983-

Title	Interner Bericht / Fachbereich Informatik, Johann Wolfgang Goethe-Universität Frankfurt a.M.
Involved	Goethe-Universität Frankfurt am Main. Fachbereich Informatik (Verfasser)
Published	Frankfurt, M.: [Verlag nicht ermittelbar] 1983-
Publication history	Nachgewiesen 1983 - 2000,4
ISSN	1432-9611
Language	Deutsch
Country	Deutschland
Topic	Informatik
Former / later titles	Fortsetzung: Frankfurter Informatik-Berichte
Other editions	Erscheint auch als Online-Ausgabe: Interner Bericht / Fachbereich Informatik, Johann Wolfgang Goethe-Universität Frankfurt a.M. = Technical report
Record ID	016546563
In this series show all (Un)expected path lengths of assymetric binary search trees 13th International Workshop on Unification : held June 28 - 30, 1999 at the Gästehaus der J.-W.-Goethe-Universität, Frankfurt, Germany A BDD based algorithm for computation of exact fault detection probabilities A decomposition theorem for finite valued transducers and an application to the equivalence problem A flexible type extensible object relational database Wrapper architecture A genetic algorithm for variable ordering of OBDDs A memory device for sorting A note on word chains and regular languages A one-to-one correspondence between a class of leftist trees and binary trees A one-to-one correspondence between two classes of ordered trees A polynomial linear search algorithm for the n-dimensional knapsack problem A pushdown automaton or a context free grammar which is more economical? A quadratic regularity test for non-deleting macro s grammars Adding dynamic actions to LL(k) parsers Additive weights of a special class of nonuniformly distributed backtrack trees Additive weights under the balanced probability model Ambiguity for finite tree automata An algorithm for distributive unification An improved complexity hierarchy on the Boolean network complexity and formula size of Boolean functions Analysis and performance evaluation of a DBMS model Analytische und simulative Betrachtung eines Multiplexors mit Time-Out Anwendung formaler Methoden im Systementwurf : Kurzfassung der Beiträge Approximator networks and the principle of optimal information distribution Assuring type safety of object oriented languages ATTEMPTO: an experimental fault tolerant multiprocessor system Basic parallel algorithms in graph theory Best possible asymptotic bounds on the depth of monotone functions in multivalued logic Bewertung analoger und digitaler Schaltungen der Signalverarbeitung Binary search trees for d-dimensional keys Combining contextual grammars and tree adjoining grammars Concepts for the reuse of communication software Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata CPE: a calculus for proving eqivalence of expressions in a nonstrict functional language Descriptional complexity for programs Descriptional complexity of deterministic finite automata with multiple initial states Determining component based software system reliability is inherently impossible Deterministic processor scheduling with communication costs Development and management of communication software systems : European external research program (EERP), project GY-034A, 1.1.92 - 31.3.93 Die Erweiterungen der Attempto-2-Laufzeitbibliothek Die Telematik-Klassenbibliothek zur Programmierung verteilter Anwendungen in C++ Divide and conquer algorithms on the hypercube Dynamic LL(k) parsing Dynamic minimization of OKFDDs Efficiency of universal parallel computers Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams Efficient simulations among several models of parallel computers Ein Assoziativprozessor auf der Basis eines modularen vollparallelen Assoziativspeicherfeldes Ein Diagnoseverfahren für verteilte Systeme Eine konstruktive Beschreibungsmethodik für verteilte Anwendungen Embedding complete binary trees in faulty hypercubes Entwicklung von modularen Betriebssystemkernen für das ASSKO-Multi-Mikroprozessorsystem Erkennung kritischer Zustände von Patienten mit der Diagnose "Septischer Schock" mit einem RBF-Netz Every binary pattern of length six is avoidable on the two letter alphabet Exchange trees, eine Klasse binärer Suchbäume mit Worst-case-Höhe von Log(n) External multi-bracketed contextual grammars Fast FDD based minimization of generalized Reed-Muller forms Further results on leftist trees GAFAP: a linear time scheduling approach for high-level-synthesis Genetic alogrithms in computer aided design of integrated circuits Global object space : Modell und Implementation

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Interner Bericht / Fachbereich Informatik, Johann Wolfgang Goethe-Universität Frankfurt a.M.

(Un)expected path lengths of assymetric binary search trees

13th International Workshop on Unification : held June 28 - 30, 1999 at the Gästehaus der J.-W.-Goethe-Universität, Frankfurt, Germany

A BDD based algorithm for computation of exact fault detection probabilities

A decomposition theorem for finite valued transducers and an application to the equivalence problem

A flexible type extensible object relational database Wrapper architecture

A genetic algorithm for variable ordering of OBDDs

A memory device for sorting

A note on word chains and regular languages

A one-to-one correspondence between a class of leftist trees and binary trees

A one-to-one correspondence between two classes of ordered trees

A polynomial linear search algorithm for the n-dimensional knapsack problem

A pushdown automaton or a context free grammar which is more economical?

A quadratic regularity test for non-deleting macro s grammars

Adding dynamic actions to LL(k) parsers

Additive weights of a special class of nonuniformly distributed backtrack trees

Additive weights under the balanced probability model

Ambiguity for finite tree automata

An algorithm for distributive unification

An improved complexity hierarchy on the Boolean network complexity and formula size of Boolean functions

Analysis and performance evaluation of a DBMS model

Analytische und simulative Betrachtung eines Multiplexors mit Time-Out

Anwendung formaler Methoden im Systementwurf : Kurzfassung der Beiträge

Approximator networks and the principle of optimal information distribution

Assuring type safety of object oriented languages

ATTEMPTO: an experimental fault tolerant multiprocessor system

Basic parallel algorithms in graph theory

Best possible asymptotic bounds on the depth of monotone functions in multivalued logic

Bewertung analoger und digitaler Schaltungen der Signalverarbeitung

Binary search trees for d-dimensional keys

Combining contextual grammars and tree adjoining grammars

Concepts for the reuse of communication software

Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata

CPE: a calculus for proving eqivalence of expressions in a nonstrict functional language

Descriptional complexity for programs

Descriptional complexity of deterministic finite automata with multiple initial states

Determining component based software system reliability is inherently impossible

Deterministic processor scheduling with communication costs

Development and management of communication software systems : European external research program (EERP), project GY-034A, 1.1.92 - 31.3.93

Die Erweiterungen der Attempto-2-Laufzeitbibliothek

Die Telematik-Klassenbibliothek zur Programmierung verteilter Anwendungen in C++

Divide and conquer algorithms on the hypercube

Dynamic LL(k) parsing

Dynamic minimization of OKFDDs

Efficiency of universal parallel computers

Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams

Efficient simulations among several models of parallel computers

Ein Assoziativprozessor auf der Basis eines modularen vollparallelen Assoziativspeicherfeldes

Ein Diagnoseverfahren für verteilte Systeme

Eine konstruktive Beschreibungsmethodik für verteilte Anwendungen

Embedding complete binary trees in faulty hypercubes

Entwicklung von modularen Betriebssystemkernen für das ASSKO-Multi-Mikroprozessorsystem

Erkennung kritischer Zustände von Patienten mit der Diagnose "Septischer Schock" mit einem RBF-Netz

Every binary pattern of length six is avoidable on the two letter alphabet

Exchange trees, eine Klasse binärer Suchbäume mit Worst-case-Höhe von Log(n)

External multi-bracketed contextual grammars

Fast FDD based minimization of generalized Reed-Muller forms

Further results on leftist trees

GAFAP: a linear time scheduling approach for high-level-synthesis

Genetic alogrithms in computer aided design of integrated circuits

Global object space : Modell und Implementation