Results 1  10
of
12,581
Generating Bracelets in Constant Amortized Time
 SIAM JOURNAL ON COMPUTING
, 2001
"... A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) kary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the s ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
in the sense that the running time is proportional to the number of bracelets produced. This is an improvement by a factor of n (where n is the length of the bracelets being generated) over the fastest, previously known algorithm to generate bracelets.
Generating Bracelets in Constant Amortized Time
, 2001
"... Abstract A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (ie., listing) kary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal ..."
Abstract
 Add to MetaCart
in the sense that the running time is proportional to the number of bracelets produced. This is an improvement by a factor of n (where n is the length of the bracelets being generated) over the fastest, previously known algorithm to generate bracelets.
Secure TwoParty Computation in Sublinear (Amortized) Time
"... Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f depends on each of its input bits, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for nontrivial functions ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
present an approach to secure twoparty computation that yields protocols running in sublinear time, in an amortized sense, for functions that can be computed in sublinear time on a randomaccess machine (RAM). Moreover, each party is required to maintain state that is only (essentially) linear in its own
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum
Dynamic Planar Convex Hull Operations in NearLogarithmic Amortized Time
 JOURNAL OF THE ACM
, 1999
"... We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P , such as membership and tangentfinding. Updates take O(log 1+" n) amortized time and queries take O(log n) time each, where n is the maximum siz ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P , such as membership and tangentfinding. Updates take O(log 1+" n) amortized time and queries take O(log n) time each, where n is the maximum
Solving online feasibility problem in constant amortized time per update
, 2005
"... We present a deterministic algorithm for solving the two and threedimensional online feasibility problem. Insertion of a new constraint is processed in constant amortized time. Our method is adapted from the offline linear deterministic Megiddo algorithm for linear programming. As in his prune an ..."
Abstract
 Add to MetaCart
We present a deterministic algorithm for solving the two and threedimensional online feasibility problem. Insertion of a new constraint is processed in constant amortized time. Our method is adapted from the offline linear deterministic Megiddo algorithm for linear programming. As in his prune
A Gray code for fixeddensity necklaces and Lyndon words in constant amortized time
 Theoretical Computer Science
"... This paper develops a constant amortized time algorithm to produce the cyclic coollex Gray code for fixeddensity binary necklaces, Lyndon words, and pseudonecklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant amor ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper develops a constant amortized time algorithm to produce the cyclic coollex Gray code for fixeddensity binary necklaces, Lyndon words, and pseudonecklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 432 (18 self)
 Add to MetaCart
an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worstcase sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access
Results 1  10
of
12,581