ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Algorithm engineering”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DCcs.DSEmpiricalRecentJun 8, 2026

Engineering Scalable Distributed List Ranking

Peter Sanders, Matthias Schimek, Tim Niklas Uhl, Thomas Weidmann

Improves the sparse ruling-set algorithm for list ranking to scale to large machines and input sizes.

View →
cs.SEcs.PLEmpiricalRecentAug 2, 2026

Algorithm-driven Development: A Proactive Approach to Improving Software Quality and Reducing Defects

Philippe Jawish, Pierre Evrard, Alexandre Lemerle, Adrian Genin +2 more

This paper introduces Algorithm-Driven Development (ADD), a methodology that translates requirements into algorithmic flowcharts and links requirement modeling with automated test generation to improv…

View →
cs.AIcs.SERecentJun 1, 2026

Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks

Fabian Hoppe, Melven Röhrig-Zöllner, Philipp Knechtges

The paper demonstrates the potential of using LLMs within verifier-guided evolutionary coding agents to develop and improve algorithms, specifically applied to contraction order optimization in tensor…

View →
cs.AIcs.NEEmpiricalRecentOct 16, 2026

Algorithm Modelization: Transforming Optimization Algorithms into Evolvable Intelligence

Jian Yao, Zhiyao Zhang, Yichen Li, Xingyu Wu +1 more

This paper introduces Algorithm Modelization, a paradigm that turns iterative algorithms into trainable models.

View →
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
cs.SEcs.AIEmpiricalRecentJun 15, 2026

Beyond Models: Reflections on Engineering AI-enabled Systems in a Project-Based Course

Amir Mashmool, Kishan Ravindra Sawant, Mojtaba Shahin, Nico Hochgeschwender +1 more

Teaching Software Engineering for AI-enabled systems

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

View →
cs.ITcs.AIcs.MAEmpiricalRecentJul 20, 2026

Autonomous Discovery of Wireless Communications Algorithms

Fayçal Aït Aoudia, Jakob Hoydis, Sebastian Cammerer, Gian Marti +3 more

The paper introduces The AI Telco Engineer (AITE), a framework for autonomously designing wireless communication algorithms using large language models, achieving better performance and reduced latenc…

View →
cs.PLcs.LOEmpiricalRecentJul 28, 2026

Towards Bottom-Up Enumeration in miniKanren via Pruning and Memoization

Nikolai Kudasov

The paper introduces two library combinators, prune and defrel/bank, to bring observational deduplication and bottom-up enumeration into the relational setting using plain miniKanren.

View →
cs.AIcs.LGcs.PLEmpiricalRecentOct 31, 2026

XLA from the Trenches: Correctness on TPU Workloads at Scale

Ignacio Cano, Amir Saadat, Rishipal Singh Bhatia, Samuel Ginzburg +18 more

This paper presents a methodology for verifying and triaging a compiler at hyperscale using fuzzing techniques and AI agent swarms.

View →
cs.SEcs.AIcs.ETEmpiricalRecentOct 10, 2026

TurnCost: Turns, Not Observations: Cache-Aware Loop Engineering for Coding Agents

Pramod Kumar, Raj Kumar Pandey

This paper analyzes the efficiency of AI coding agents and identifies the opportunity for reducing unnecessary turns in their loop engineering process.

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

View →
cs.LGcs.AIcs.LORecentMay 29, 2026

Learning to Solve and Optimize by Evolving Code

Veronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato, Gerhard Friedrich +2 more

The paper introduces CHECKMATE, a novel framework that uses code evolution to automatically generate and optimize algorithms for complex combinatorial problems, outperforming state-of-the-art solvers.

View →
cs.DScs.LGTheoreticalRecentJun 17, 2026

Learning Augmented Exact Exponential Algorithms

Tatiana Belova, Yuriy Dementiev, Danil Sagunov

The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

View →