Related papers: Pushing Lines Helps: Efficient Universal Centralis…
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy…
Motivated by the factorization inherent in the original fast multipole method and the improved fast Gauss transform we introduce a factorable form of attention that operates efficiently in high dimensions. This approach reduces the…
Shape-programmed sheets morph from one surface into another upon activation by stimuli such as illumination, and have attracted much interest for their potential engineering applications, especially in soft robotics. Complex shape changes…
Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm…
New theoretical and numerical analysis of the one-dimensional contact process with quenched disorder are presented. We derive new scaling relations, different from their counterparts in the pure model, which are valid not only at the…
Synchronized oscillations are of critical functional importance in many biological systems. We show that such oscillations can arise without centralized coordination in a disordered system of electrically coupled excitable and passive…
Quantum walk has been successfully used to search for targets on graphs with vertices identified as the elements of a database. This spacial search on a two-dimensional periodic grid takes $\mathcal{O}\left(\sqrt{N\log N}\right)$ oracle…
Complex systems may morph between structures with different dimensionality and degrees of freedom. As a tool for their modelling, nonlinear embeddings are introduced that encompass objects with different dimensionality as a continuous…
Structured data is widely used in domains such as healthcare, finance, and scientific data management. Recent studies on structured data foundation models (SFMs) aim to support data analysis and mining tasks over such data, but still face…
We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\tilde…
We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program…
A new discrete time-reversible map of a unit square onto itself is proposed. The map comprises of piecewise linear two-dimensional operations, and is able to represent the macroscopic features of both equilibrium and nonequilibrium…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
Out-of-time ordered correlators are a probe of how the information of an initial perturbation is effectively scrambled under unitary time evolution, widely used to study quantum chaos. They have also been used to demonstrate that…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
Looped Transformers (LT) have emerged as a powerful architecture by iterating their layers multiple times before decoding the final token. However, pairing them with full attention retains quadratic complexity, making them computationally…
This paper studies the emulation-based stabilization of nonlinear networked control systems with two time scales. We address the challenge of using a single communication channel for transmitting both fast and slow variables between the…
Data processing systems offer an ever increasing degree of parallelism on the levels of cores, CPUs, and processing nodes. Query optimization must exploit high degrees of parallelism in order not to gradually become the bottleneck of query…
We investigate how dynamical decoupling methods may be used to manipulate the time evolution of quantum many-body systems. These methods consist of sequences of external control operations designed to induce a desired dynamics. The systems…
Sorting is one of the fundamental problems in computer science. Playing a role in many processes, it has a lower complexity bound imposed by $\mathcal{O}(n\log{n})$ when executing on a sequential machine. This limit can be brought down to…