StringologyTimes

Data Structures and Algorithms: 2008/8/01-07

1: Finding Dense Subgraphs in G(n,1/2)
2: On the hitting times of quantum versus random walks
3: Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
4: Front Propagation with Rejuvenation in Flipping Processes
5: Twice-Ramanujan Sparsifiers
6: Computing the nucleolus of weighted voting games
7: Executable Set Theory and Arithmetic Encodings in Prolog
8: Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes
9: A Functional Hitchhiker’s Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
10: Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
11: On Complexity of Minimum Leaf Out-branching Problem