Showing papers in "Journal of Computer and System Sciences in 1996"

TL;DR: In this article, it was shown that any randomized algorithm that runs in spaceSand timeT and uses poly(S) random bits can be simulated using only O(S ) random bits in space Sand timeT+poly(S).

TL;DR: In this article, the authors consider pattern matching without decompression in the UNIX Z-compression scheme and show how to modify their algorithms to achieve a trade-off between the amount of extra space used and the algorithm's time complexity.

TL;DR: This paper investigates parameterized pattern matching via parameterized suffix trees (p- Suffix trees) and gives two algorithms for constructing p-suffix trees: one that runs in linear time for fixed alphabets, and another that uses auxiliary data structures and runs inO(nlog(n) time for variable alphABets, wherenis input length.

TL;DR: This work characterize precisely the complexity of several natural computational problems in NP, which have been proposed but not categorized satisfactorily in the literature: Computing the Vapnik?Chervonenkis dimension of a 0?1 matrix; finding the minimum dominating set of a tournament; satisfying a Boolean expression by perturbing the default truth assignment; and several others.

TL;DR: It is proved that incremental learning can be always simulated by inference devices that are both set-driven and conservative and feed-back learning is shown to be more powerful than iterative inference, and its learning power is incomparable to that of bounded example memory inference.

TL;DR: The notion of automaticity, which attempts to model how “close” a function is to a finite-state function, is explored and some incomparability results between the automaticity measure and those defined earlier by Gabarr?

TL;DR: Results concerning trade-offs in multiprover interactive proof systems and results that distinguish checkable languages from those that are nonadaptively checkable are obtained.

TL;DR: The results extend the 1972 work by Hamblin that demonstrated the interaction of time intervals which shared the same linear global time axis and shed light on the nature of interprocess communication in distributed systems, an area which was pioneered by Lamport in 1986.

TL;DR: It is shown that if the groups are Abelianp-groups then isomorphism can be determined in timeO(n) and that the elementary divisor sequence for an Abelian group can been determined inTimeO(nlogn) and for a Abelian p-group it can beetermined in time O(n).

TL;DR: Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented; the algorithm for weighted intersection works by scaling the weights, and the cardinality algorithm is a special case, but takes advantage of greater structure.

TL;DR: In this article, the authors describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding.

TL;DR: This work constructing superconcentrators that are “self -routing,” in the sense that they compute for themselves the required interconnections appropriate in each instance.

TL;DR: This paper proves that the bound that for allnandm?nthere exists a sequence ofn?1 Union andmFind operations that needs at least?(m.?(m, n) execution steps on a pointer machine that satisfies the separation condition.

TL;DR: A recursive algorithm to test the safety and effective computability of predicates in arbitrarily complex cliques in the predicate connection graph, and a framework for analyzing programs that are produced by the Magic Sets transformation, to analyze recursive cliques.

TL;DR: In this article, a new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory, referred to as the intrinsic language identification approach.

TL;DR: It turns out that language classes defined by restricting the allowed transformations to a sort of similarity transformations called grid transformations have nice closure properties, and non-trivial questions concerning the generated pictures can be decided.

TL;DR: It is shown that this extension of the relational algebra can serve as a unifying formalization of various forms of procedural data management which have been considered in database systems research and establish a close correspondence between reflection and bounded looping, and between tail-recursive reflection and unbounded looping.

TL;DR: Range query theory is applied to develop join algorithms that run inO(IlogdI+U) time, where I and U are the sizes of the input and output anddis usually a small constant, which leads to the development of very fast indices supportingO(PolylogN) selection operations.

TL;DR: A new method for ambiguity proofs of context-free languages and a new proof of an earlier result of Autebert, Flajolet, and Gabarro concerning prefixes of infinite words are obtained.

TL;DR: A query language with adequate expressive power for or- sets is formulated using the notion of normalization of or-sets, and queries at the “structural” and “conceptual” levels are distinguished.

TL;DR: In this article, it was shown that any p-selective and self-reducible set is in the class P, and several consequences of this theorem were discussed, among others, under reasonable assumptions auto-reduceibility and selfreducibility differ on NP, and that there are non-p-T-mitotic sets in NP.

TL;DR: Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction, providing a method for proving (finitary) problems to be outside the syntactic classMaxNP and, hence, outsideMaxSNP too, by showing that their infinite versions are?11-complete.

TL;DR: It is proved that branching programs in which for each path the number of variables that are tested more than once is bounded by using a new lower bound method become more powerful by increasing by 1.

TL;DR: The main result shows that a two-layer network can realise exactly any finite union of bounded polyhedra in R2 whose bounding lines lie in general position, except for some well-characterised exceptions.

TL;DR: In this paper, it was shown that the closure properties of #P under?in the above sense is closely related to the relationships between P#P1] and higher classes such as PHPPand PPPP.

TL;DR: This work formalizes and introduces multi-prover (quasi-)encoding schemes to solve the question of how to reveal a single vaiuey=p(x) to a verifier wherex is chosen arbitrarily by the verifier.

TL;DR: This paper introduces Aver?C, F?

TL;DR: It is shown in this paper that relative to a random oracle, NP does not havep-measure zero, and the proof exploits the followingindependenceproperty of algorithmically random sequences.

TL;DR: It is shown that relative to any generic oracle G and for any k/spl ges/ 2, there exists a tally set in U/spl Deltasub kSup P/(G)/spl capspl Pisub ksup P/( G) but not in /splDeltasubs ksup p/(G), and related results hold for type-2 complexity.

TL;DR: This paper uses the graph-oriented object database model GOOD as a framework to propose an alternative formulation of the BP-completeness criterion, adapted to the context of languages involving object creation.