| Title | Publication Date | Language | Citations |
|---|---|---|---|
| Learning Two-Tape Automata from Queries and Counterexamples | 1996/01/01 | ||
| On the Power of Generalized MOD-Classes | 1996/01/01 | ||
| Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems | 1996/01/01 | ||
| On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts | 1996/01/01 | ||
| Node Bisectors of Cayley Graphs | 1996/01/01 | ||
| Relations Between Varieties of Kolmogorov Complexities | 1996/01/01 |