11 papers · ranked by Valyu relevance
Ruben Becker, Davide Cenzato, Sunghwan Kim, Bojana Kodric + 2 more
'Riccardo Maso' 'Nicola Prezza'] Wheeler automata were introduced in 2017 as a tool to generalize existing indexing and compression techniques based on the Burrows-Wheeler transform. Intuitively, an automaton is said to be Wheeler if there exists a total order on its states reflecting the natural co-lexicographic order…
Yuri Gurevich
The modern notion of algorithm was elucidated in the 1930s–1950s. It was axiomatized a quarter of a century ago as the notion of "sequential algorithm" or "classical algorithm"; we prefer to call it "basic algorithm" now. The axiomatization was used to show that for every basic algorithm there is a behaviorally…
Leonid A. Levin
These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic concepts of Theory of Computation and to provoke their interest in further study. Model-dependent effects were systematically ignored.…
Authors not listed
We present a vector-based method to balance chemical reactions. The algorithm builds candidates in a deterministic way, removes duplicates, and always prints coefficients in the lowest whole-number form. For redox cases, electrons and protons/hydroxide are treated explicitly, so both mass and charge are balanced. We…
Yann Garniron, Thomas Applencourt, Kevin Gasperich, Anouar Benali + 15 more
Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multi-reference second-order perturbation theory (PT2). The determinant-driven…
Authors not listed
Strong coupling and environmental memory render many open quantum systems intractable to classical computation. To overcome this barrier, we present a variational quantum algorithm capable of solving generalized form time-local quantum master equations directly on Noisy Intermediate-Scale Quantum (NISQ) processors. Our…
Yaqiao Li, Mahtab Masoori, Lata Narayanan, Denis Pankratov
We study the Renting Servers in the Cloud problem (RSiC) in multiple dimensions. In this problem, a sequence of multi-parameter jobs must be scheduled on servers that can be rented on-demand. Each job has an arrival time, a finishing time, and a multi-dimensional size vector that specifies its resource demands. Each…
James Aspnes
| | Table of contents | | | ii | | --- | --- | --- | --- | --- | | | List of figures | | | xiv | | | List of tables | | | xv | | | List of algorithms | | | xvi | | | Preface | | | xvii | | 1 | | Randomized algorithms | | 1 | | | 1.1 | A trivial example | | 2 | | | 1.2 | Verifying polynomial identities | | 3 | | | 1.3 |…
Krasimir Yordzhev
Some randomized algorithms, used to obtain a random n 2 × n 2 Sudoku matrix, where n is a natural number, is reviewed in this study. Below is described the set Πn of all (2n) × n matrices, consisting of elements of the set Zn = {1, 2, . . . , n}, such that every row is a permutation. It is proved that such matrices…
Authors not listed
Deriving versatile and robust mechanistic models from experimental data is a key challenge in engineering and natural sciences. This is especially true in chemical reaction engineering, where reactor manufacturers and operators increasingly pursue the development and maintenance of digital twins that rely on frequent…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…