Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,808 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
2013
2013
Efficient Range Reporting of Convex Hull
Jatin Agarwal
,
N. Moidu
,
Kishore Kothapalli
,
K. Srinathan
arXiv.org
2013
Corpus ID: 14850174
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a…
Expand
2012
2012
(Really) Tight bounds for dispatching binary methods
Paweł Gawrychowski
arXiv.org
2012
Corpus ID: 16663700
We consider binary dispatching problem originating from object oriented programming. We want to preprocess a hierarchy of classes…
Expand
2012
2012
I/O-Efficient Dynamic Planar Range Skyline Queries
Casper Kejlberg-Rasmussen
,
Konstantinos Tsakalidis
,
K. Tsichlas
arXiv.org
2012
Corpus ID: 14232654
We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \textit{3-sided range…
Expand
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
2002
2002
Ancestor Problems on Pure Pointer Machines
Enrico Pontelli
,
Desh 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
2000
2000
The Temporal Precedence Problem
Desh Ranjan
,
Enrico Pontelli
,
G. Gupta
,
L. Longpré
Algorithmica
2000
Corpus ID: 10523609
Abstract. In this paper we analyze the complexity of the Temporal Precedence Problem on pointer machines. The problem is to…
Expand
1996
1996
A Simple and Optimal Algorithm for Finding Immediate Dominators in Reducible Graphs
Stephen Alstrup
,
Peter W. Lauridsen
1996
Corpus ID: 115388341
We present two simple algorithm for nding immediate dominator in re-ducible graphs with n nodes and m edges: A O(n + m) RAM…
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