Results 1  10
of
1,878,801
FOR RANDOM ACCESS MACHINES
, 1985
"... Abstr¡ct. wc prove optimal lower bounds on the computation time for several wellknown test problems on u quiå realistic computational model: the random access machine ' These lower bound arguments may be of special intefest for logicians because they rely on finitary analogues of two importai ..."
Abstract
 Add to MetaCart
Abstr¡ct. wc prove optimal lower bounds on the computation time for several wellknown test problems on u quiå realistic computational model: the random access machine ' These lower bound arguments may be of special intefest for logicians because they rely on finitary analogues of two importai
Relative Cost Random Access Machines
, 1998
"... The purpose of a model of computation is to provide the algorithm designer with a device for running algorithms. It should be conceptually clear to let him or her concentrate at the algorithmic ideas for solving the problem. At the same time it should be concrete enough to give a realistic estimate ..."
Abstract
 Add to MetaCart
on the use resources when the algorithm is executed on a real computer. In this paper we analyze some weaknesses of existing models of computation, namely sequential access machine and random access machine, and propose a new cost model, called relative cost random access machine, which solves some
Beyond Parallel RandomAccess Machines
"... and then to analyze the complexity of different problems in the model. However, if the model fails to reflect constraints in the real world, these analyses have limited practical importance. The parallel randomaccess machine (PRAM) is by far the most popular model of parallel computation. Hundreds ..."
Abstract
 Add to MetaCart
and then to analyze the complexity of different problems in the model. However, if the model fails to reflect constraints in the real world, these analyses have limited practical importance. The parallel randomaccess machine (PRAM) is by far the most popular model of parallel computation. Hundreds
Fast Simulation Of Turing Machines By Random Access Machines
, 1985
"... We prove that a T(n) timebounded, S(n) spacebounded Turing machine can be simulated in O(T(n) loglogS(n)) time by a random access machine (with no multiplication or division instructions) under the logarithmic cost criterion. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We prove that a T(n) timebounded, S(n) spacebounded Turing machine can be simulated in O(T(n) loglogS(n)) time by a random access machine (with no multiplication or division instructions) under the logarithmic cost criterion.
RandomAccess Machines and the Extended ChurchTuring Thesis
"... Abstract. We show that a randomaccess machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended ChurchTuring Thesis. 1 ..."
Abstract
 Add to MetaCart
Abstract. We show that a randomaccess machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended ChurchTuring Thesis. 1
Tables Should Be Sorted (on Random Access Machines)
, 1995
"... We consider the problem of storing an n element subset S of a universe of size m, so that membership queries (is x 2 S?) can be answered efficiently. The model of computation is a random access machine with the standard instruction set (direct and indirect adressing, conditional branching, addit ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We consider the problem of storing an n element subset S of a universe of size m, so that membership queries (is x 2 S?) can be answered efficiently. The model of computation is a random access machine with the standard instruction set (direct and indirect adressing, conditional branching
Transforming comparison model lower bounds to the parallelrandomaccessmachine
 INFORMATION PROCESSING LETTERS
, 1997
"... We provide general transformations of lower bounds in Valiant's parallelcomparisondecisiontree model to lower bounds in the priority concurrentread concurrentwrite parallelrandomaccessmachine model. The proofs rely on standard Ramseytheoretic arguments that simplify the structure of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We provide general transformations of lower bounds in Valiant's parallelcomparisondecisiontree model to lower bounds in the priority concurrentread concurrentwrite parallelrandomaccessmachine model. The proofs rely on standard Ramseytheoretic arguments that simplify the structure
The Complexity of Computation on the Parallel Random Access Machine
, 1993
"... PRAMs also approximate the situation where communication to and from shared memory is much more expensive than local operations, for example, where each processor is located on a separate chip and access to shared memory is through a combining network. Not surprisingly, abstract PRAMs can be much m ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
PRAMs also approximate the situation where communication to and from shared memory is much more expensive than local operations, for example, where each processor is located on a separate chip and access to shared memory is through a combining network. Not surprisingly, abstract PRAMs can be much
Lower bounds for UnionSplitFind related problems on random access machines
, 1994
"... We prove \Omega\Gamma p log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the unionsplitfind problem, dynamic prefix problems and onedimensional range query problems. The proof techniques include a ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
We prove \Omega\Gamma p log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the unionsplitfind problem, dynamic prefix problems and onedimensional range query problems. The proof techniques include a
Results 1  10
of
1,878,801