Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,969,281 papers from all fields of science
Search
Sign In
Create Free Account
Pointer machine
In theoretical computer science a pointer machine is an "atomistic" abstract computational machine model akin to the Random access machine. Depending…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Abstract machine
Algorithm characterizations
Church–Turing thesis
Counter machine
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
FORMAL VERIFICATION OF PROGRAMS FOR ABSTRACT REGISTER MACHINES
D. Chkliaev
,
V. Nepomniaschy
2013
Corpus ID: 196153855
Abstract register machines are an important formal model of computation widely used for the modeling of many classes of…
Expand
2009
2009
Computing the subset partial order for dense families of sets
Amr Elmasry
Information Processing Letters
2009
Corpus ID: 205482370
2007
2007
Two new methods for transforming priority queues into double-ended priority queues
Amr Elmasry
,
Claus Jensen
,
J. Katajainen
2007
Corpus ID: 15664307
Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to…
Expand
2004
2004
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines
Enrico Pontelli
,
D. Ranjan
Theory of Computing Systems
2004
Corpus ID: 7590006
Abstract In this paper we propose an optimal solution to the Temporal Precedence problem—i.e., the problem of managing the…
Expand
2002
2002
Ancestor Problems on Pure Pointer Machines
Enrico Pontelli
,
D. Ranjan
Latin American Symposium on Theoretical…
2002
Corpus ID: 43075712
We study several problems related to computing ancestors in dynamic trees on pure pointer machines, i.e., pointer machines with…
Expand
2002
2002
An Efficient Parallel Pointer Machine Algorithm for the NCA Problem
A. D. Palù
,
Enrico Pontelli
,
D. Ranjan
IFIP TCS
2002
Corpus ID: 26138980
The Nearest Common Ancestor (NCA) Problem can be broadly defined as follows: Given a rooted tree T and two nodes x, y ∈ T, find…
Expand
2000
2000
Data structures for order-sensitive predicates in parallel nondeterministic systems
D. Ranjan
,
Enrico Pontelli
,
G. Gupta
Acta Informatica
2000
Corpus ID: 33034006
Abstract. We study the problem of guaranteeing correct execution semantics in parallel implementations of logic programming…
Expand
1997
1997
When Can We Sort in o(n log n) Time?
Amir M. Ben-Amram
Journal of computer and system sciences (Print)
1997
Corpus ID: 24479598
We define two conditions on a random access machine (RAM) with arithmetic and Boolean instructions and possible bounds on word…
Expand
1995
1995
Pointer Machines and Pointer Algorithms : anAnnotated
BibliographyAmir M. Ben-AmramFebruary
1995
Corpus ID: 14720112
The term pointer machine has been used ambiguously in Computer Science literature. In this report we give precise deenitions of…
Expand
1991
1991
Different Modifications of Pointer Machines and Their Computational Power
K. Shvachko
International Symposium on Mathematical…
1991
Corpus ID: 43445650
Kolmogorov — Uspensky machines (KUM) and storage modification machines (SMM) are the variants of machines with graph storage…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE