In the present study, we consider a computational model similar to the classical RAM machine, except that each instruction performed by the machine may fail with probability q < 1=6e: The failures are transient and independent of each other. The deenition of this model (which we call ERRAM) follows a previous work citelp, where we did not allow for addressing errors. We show how an arbitrary RA...

The notion of garbled random-access machines (garbled RAMs) was introduced by Lu and Ostrovsky (Eurocrypt 2013). It can be seen as an analogue of Yao’s garbled circuits, that allows a user to garble a RAM program directly, without performing the expensive step of converting it into a circuit. In particular, the size of the garbled program and the time it takes to create and evaluate it are only...

The C++ package ADOL-C described in this paper facilitates the evaluation of first and higher derivatives of vector functions that are defined by computer programs written in C or C++. The numerical values of derivative vectors are obtained free of truncation errors at mostly a small multiple of the run time and a fix small multiple random access memory required by the given function evaluation...

We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange items. The problem is to design a scheduling strategy that decides upon the order in which items from the buffer are sent to the server. Each ...

A famous algorithm is the Fast Fourier Transform, or FFT. An eecient iterative version of the FFT algorithm performs as a rst step a bit-reversal permutation of the input list. The bit-reversal permutation swaps elements whose indices have binary representations that are the reverse of each other. Using an amortized approach this operation can be made to run in linear time on a random-access ma...

The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984, Komll os presented an algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his algorithm and give a linear time procedure for its implementation in the unit cost RAM model. The procedure uses tab...

In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m over an alphabet of size σ such that we can answer to the following query: given a text T of length n, where each character is encoded using log σ bits return ...

AbstmctIn most parallel random access machine (PRAM) models, memory references are assumed to take unit time. In practice, and in theory, certain scan operations, also known as prefix computations, can execute in no more time than these parallel memory references. This paper outlines an extensive study of the effect of including, in the PRAM models, such scan operations as unit-time primitives....

Common presentations of the NP-completeness of SAT suffer from two drawbacks which hinder the scope of this flagship result. First, they do not apply to machines equipped with random-access memory, also known as direct-access memory, even though this feature is critical in basic algorithms. Second, they incur a quadratic blow-up in parameters, even though the distinction between, say, linear an...

Li and Yesha ]5,6] investigated many computational time bounds of variants of parallel random access machines (PRAMS), and improved upper and lower bounds [2,3,7]. In [5,6], they proved a tight lower bound of 8(G) for PARITY on nondeterministic PRIORITY(~) (for short, NPRIORITY(~)) without ROM, which is a kind of nondeterministic concurrent-read concurrent-write PRAM. This article observes some...