Results 1  10
of
44,621
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.
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
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
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
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1406 (19 self)
 Add to MetaCart
of an undirect graph are presented. The space and time requirements of both algorithms are bounded by k 1V + k2E d k for some constants kl, k2, and k a, where Vis the number of vertices and E is the number of edges of the graph being examined.
Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information
, 2006
"... This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result of this pa ..."
Abstract

Cited by 2632 (50 self)
 Add to MetaCart
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result
A model for technical inefficiency effects in a stochastic frontier production function for panel data
 Empirical Economics
, 1995
"... Abstract: A stochastic frontier production function is defined for panel data on firms, in which the nonnegative technical inetGciency effects are assumed to be a function of firmspecific variables and time. The inefficiency effects are assumed to be independently distributed as truncations of nor ..."
Abstract

Cited by 555 (4 self)
 Add to MetaCart
Abstract: A stochastic frontier production function is defined for panel data on firms, in which the nonnegative technical inetGciency effects are assumed to be a function of firmspecific variables and time. The inefficiency effects are assumed to be independently distributed as truncations
Results 1  10
of
44,621