Results 1  10
of
63
A Tutorial on Amortized Local Competitiveness in Online Scheduling
, 2011
"... potential functions are used to show that a particular online algorithm is locally competitive in an amortized sense. Algorithm analyses using potential functions are sometimes criticized as seeming to be black magic ..."
Abstract

Cited by 17 (14 self)
 Add to MetaCart
potential functions are used to show that a particular online algorithm is locally competitive in an amortized sense. Algorithm analyses using potential functions are sometimes criticized as seeming to be black magic
Secure Computation with Sublinear Amortized Work
"... Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computa ..."
Abstract
 Add to MetaCart
be utilized in the insecure setting; private database search is a prime example. We present an approach to secure twoparty computation that yields sublineartime protocols, in an amortized sense, for functions that can be computed in sublinear time on a random access machine (RAM). Furthermore, a party whose
Optimal amortized regret in every interval
"... Consider the classical problem of predicting the next bit in a sequence of bits. A standard performance measure is regret (loss in payoff) with respect to a set of experts. For example if we measure performance with respect to two constant experts one that always predicts 0’s and another that alway ..."
Abstract
 Add to MetaCart
( x log T) in any interval of length x. In this paper we show a randomized algorithm that in an amortized sense gets a regret of O( x) for any interval when the sequence is partitioned into intervals arbitrarily. We empirically estimated the constant in the O() for T upto 2000 and found
Amortized Inference in Probabilistic Reasoning
"... Recent studies of probabilistic reasoning have postulated generalpurpose inference algorithms that can be used to answer arbitrary queries. These algorithms are memoryless, in the sense that each query is processed independently, without reuse of earlier computation. We argue that the brain opera ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Recent studies of probabilistic reasoning have postulated generalpurpose inference algorithms that can be used to answer arbitrary queries. These algorithms are memoryless, in the sense that each query is processed independently, without reuse of earlier computation. We argue that the brain oper
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
On the amortized complexity of zeroknowledge protocols
 of Lecture Notes in Computer Science
, 2009
"... Abstract. We present a protocol that allows to prove in zeroknowledge that committed values xi, yi, zi, i = 1,..., l satisfy xiyi = zi, where the values are taken from a finite field K, or are integers. The amortized communication complexity per instance proven is O(κ + l) for an error probability ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Abstract. We present a protocol that allows to prove in zeroknowledge that committed values xi, yi, zi, i = 1,..., l satisfy xiyi = zi, where the values are taken from a finite field K, or are integers. The amortized communication complexity per instance proven is O(κ + l) for an error probability
Amortized Analyses of SelfOrganizing Sequential Search Heuristics
, 1985
"... The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically. In this article,, we use amortization to analyze the heuris ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
the heuristics in a worstcase sense; the relative merit of the heuristics in this analysis is different in the probabilistic analyses. Experiments show that the behavior of the heuristics on real data is more closely described by the amortized analyses than by the probabilistic analyses.
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.
Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and NStep SCAN
 BIT
, 1992
"... The amortized analysis is a useful tool for analyzing the timecomplexity of performing a sequence of operations. The disk scheduling problem involves a sequence of requests in general. In this paper, the performances of representative disk scheduling algorithms, SSTF, SCAN, and NStepSCAN, are ana ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
lyzed in the amortized sense. A lower bound of the amortized complexity for the disk scheduling problem is also derived. According to our analysis, SCAN is not only better than SSTF and NStepSCAN, but also an optimal algorithm. Various authors have studied the disk scheduling problem based on some probability models
Results 1  10
of
63