0 Machine Learning: My Favorite Results, Directions, and Open Problems.
0 Mixing.
0 Performance Analysis of Dynamic Network Processes.
17 A Polynomial Algorithm for Recognizing Perfect Graphs.
40 On Certain Connectivity Properties of the Internet Topology.
14 Paths, Trees, and Minimum Latency Tours.
18 Approximation Algorithms for Orienteering and Discounted-Reward TSP.
35 Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
7 On the Implementation of Huge Random Objects.
32 Zero-Knowledge Sets.
25 Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography.
57 On the (In)security of the Fiat-Shamir Paradigm.
5 Locally Testable Cyclic Codes.
16 List-Decoding Using The XOR Lemma.
7 On e-Biased Generators in NC0.
11 Proving Hard-Core Predicates Using List Decoding.
25 Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model.
13 Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem.
35 Always Good Turing: Asymptotically Optimal Probability Estimation.
7 Learning DNF from Random Walks.
44 Quantum Search of Spatial Regions.
16 A Lattice Problem in Quantum NP.
9 A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.
36 Polynomial Degree vs. Quantum Query Complexity.
13 An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.
36 Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.
6 I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.
15 The Cost of Cache-Oblivious Searching.
16 Tight Lower Bounds for the Distinct Elements Problem.
9 Hardness of Approximating the Shortest Vector Problem in High Lp Norms.
12 More on Average Case vs Approximation Complexity.
27 On Worst-Case to Average-Case Reductions for NP Problems.
23 Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
17 The Resolution Complexity of Random Constraint Satisfaction Problems.
16 Algorithms and Complexity Results for #SAT and Bayesian Inference.
11 Linear Upper Bounds for Random Walk on Small Density Random 3-CNF.
10 On the Maximum Satisfiability of Random Formulas.
32 Logics for Reasoning about Cryptographic Constructions.
13 Lower Bounds for Non-Black-Box Zero Knowledge.
27 General Composition and Universal Composability in Secure Multi-Party Computation.
23 Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.
15 Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m<sup>1.31</sup>).
7 Separating the Power of Monotone Span Programs over Different Fields.
11 A Group-Theoretic Approach to Fast Matrix Multiplication.
8 Symmetric Polynomials over Z<sub>m</sub> and Simultaneous Communication Protocol.
26 Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
5 Stability and Efficiency of a Random Local Load Balancing Protocol.
103 Gossip-Based Computation of Aggregate Information.
41 Broadcasting Algorithms in Radio Networks with Unknown Topology.
3 Switch Scheduling via Randomized Edge Coloring.
30 On the Impossibility of Dimension Reduction in l<sub>1</sub>.
47 Clustering with Qualitative Information.
68 Bounded Geometries, Fractals, and Low-Distortion Embeddings.
8 On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences.
31 The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.
30 Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem.
70 Towards a Characterization of Truthful Combinatorial Auctions.
48 Group Strategyproof Mechanisms via Primal-Dual Algorithms.
20 The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions.
33 Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.
23 A Non-Markovian Coupling for Randomly Sampling Colorings.
15 The Ising Model on Trees: Boundary Conditions and Mixing Time.
10 Logconcave Functions: Geometry and Efficient Sampling Algorithms.
28 Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.