Hans Dietmar Gröger

According to our database, Hans Dietmar Gröger authored at least 8 papers between 1991 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

An Efficient Method for Checking Object-Oriented Database Schema Correctness.

Anna Formica, Hans Dietmar Gröger, Michele Missikoff

ACM Trans. Database Syst., 1998

1997

Object-Oriented Database Schema Analysis and Inheritance Processing: A Graphtheoretic Approach.

Anna Formica, Hans Dietmar Gröger, Michele Missikoff

Data Knowl. Eng., 1997

1996

A Method for Inheritance Processing in Object-Oriented Databases.

Anna Formica, Hans Dietmar Gröger, Michele Missikoff

Proceedings of the Atti del Quarto Convegno Nazionale su Sistemi Evoluti per Basi di Dati (4th National Conference on Advanced Database Systems), 1996

1993

A Liniear lower bound for the size of threshold circuits.

Hans Dietmar Gröger, György Turán

Bull. EATCS, 1993

Does Transitivity Help? On the Complexity of Poset Properties.

Hans Dietmar Gröger

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

On the Randomized Complexity of Monotone Graph Properties.

Hans Dietmar Gröger

Acta Cybern., 1992

1991

On Linear Decision Trees Computing Boolean Functions.

Hans Dietmar Gröger, György Turán

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity.

Hans Dietmar Gröger

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991