Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hans Dietmar Gröger
1990 – 1999
- 1998
[j4]Anna Formica, Hans Dietmar Gröger, Michele Missikoff: An Efficient Method for Checking Object-Oriented Database Schema Correctness. ACM Trans. Database Syst. 23(3): 333-369 (1998)- 1997
[j3]Anna Formica, Hans Dietmar Gröger, Michele Missikoff: Object-Oriented Database Schema Analysis and Inheritance Processing: A Graphtheoretic Approach. Data Knowl. Eng. 24(2): 157-181 (1997)- 1996
[c4]Anna Formica, Hans Dietmar Gröger, Michele Missikoff: A Method for Inheritance Processing in Object-Oriented Databases. SEBD 1996: 139-160- 1993
[j2]Hans Dietmar Gröger, György Turán: A Liniear lower bound for the size of threshold circuits. Bulletin of the EATCS 50: 220-221 (1993)
[c3]Hans Dietmar Gröger: Does Transitivity Help? On the Complexity of Poset Properties. FCT 1993: 266-278- 1992
[j1]Hans Dietmar Gröger: On the Randomized Complexity of Monotone Graph Properties. Acta Cybern. 10(3): 119-128 (1992)- 1991
[c2]Hans Dietmar Gröger: A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. FCT 1991: 220-229
[c1]Hans Dietmar Gröger, György Turán: On Linear Decision Trees Computing Boolean Functions. ICALP 1991: 707-718
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:29 CET by the dblp team



