The translation of emerging application concepts that exploit Resistive Random Access Memory (ReRAM) into large-scale practical systems requires realistic, yet computationally efficient, empirical models that can capture all observed physical devices. Here, we present a Verilog-A ReRAM model built upon experimental routines performed on TiOx-based prototypes. This model was based on custom bias...

The sorting buffers problem is motivated by many applications in manufacturing processes and computer science, among them car-painting and file servers architecture. The input is a sequence of items of various types. All the items must be processed, one by one, by a service station. We are given a random-access sorting buffer with a limited capacity. Whenever a new item arrives it may be moved ...

We present a process algebra for specifying and reasoning about quantum security protocols. Since the computational power of the protocol agents must be restricted to quantum polynomial-time, we introduce the logarithmic cost quantum random access machine (QRAM), and incorporate it in the syntax of the algebra. Probabilistic transition systems give the semantic support for the process algebra. ...

We consider two closely related problems: computing the region visible from a point amid simple polygonal obstacles and computing the lower envelope of a set of disjoint segments. Visibility problems such as these were proposed and promptly solved in the late ’80s and early ’90s before the widespread popularity of the word RAM model. All previously published algorithms thus run in Ω(n log n) ti...

We present a new algorithm for on line approximate string matching The algorithm is based on the simulation of a non deterministic nite automaton built from the pattern and using the text as input This simulation uses bit operations on a RAM machine with word length O log n being n the maximum size of the text The running time achieved is O n for small patterns i e m O p log n independently of ...

We present a new algorithm for on-line approximate string matching. The algorithm is based on the simulation of a non-deterministic nite automaton built from the pattern and using the text as input. This simulation uses bit operations on a RAM machine with word length O(log n), being n the maximum size of the text. The running time achieved is O(n) for small patterns (i.e. m = O(p log n)), inde...

This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif’s algorithm. The new algorithm has the same complexity bounds as Klein and Reif’s algorithm and runs in O ( n log n p ) time for any number p ≤ n processors o...

Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of multiuser detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the random nature of user activity in this problem and limits the total number of us...

Main parameters of evaluation of modern information protection systems that implement RSA encryption algorithm are performance, RAM consumption and stability of algorithm of used method of modular exponentiation to the attacks on implementation, particularly in the temporal analysis. Methods of modular exponentiation (binary method, method and sliding window method) are characterized by the dep...

The computational complexity of learning from binary examples is investigated for linear threshold neurons. We introduce combinatorial measures that create classes of infinitely many learning problems with sample restrictions. We analyze how the complexity of these problems depends on the values for the measures. The results are established as dichotomy theorems showing that each problem is eit...