theory-and-algorithms

Documents about theory-and-algorithms

• Optimal Support Size Testing#1344220arXiv (All)
• Node Differentially Private Algorithms for Survivable Networks and Graphs Analysis#220271EliScholar
• Evolutionary Theory and Computerised Genetic Algorithms#740744PhilArchive
• Graph Matching in Random Geometric Graphs I: Efficient Algorithms#1341564arXiv (All)
• Model Theory and Algorithms for One-Relator Groups#1400135arXiv (All)
• A Short Note on Algorithms For The Noisy $k$-XOR Problem#1402535arXiv (All)
• Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques#1051182arXiv (All)
• Algorithms for adaptive and heteroskedastic linear regression at the computational threshold#1110317arXiv (OAI Expanded)
• Robust Analog Lagrange Coded Computing: Theory and Algorithms via Discrete Fourier Transforms#799904arXiv (All)
• Settling the Sample Complexity of Rényi Entropy Estimation#1234814arXiv (All)
• Empirical Comparsion of Traveling Salesperson Approximation Algorithms#332996DigitalCommons@CalPoly
• Distributed algorithms and local structures in graphs#1329133HAL (France)
• Asymmetric Likelihood-Free Hypothesis Testing#1414403arXiv (All)
• The Pareto Secretary Problem#1535409arXiv (All)
• Algorithms with Smoothed Polynomial-Time Complexity for Deterministic Discounted-sum and Mean-payoff Games#1324751arXiv (All)
• Fair Prophets#1036215arXiv (All)
• On the generation of multiplicative groups by small primes#1051886arXiv (All)
• Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms#1296922arXiv (All)
• Ramsey achievement games on graphs : algorithms and bounds#796468HAL (France)
• Extended Fourier analysis of signals#999136arXiv (All)
• A polylogarithmic higher-order Cheeger inequality#1129961arXiv (All)
• A sharp higher-order Cheeger inequality#1381373arXiv (OAI Expanded)
• Online Job Assignment#1342326arXiv (All)
• Shared Randomness and Parallel Rounds in Permutation Sampling#1536840arXiv (All)
• Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms#1328413arXiv (All)
• Adversarial Water-Filling: Theory, Algorithms, and a Domain-Specific Wireless Foundation Model#1034185arXiv (All)
• Recent advances in the Bradley--Terry Model: theory, algorithms, and applications#1013492arXiv (All)
• Dual-process theory and decision-making in large language models#1078447DORAS
• A probabilistic analysis on general probabilistic scheduling problems#1083960arXiv (OAI Expanded)
• Express Language Modeling#1216332arXiv (All)
• Linear Hashing Is Poissonesque#1457904arXiv (All)
• Birthday Estimators Are Uniformly Optimal for Renyi Entropy#1412638arXiv (All)
• The Matroid Secretary Conjecture is True#1084500arXiv (OAI Expanded)
• Optimal Online Stochastic Matching#1354548arXiv (All)
• Algorithms for Finite Group Epimorphism Testing#984353arXiv (All)
• Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes#1130467arXiv (All)
• Near-Feasible Stable Matchings: Incentives and Optimality#920276arXiv (OAI Expanded)
• Near-Feasible Stable Matchings: Incentives and Optimality#924507arXiv (All)
• Sequential Sampling for Binary Classification: Two LLMs are (Almost) All You Need#1117357arXiv (All)
• A Comprehensive Survey of Mixture-of-Experts: Algorithms, Theory, and Applications#130758Papers With Code
• Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits#1202286arXiv (All)
• Efficient Posterior Sampling for $\mathbb Z_2$ Synchronization#1217934arXiv (All)
• Essential Coding Theory#67322MIT OpenCourseWare
• Two-State Max-Plus Comparison Is Decidable#921021arXiv (OAI Expanded)
• Two-State Max-Plus Comparison Is Decidable#925257arXiv (All)
• DDPM Score Matching and Distribution Learning#972372arXiv (All)
• The Inverse Lyndon Array#1049142arXiv (All)
• Online Allocation using Few Samples#1123710arXiv (OAI Expanded)
• Maximizing Social Influence in Almost Linear Time#1131078arXiv (All)
• Prophet Inequalities with Cancellation Costs#1328244arXiv (All)