C2 - Ed. Board
Computational complexity of compaction to irreflexive cycles
Algebraic hierarchical graph transformation
Learning with side information: PAC learning bounds
Graph properties checkable in linear time in the number of vertices
On the design of time-stamped signatures
Branching synchronization grammars with nested tables
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Papers to Appear
C4 - TOC