Ctrl+K
- 3-query-rldcs-are-strictly-stronger-than-3-query-ldcs
- a-dichotomy-theorem-for-multi-pass-streaming-csps
- a-dobrushin-condition-for-quantum-markov-chains-rapid-mixing-and-conditional-mutual-information-at-high-temperature
- a-faster-deterministic-algorithm-for-fully-dynamic-maximal-matching
- a-unified-approach-to-memory-sample-tradeoffs-for-detecting-planted-structures
- accelerated-convex-optimization-via-hamiltonian-dynamics-with-deterministic-integration-time
- actively-learning-halfspaces-without-synthetic-data
- additive-one-approximation-for-minimum-degree-spanning-tree-breaking-the-o-mn-time-barrier
- almost-linear-convergence-under-minimal-score-assumptions-quantized-transition-diffusion
- an-optimal-algorithm-for-stochastic-vertex-cover
- approximation-schemes-for-edit-distance-and-lcs-in-quasi-strongly-subquadratic-time
- average-case-complexity-of-quantum-stabilizer-decoding
- average-hardness-of-sivp-for-module-lattices-of-fixed-rank
- better-models-and-algorithms-for-learning-ising-models-from-dynamics
- beyond-smoothed-analysis-analyzing-the-simplex-method-by-the-book
- breaking-barriers-for-distributed-mis-by-faster-degree-reduction
- calibeating-made-simple
- combinatorial-optimization-using-comparison-oracles
- data
- defensive-generation
- deterministic-hardness-of-approximation-of-unique-svp-and-gapsvp-in-lp-norms-for-p-2
- deterministic-list-decoding-of-reed-solomon-codes
- deterministic-negative-weight-shortest-paths-in-nearly-linear-time-via-path-covers
- diffusion-network-alignment-an-efficient-algorithm-and-explicit-probability-bounds
- efficient-quantum-hermite-transform
- efficient-reversal-of-transductions-of-sparse-graph-classes
- efficient-sampling-with-discrete-diffusion-models-sharp-and-adaptive-guarantees
- efficient-swap-multicalibration-of-elicitable-properties
- fast-score-based-sampling-via-log-concave-reductions
- few-single-qubit-measurements-suffice-to-certify-any-quantum-state
- fine-grained-complexity-of-continuous-euclidean-k-center
- fixed-parameter-tractability-of-private-synthetic-data-generation
- high-rate-efficient-local-list-decoding-from-hdx
- improved-bounds-for-coin-flipping-leader-election-and-random-selection
- learning-from-biased-and-costly-data-sources-minimax-optimal-data-collection-under-a-budget
- licenses
- limitations-of-sgd-for-multi-index-models-beyond-statistical-queries
- lyapunov-based-sample-complexity-analysis-for-weakly-coupled-mdps
- near-optimal-hardness-of-approximating-k-csp
- nearly-tight-lower-bounds-for-relaxed-locally-decodable-codes-via-robust-daisies
- non-adaptive-cryptanalytic-time-space-lower-bounds-via-a-shearer-like-inequality-for-permutations
- on-randomized-algorithms-in-online-strategic-classification
- on-the-curse-of-dimensionality-in-private-sparse-covariance-estimation-and-pca
- on-the-gradient-complexity-of-private-optimization-with-private-oracles
- on-the-need-for-quantum-memory-with-short-outputs
- on-the-statistical-query-complexity-of-learning-semiautomata-a-random-walk-approach
- online-convex-optimization-with-sublinear-noisy-probes
- optimal-learning-rate-schedules-under-functional-scaling-laws-power-decay-and-warmup-stable-decay
- optimal-reconstruction-from-linear-queries
- perfect-network-resilience-in-polynomial-time