- CSB - MetaPress - Google - Bing - Yahoo
 | 1998 | |
|---|---|---|
| 8 |      | 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 | ||
| 7 | | 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 | ||
| 6 |  | Anna Formica, Hans Dietmar Gröger, Michele Missikoff: A Method for Inheritance Processing in Object-Oriented Databases. SEBD 1996: 139-160 |
| 1993 | ||
| 5 | | Hans Dietmar Gröger: Does Transitivity Help? On the Complexity of Poset Properties. FCT 1993: 266-278 |
| 4 | | 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) |
| 1992 | ||
| 3 | | Hans Dietmar Gröger: On the Randomized Complexity of Monotone Graph Properties. Acta Cybern. 10(3): 119-128 (1992) |
| 1991 | ||
| 2 | | Hans Dietmar Gröger: A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. FCT 1991: 220-229 |
| 1 | | Hans Dietmar Gröger, György Turán: On Linear Decision Trees Computing Boolean Functions. ICALP 1991: 707-718 |
| 1 | Anna Formica | [6] [7] [8] |
| 2 | Michele Missikoff | [6] [7] [8] |
| 3 | György Turán | [1] [4] |