Results 1  10
of
26,144
CONSTANT NUMBER PARALLEL MULTIPLIERS
"... A parallel multiplier for constant numbers is presented. The constant number is in Canonical Signed Digit (CSD) form and the other factor in two’s complement form. The result is obtained in two’s complement form. The design presented here is based on a special algorithm developed for the multipli ..."
Abstract
 Add to MetaCart
A parallel multiplier for constant numbers is presented. The constant number is in Canonical Signed Digit (CSD) form and the other factor in two’s complement form. The result is obtained in two’s complement form. The design presented here is based on a special algorithm developed
Scheduling on a Constant Number of Machines
"... Abstract. We consider the problem of scheduling independent jobs on a constant number of machines. We illustrate two important approaches for obtaining polynomial time approximation schemes for two different variants of the problem, more precisely the multiprocessorjob and the unrelatedmachines mo ..."
Abstract
 Add to MetaCart
Abstract. We consider the problem of scheduling independent jobs on a constant number of machines. We illustrate two important approaches for obtaining polynomial time approximation schemes for two different variants of the problem, more precisely the multiprocessorjob and the unrelated
SEQUENCES WITH CONSTANT NUMBER OF RETURN WORDS
"... Abstract. An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m − 1)n + 1 and if it contains no weak bispecial factor. These conditions are necessary for ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
Abstract. An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m − 1)n + 1 and if it contains no weak bispecial factor. These conditions are necessary for m = 3, whereas for m = 4 the complexity function need not be 3n + 1. A new class of words satisfying Rm is given. 1.
Regular Languages are Testable with a Constant Number of Queries
 SIAM Journal on Computing
, 1999
"... We continue the study of combinatorial property testing, initiated by Goldreich, Goldwasser and Ron in [7]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L 2 f0; 1g and an integer n there exists a randomized algorithm which always acc ..."
Abstract

Cited by 87 (18 self)
 Add to MetaCart
We continue the study of combinatorial property testing, initiated by Goldreich, Goldwasser and Ron in [7]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L 2 f0; 1g and an integer n there exists a randomized algorithm which always accepts a word w of length n if w 2 L, and rejects it with high probability if w has to be modified in at least n positions to create a word in L. The algorithm queries ~ O(1=) bits of w. This query complexity is shown to be optimal up to a factor polylogarithmic in 1=. We also discuss testability of more complex languages and show, in particular, that the query complexity required for testing contextfree languages cannot be bounded by any function of . The problem of testing regular languages can be viewed as a part of a very general approach, seeking to probe testability of properties defined by logical means. 1
A Constant Number of Query Bits
"... rd to z, and then we may think of x as the decoding of z. There are two dual views of the Hadamard code, based on two different interpretations of i=1 x i y i . 1. View the x i as coefficients and the y i as variables. Then the codeword E(x) can be viewed as the linear function f x = i=1 x i y i ..."
Abstract
 Add to MetaCart
rd to z, and then we may think of x as the decoding of z. There are two dual views of the Hadamard code, based on two different interpretations of i=1 x i y i . 1. View the x i as coefficients and the y i as variables. Then the codeword E(x) can be viewed as the linear function f x = i=1 x i y i evaluated on all possible inputs. 2. View the y i as coefficients and the x i as variables. Then the codeword E(x) can be viewed as evaluating all possible linear functions (over GF (2) ) at the point x 2 f0; 1g . 1.2 The linearity test Given a string z 2 f0; 1g , we would like to test whether it is (close to) a codeword of the Hadamard code. As noted in Section 1.1, valid codewords can be viewed as linear functions f x . Likewise, we view z as a Boolean function f , and accessing the bit at location y 2 f0; 1g can be viewed as getting the value of f(y). For two strings x; y 2 f0; 1g , let x \Phi y 2 f0; 1g denote their bitwise exclusive or. The linearity test: Choose
Fully Private Auctions in a constant number of rounds
, 2002
"... We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than common assumptions in existing protocols that prohibit the collusion of certain thirdparties (e.g. distinct auctioneers) . Full privac ..."
Abstract

Cited by 40 (7 self)
 Add to MetaCart
privacy is obtained by using homomorphic encryption (e.g. ElGamal) and distributing the private key among the set of bidders. Bidders jointly compute the auction outcome on their own without uncovering any additional information in a constant number of rounds. No auctioneers or other trusted third parties
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts
Local list decoding with a constant number of queries
, 2010
"... Recently Efremenko showed locallydecodable codes of subexponential length. That result showed that these codes can handle up to 1 3 fraction of errors. In this paper we show that the same codes can be locally uniquedecoded from error rate 1 2 − α for any α> 0 and locally listdecoded from erro ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
error rate 1 − α for any α> 0, with only a constant number of queries and a constant alphabet size. This gives the first subexponential codes that can be locally listdecoded with a constant number of queries. 1
Tobins Q, corporate diversification and firm performance
, 1993
"... In this paper, we show that Tobin's q and firm diversification are negatively related. This negative relation holds for different diversification measures and when we control for other known determinants of q. We show further that diversified firms have lower q's than equivalent portfolios ..."
Abstract

Cited by 499 (26 self)
 Add to MetaCart
portfolios of specialized firms. This negativerelation holds throughout the 1980s in our sample. Finally, it holds for firms that have kept their number of segments constant over a number of years as well as for firms that have not. In our sample, firms that increase their number of segments have lower q
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.
Results 1  10
of
26,144