America Forever Bytes
algorithms · AFBytes
Other
algorithms
Recent coverage
![[2606.03929] Revisiting $O(n \log \log n)$ chaining for anchored edit distance](/static/img/curated/desks/afbytes-tech.png)
[2606.03929] Revisiting $O(n \log \log n)$ chaining for anchored edit distance
Abstract page for arXiv paper 2606.03929: Revisiting $O(n \log \log n)$ chaining for anchored edit distance
[2606.03516] Linear Convergence of Parareal Algorithm for Semilinear Parabolic Equations
Abstract page for arXiv paper 2606.03516: Linear Convergence of Parareal Algorithm for Semilinear Parabolic Equations
[2606.03570] STC: Reversible Digit-Context Decomposition for BWT-Family Text Compression
Abstract page for arXiv paper 2606.03570: STC: Reversible Digit-Context Decomposition for BWT-Family Text Compression
[2606.03765] Token-sliding realizability for complements, Cartesian-products, and grid graph families
Abstract page for arXiv paper 2606.03765: Token-sliding realizability for complements, Cartesian-products, and grid graph families
[2406.10407] Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
Abstract page for arXiv paper 2406.10407: Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
[2509.08726] Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness
Abstract page for arXiv paper 2509.08726: Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness
[2606.02869] ZOAF: Towards Efficient Zeroth-Order Optimization for Analog/RF Circuit Design
Abstract page for arXiv paper 2606.02869: ZOAF: Towards Efficient Zeroth-Order Optimization for Analog/RF Circuit Design
[2511.19208] Leader Election via Unique Sink Orientation
Abstract page for arXiv paper 2511.19208: Leader Election via Unique Sink Orientation
The Hidden Algorithms Of The Natural World
Every organism you have ever seen, every ecosystem you have ever walked through, is the ongoing output of an algorithm that has been running without interruptio...
[2606.01952] Randomized Least Squares Value Iteration itself is Joint Differentially Private
Abstract page for arXiv paper 2606.01952: Randomized Least Squares Value Iteration itself is Joint Differentially Private
[2606.02016] Evaluating Real-World Generalizability of Algorithm Selection Models
Abstract page for arXiv paper 2606.02016: Evaluating Real-World Generalizability of Algorithm Selection Models
[2606.00895] Tiny Recursive Models for Solving the J2-Perturbed Lambert Problem
Abstract page for arXiv paper 2606.00895: Tiny Recursive Models for Solving the J2-Perturbed Lambert Problem
[2606.01267] An extremal problem for completely unclustered Burrows-Wheeler images
Abstract page for arXiv paper 2606.01267: An extremal problem for completely unclustered Burrows-Wheeler images
[2606.02233] Optimizing the Envy Cycle Elimination Algorithm
Abstract page for arXiv paper 2606.02233: Optimizing the Envy Cycle Elimination Algorithm
[2606.02347] Are Algorithm Registers Transparent? Perspectives from Germany
Abstract page for arXiv paper 2606.02347: Are Algorithm Registers Transparent? Perspectives from Germany
[2606.01708] Two-Fidelity Best-Action Identification for Stochastic Minimax Tree
Abstract page for arXiv paper 2606.01708: Two-Fidelity Best-Action Identification for Stochastic Minimax Tree
[2605.31594] A Tight Theory of Error Feedback Algorithms in Distributed Optimization
Abstract page for arXiv paper 2605.31594: A Tight Theory of Error Feedback Algorithms in Distributed Optimization
[2408.07596] Quadratic-time computations for pseudo-Anosov mapping classes
Abstract page for arXiv paper 2408.07596: Quadratic-time computations for pseudo-Anosov mapping classes
[2605.30955] A non-intrusive approach to index-aware learning
Abstract page for arXiv paper 2605.30955: A non-intrusive approach to index-aware learning
[2605.31071] Tree Containment Parameterized by Scanwidth
Abstract page for arXiv paper 2605.31071: Tree Containment Parameterized by Scanwidth
[2605.30389] The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
Abstract page for arXiv paper 2605.30389: The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
[2605.30647] Bidirectional Incremental Generalized Hybrid A*
Abstract page for arXiv paper 2605.30647: Bidirectional Incremental Generalized Hybrid A*
[2605.31098] How Many Slopes Does Polynomial Area Cost?
Abstract page for arXiv paper 2605.31098: How Many Slopes Does Polynomial Area Cost?
[2605.31034] Annealed Softmax Greedy in Many-Armed Bayesian Bandits
Abstract page for arXiv paper 2605.31034: Annealed Softmax Greedy in Many-Armed Bayesian Bandits
[2605.31051] Linear Ordering Problem: Time for a Change
Abstract page for arXiv paper 2605.31051: Linear Ordering Problem: Time for a Change
Implementing two Graph traversal algorithms in Python: Depth First Search and Breadth First Search
Depth First Search and Breadth First Search I am right in front of a ton of exams and I need to learn about algorithms and data structures. When I read about ps...
Probabilistic data structures to estimate cardinalities and frequencies of massive streams
In the following blog post we will introduce three different Big Data algorithms. More specifically, we will learn about probabilistic data structures that allo...
Plotting Bézier curves directly and with De Casteljau's algorithm
Last major Update: 21.10.2013 Github repo that contains the presented code in this post. Introduction In this article I will present you a very simple and in no...
Introduction to Machine Learning in 2019
Gentle Introduction into machine learning in 2019