Results 1  10
of
29
Skip Lists: A Probabilistic Alternative to Balanced Trees
, 1990
"... Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. ..."
Abstract

Cited by 412 (1 self)
 Add to MetaCart
Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Structured programming with go to statements
 Computing Surveys
, 1974
"... A consideration of several different examples sheds new light on the problem of ereating reliable, wellstructured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs c ..."
Abstract

Cited by 82 (3 self)
 Add to MetaCart
(Show Context)
A consideration of several different examples sheds new light on the problem of ereating reliable, wellstructured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs clearly and efficiently without go to state
Resurrecting the asymptotics of linear recurrences
 ALAIN DENISE, DOMINIQUE GOUYOUBEAUCHAMPS LRI, B^ATIMENT 490 UNIVERSITE PARISSUD XI F91405 ORSAY CEDEX
, 1985
"... Once on the forefront of mathematical research in America, the asymptotics of the solutions of linear recurrence equations is now almost forgotten, especially by the people who need it most, namely combinatorists and computer scientists. Here we present this theory in a concise form and give a numbe ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
Once on the forefront of mathematical research in America, the asymptotics of the solutions of linear recurrence equations is now almost forgotten, especially by the people who need it most, namely combinatorists and computer scientists. Here we present this theory in a concise form and give a number of examples that should enable the practicing combinatorist and computer scientist to include this important technique in her (or his) asymptotics tool kit.
AlphaSort: A CacheSensitive Parallel External Sort
 VLDB JOURNAL
, 1995
"... A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads. Using commodity processors, memory, and arrays of SCSI disks, AlphaSort runs the industrystandard sort benchmark in seven seconds. This beats the best published record on ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads. Using commodity processors, memory, and arrays of SCSI disks, AlphaSort runs the industrystandard sort benchmark in seven seconds. This beats the best published record on a 32CPU 32disk Hypercube by 8:1. On another benchmark, AlphaSort sorted more than a gigabyte in a minute. AlphaSort is a
A fast algorithm for computing a longest common increasing subsequence
 Information Processing Letters
, 2005
"... Let A = 〈a1, a2,..., am 〉 and B = 〈b1, b2,..., bn 〉 be two sequences, where each pair of elements in the sequences is comparable. A common increasing subsequence of A and B is a subsequence 〈ai1 = bj1, ai2 = bj2,..., ail = bjl 〉, where i1 < i2 < · · · < il and j1 < j2 < · · · < ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Let A = 〈a1, a2,..., am 〉 and B = 〈b1, b2,..., bn 〉 be two sequences, where each pair of elements in the sequences is comparable. A common increasing subsequence of A and B is a subsequence 〈ai1 = bj1, ai2 = bj2,..., ail = bjl 〉, where i1 < i2 < · · · < il and j1 < j2 < · · · < jl, such that for all 1 ≤ k < l, we have aik < aik+1. A longest common increasing subsequence of A and B is a common increasing subsequence of the maximum length. This paper presents an algorithm for delivering a longest common increasing subsequence in O(mn) time and O(mn) space.
FrequencyBased Views to Pattern Collections
, 2003
"... Finding frequently occurring patterns from data sets is a central computational task in data mining. In this paper we suggest to focus on pattern frequencies. We advocate frequency simplifications as a complementary approach to structural constraints on patterns. As a special case of the frequency s ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Finding frequently occurring patterns from data sets is a central computational task in data mining. In this paper we suggest to focus on pattern frequencies. We advocate frequency simplifications as a complementary approach to structural constraints on patterns. As a special case of the frequency simplifications, we consider discretizing the frequencies. We analyze the worst case error of certain discretization functions and give e#cient algorithms minimizing several error functions. In addition, we show that the discretizations can be used to find small approximate condensed representations for the frequent patterns.
Bichromatic separability with two boxes: a general approach
"... Let S be a point set in general position on the plane such that its elements are colored red or blue. We study the following problem: Remove as few points as possible from S such that the remaining points can be enclosed by two isothetic rectangles, one containing all the red points, the other all t ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
Let S be a point set in general position on the plane such that its elements are colored red or blue. We study the following problem: Remove as few points as possible from S such that the remaining points can be enclosed by two isothetic rectangles, one containing all the red points, the other all the blue points, and such that each rectangle contains only points of one color. We prove that this problem can be solved in O(n 2 log n) time and O(n) space. We show how our techniques can be generalized to solve other variants of the given problem such as the 3dimensional problem and the trichromatic problem. 1
Permutations generated by token passing in graphs
, 1997
"... A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3,.. The tokens are removed from the input node in this order and transferred through the graph to the output node in a series of move ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3,.. The tokens are removed from the input node in this order and transferred through the graph to the output node in a series of moves; each move transfers a token from a node to an adjacent node. Two or more tokens cannot reside on an internal node simultaneously. When the tokens arrive at the output node they will appear in a permutation of their original order. The main result is a description of the possible arrival permutations in terms of regular sets. This description allows the number of arrival permutations of each length to be computed. The theory is then applied to packetswitching networks and has implications for the resequencing problem. It is also applied to some complex data structures and extends previously known results to the case that the data structures are of bounded capacity. A byproduct of this investigation is a new proof that permutations which avoid the pattern 321 are in one to one correspondence with those that avoid 312.
Phone number portability for PCS systems with ATM backbones using distributed dynamic hashing
 IEEE J. Sel. Areas Comm
, 1997
"... Abstract — Current cellular subscribers have a geographic phone number (e.g., in AMPS and U.S. digital cellular systems) or a number which contains the network provider’s identity (e.g., in GSM), and whenever subscribers register or receive (and possibly, originate) a call, a home location register ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract — Current cellular subscribers have a geographic phone number (e.g., in AMPS and U.S. digital cellular systems) or a number which contains the network provider’s identity (e.g., in GSM), and whenever subscribers register or receive (and possibly, originate) a call, a home location register (HLR) database has to be queried. The wired infrastructure supports a function called global title translation (GTT) that converts the subscriber’s number to an HLR database address. A special feature of next generation wireless access service will be to support personal communication services (PCS’s) and wireless subscribers with portable personal numbers, or nongeographic phone numbers (NGPN’s), that do not indicate the service provider or HLR database serving the user. In addition, the GTT function may not be available when the wired backbone is an ATM network. Thus a key function required in future wireless access systems with wired ATM backbones will be the ability to translate an NGPN to the identity of the HLR which serves the subscriber, a process we call NGPN translation. (Note that the same functionality is also needed for subscribers with local, portable phone numbers.) We discuss the requirements of NGPN translation and some alternative schemes. We propose two schemes for fast, efficient, scalable and flexible NGPN translation which use ideas of dynamic hashing, caching, and indirection. The schemes use a hash function in the visiting location registers (VLR’s) (or serving SCP) and a set of distributed translation servers which store the NGPNtoHLR mapping. We discuss how the operations required to maintain the translation information can be performed. Finally, we perform a simplified analysis of the scalability of the alternative schemes as well as the hashbased schemes we propose. Index Terms—Home location register, global title translation, visiting location registers. I.
Priority Queues and Multisets
 ELECTRONIC J. COMBINAT
, 1995
"... A priority queue, a container data structure equipped with the operations insert and deleteminimum, can reorder its input in various ways, depending both on the input and on the sequence of operations used. If a given input oe can produce a particular output ø then (oe; ø ) is said to be an allow ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
A priority queue, a container data structure equipped with the operations insert and deleteminimum, can reorder its input in various ways, depending both on the input and on the sequence of operations used. If a given input oe can produce a particular output ø then (oe; ø ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in onetoone correspondence with certain kway trees and, consequently, the allowable pairs can be enumerated. Algorithms are presented for determining the number of allowable pairs with a fixed input component, or with a fixed output component. Finally, generating functions are used to study the maximum number of output components with a fixed input component, and a symmetry result is derived.