1: Efficient Computation of the Permanent of Block Factorizable Matrices
2: Learning implicitly in reasoning in PAC-Semantics
3: A dynamic data structure for counting subgraphs in sparse graphs
4: A subquadratic algorithm for computing the n-th Bernoulli number
5: In-place associative integer sorting
6: Implementing a Partitioned 2-page Book Embedding Testing Algorithm
7: A Simple Test on 2-Vertex- and 2-Edge-Connectivity
8: Streaming Algorithms for Optimal Generation of Random Bits
9: Data-Oblivious Graph Drawing Model and Algorithms
10: Ternary graph isomorphism in polynomial time, after Luks
11: Trivalent Graph isomorphism in polynomial time
12: A New Algorithm for Data Compression Optimization
13: Constrained Multilinear Detection and Generalized Graph Motifs