1: Streaming Complexity of Checking Priority Queues
2: Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
3: Testing Small Set Expansion in General Graphs
4: Balanced Allocations and Double Hashing
5: Predecessor search with distance-sensitive query time
6: Quantum binary field inversion: improved circuit depth via choice of basis representation
7: Feasible Sampling of Non-strict Turnstile Data Streams
8: Faster Deterministic Fully-Dynamic Graph Connectivity
9: On computable approximations of Landau’s constant
10: Additive Update Algorithm for Nonnegative Matrix Factorization
11: Fast Point-Feature Label Placement for Dynamic Visualizations (2007)
12: Fast Point-Feature Label Placement for Dynamic Visualizations (Thesis)
13: Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
14: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
15: Faster spectral sparsification and numerical algorithms for SDD matrices
16: Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
17: First-principles multiway spectral partitioning of graphs
18: Shattering and Compressing Networks for Centrality Analysis
19: A New Middle Path Approach For Alignements In Blast
20: Simple and Optimal Randomized Fault-Tolerant Rumor Spreading
21: Reclassification formula that provides to surpass K-means method
22: Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
23: Chernoff-Hoeffding Inequality and Applications
24: Fast Packed String Matching for Short Patterns
25: Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem
26: Comparative Analysis of dynamic graph techniques and data strucutre
27: Comparison of Advance Tree Data Structures
28: Combinatorial and Geometric Properties of Planar Laman Graphs
29: Parameterizations of Test Cover with Bounded Test Sizes