Computing and Combinatorics

Skiena XiaotieDeng WeifaLiang MichaelTrick BjarniHalldorsson ShuangLuan KlausWagner PatrickHealy CatherineMcCartin C. A. Wang JohnHine AnilNerode WenpingWang YingpingHuang OjasParekh XiaodongWu XiaohuaJia Chong-DaePark BaogangXu Ming-YangKao Jung-HeumPark YuanshengYang JochenKonemann KunsooPark DongmoZhang TableofContents ComplexityTheory Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials. . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Markus Bl ̈ aser Log-Space Constructible Universal Traversal Sequences 4. 03 for Cycles of LengthO(n ). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Michal Kouck ́ y On Universally Polynomial Context-Free Languages. . . . . . . . . . . . . . . . . . . . 21 Nicholas Tran Separating Oblivious and Non-oblivious BPs. . . . . . . . . . . . . . . . . . . . . . . . . . 28 Kazuo Iwama, Yasuo Okabe, Toshiro Takase Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. . .