Showing papers in "Journal of Computer and System Sciences in 1998"
••
TL;DR: It is proved that the reachability problem is undecidable for timed automata augmented with a single stopwatch, and an (optimal) PSPACE reachability algorithm is given for the case of initialized rectangular automata.
903 citations
••
TL;DR: This work presents a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph, and matches (up to low order terms) the known gap for approximation the size of the largest independent set.
393 citations
••
TL;DR: In this paper, the authors consider the following problem: at each point of discrete time the learner must make a prediction; he is given the predictions made by a pool of experts.
284 citations
••
TL;DR: This paper considers two-party communication complexity, the “asymmetric case”, when the input sizes of the two players differ significantly, and derives two generally applicable methods of proving lower bounds and obtain several applications.
216 citations
••
TL;DR: The Metropolis algorithm is a widely used procedure for sampling from a specified distribution on a large finite set and what is rigorously known about running times is surveyed.
153 citations
••
TL;DR: This work proves several separations which show that in a generic relativized world the search classes are distinct and there is a standard search problem in each of them that is not computationally equivalent to any decision problem.
137 citations
•
102 citations
••
TL;DR: Two deterministic and randomized sequential and parallel algorithms generalize to the lexicographic sorting of multiple-precision integers represented in several words.
92 citations
••
TL;DR: Under a simple assumption about the configuration space, it is shown that it is possible to perform preprocessing following which queries can be answered quickly, and a theoretical basis for explaining this empirical success is initiated.
74 citations
••
TL;DR: A formal framework for the analysis of learning tasks in which the learner faces restrictions on the amount of information he can extract from each example he encounters is introduced and a new simple noise-tolerant algorithm is obtained by constructing an intuitivek-wRFA algorithm for this task.
66 citations
••
TL;DR: In this paper, a distribution learning algorithm for a subclass ofacyclic probalistic finite automata (APFA) is proposed and analyzed, which is characterized by a certain distinguishability property of the a...
••
TL;DR: The Gap Theorem does not hold for strongly uniform reductions; it is shown that there are Dlogtime-uniformAC0-complete sets forNC1 that are not Dlog time- uniformNC0- complete.
••
TL;DR: In this paper, an explicit and efficiently computable formula for the inverse of D-dimensional linear cellular automata over Zm(D?1, m?2) is given.
••
TL;DR: These algorithms provide O(logn)-approximation algorithms for two natural optimization versions of this problem for the class of nearly Eulerian, uniformly high-diameter planar graphs, which includes two-dimensional meshes and other common planar interconnection networks.
••
TL;DR: It is shown that DNA computation for NP-complete problems can do more than just exhaustive search, and the first analysis of errors that arise in generating the solution space for DNA computation is presented.
••
TL;DR: A polynomial time algorithm for interpolating AROF withexponentiationusing randomized substitutions is presented and a new technique to add the exponentiation operation to the basis is developed.
••
TL;DR: The two-party method based on a crossing sequence argument introduced by Yao is extended and the power of a restricted multiparty communication model in which the coordinator is allowed to send at most one message to each party is investigated.
••
TL;DR: This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction principle.
••
TL;DR: This work considers a variant of the membership query model in which the learning algorithm is given as input the number of relevant variables of the target function, and shows that in this model, any projection and embedding closed class of functions that can be learned in polynomial time can be learning attribute-efficiently in poynomial time.
••
TL;DR: A surprising fact is established that the collections of recursively enumerable languages that can be finite identified from both positive and negative data can also be identified in the limit (incrementally learned in the ideal case) from only positive data.
••
TL;DR: A family of regular sequence operations (called rs-operations) to be used in database queries is introduced, based on a simple pattern matching mechanism using regular expressions as its patterns, and includes most of the “natural” operations on sequences.
••
TL;DR: AnO(M(n2)) time algorithm for the recognition of tree adjoining languages (TALs), where N is the size of the input string and M(k) is the time needed to multiply twok×kboolean matrices.
••
TL;DR: In this paper, it was shown that there are functions computable by linear size boolean circuits of depth k that require superpolynomial size perceptrons of depthk?1, fork
••
TL;DR: An algorithm for computing canonical connections in a database scheme which is more efficient than the classical algorithm based on tableau reduction is presented and a join plan is obtained which succeeds in controlling the nonmonotonicity of cyclic canonical connections.
••
TL;DR: This study considers general classes of recursively enumerable languages and allows the machine to either identify or refute the unrepresentative texts (respectively, texts containing finite un representative samples).
••
TL;DR: It is proved that bottom-up tree-to-graph transducers define the same tree-To-tree translations as the previously introduced top-down tree- to- graph transducers.
••
TL;DR: Two new counting protocols are presented and analyzed, one of which uses one bit headers and sends one packet per message under ideal conditions, but performs extremely poorly in networks with realistic loss rates and the other which uses multiple-bit headers and whose performance improves as more bits are used in the header.
••
TL;DR: For a full half of the hierarchy, necessary and sufficient conditions are provided to determine when a language subclass defined by an integer bound ofron the degree of independent parallelism is included in, includes, or is incomparable with a subclassdefined by a bound ofr?1 on the same parameter.
••
TL;DR: Structural approximation theory seeks to provide a framework for expressing optimization problems and isolating structural or syntactic conditions that explain the apparent difference in the approximation properties of different NP-optimization problems as discussed by the authors.