Within the last year
Within the past 3 years
1 - 10 of 12 articles
I would like to comment on an article by Fabrizio Luccio 1 which discusses weighted increment linear search for scatter tables.
Two algorithms are presented for sorting n 2 elements on an n × n mesh-connected processor array that require O (n) routing and comparison steps. The best previous algoritmhm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors....
A proof method, subgoal induction, is presented as an alternative or supplement to the commonly used inductive assertion method. Its major virtue is that it can often be used to prove a loop's correctness directly from its input-output specification without the use of an invariant. The relation...
When data records are grouped into blocks in secondary storage, it is frequently necessary to estimate the number of blocks X D accessed for a given query. In a recent paper 1, Cardenas gave the expression X D = m (1 - (1 - 1/ m ) k ), (1) assuming that there are n records divided into m blocks...
In a recent paper, Shneiderman and Scheuermann 1 have defined an interesting operation, called uniform insertion , whereby a (linked) data structure G 2 can be embedded within another structure G 1 in such a way that each data node of G 1 serves as an entry node for G 2 . This communication...
This paper presents the results of a study testing the s-shaped budget curve of Nolan's stage model of computer development in an organization. Research on the data processing budgets of California counties fails to support the s-shaped curve or the use of budgets as a basis for a stage model....
A method for describing and structuring programs that simplifies proofs of their correctness is presented. The method formally represents a program in terms of levels of abstraction, each level of which can be described by a self-contained nonprocedural specification. The proofs, like the...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.