1: An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance
2: Space Lower Bounds for Online Pattern Matching
3: Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments
4: Interesting Multi-Relational Patterns
5: Fast Isomorphism Testing of Graphs with Regularly-Connected Components
6: An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
7: Space-Efficient Data-Analysis Queries on Grids
8: Optimal Bi-Valued Auctions
9: Computing hypergraph width measures exactly
10: Dynamic Range Selection in Linear Space