Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group Z. MillerD. PritikinI. H. Sudborough OriginalPaper Pages: 551 - 572
Set-driven and rearrangement-independent learning of recursive languages S. LangeT. Zeugmann OriginalPaper Pages: 599 - 634
Lower bounds for the majority communication complexity of various graph accessibility problems C. MeinelS. Waack OriginalPaper Pages: 649 - 659