1,955+ open-access research outputs.
Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph โฆ
We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in imperfect-information games through a two-phase curriculum. The first phase trains aโฆ
Priority queues are data structures that maintain a dynamic collection of elements and allow inserting new elements and removing the smallest element. The most widely known and used priority queue is โฆ
Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data, and it is fundamental to realizing quantum advantage in domains such as machine leaโฆ
Bacterial colonies composed of elongated cells form active nematic fluids that spontaneously self-organise into ordered domains of aligned cells and exhibit self-generated chaotic flows powered by celโฆ
Two-dimensional materials can stabilize crystal structures that are absent from their bulk counterparts, offering opportunities for materials design. Here, we report the synthesis of a previously unknโฆ
Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate โฆ
Computing Fourier transforms of k-sparse signals, where only k of N frequencies are non-zero, is fundamental in compressed sensing, radar, and medical imaging. While the Fast Fourier Transform (FFT) eโฆ
Institutional allocators often evaluate structured strategies on the basis of marketed backtests -- hypothetical track records constructed by applying a strategy's rules to historical data prior to anโฆ
The Adversarial Humanities Benchmark (AHB) evaluates whether model safety refusals survive a shift away from familiar harmful prompt forms. Starting from harmful tasks drawn from MLCommons AILuminate,โฆ
We revisit multi-agent delegation under a stronger and more realistic assumption: an agent's capability is not fixed at the skill level, but depends on task context. A coding agent may excel at short โฆ
A standard organization of production lines exhibiting self-balancing behavior is given by bucket brigades. Their study in operations research was initiated by the foundational work of Bartholdi and Eโฆ
GPU-based concurrent data structures (CDSs) achieve high throughput for read-only queries, but efficient support for dynamic updates on fully GPU-resident data remains challenging. Ordered CDSs (e.g.,โฆ
We explore the mechanics of a terminally loaded buckled elastica under frictionless self-contact. With the aid of two integrals associated with the elastica, we propose a scale-invariant condition necโฆ
Self-gravitating systems of $N$ particles are chaotic. We wonder how chaotic the Galaxy is, and what the consequences are. We therefore simulate the dynamical evolution of a galaxy-scale distribution โฆ
Particle Swarm Optimization (PSO) is susceptible to premature convergence when the swarm collapses around the global best, particularly on multimodal landscapes in higher dimensions. We propose Divergโฆ
We investigate the structural, electronic, and superconducting properties of a hexagonal BP3 monolayer using first-principles calculations combined with anisotropic Migdal-Eliashberg theory. The optimโฆ
In this work, we address the problem of cardinality estimation for similarity search in high-dimensional spaces. Our goal is to design a framework that is lightweight, easy to construct, and capable oโฆ
Although Approximate Nearest Neighbor (ANN) search has been extensively studied, large-k ANN queries that aim to retrieve a large number of nearest neighbors remain underexplored, despite their numeroโฆ
We present a theoretical study of quantum magneto-transport and magneto-optical (M-O) properties in modified-Haldane model; which is applicable to diverse classes of two-dimensional (2D) quantum materโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ