Search w/in this Title for Titles All Reviews
	Theoretical Computer Science Elsevier Science Publishers Ltd.         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-10 of 844 reviews Date Reviewed     Minimal equivalent subgraphs containing a given set of arcs Reimers A., Reimers A., Goldstein Y. Theoretical Computer Science 67556-63, 2017.  Type: Article A preordered set (V,→) is a set V with a binary relation → that satisfies reflexivity and transitivity. A directed graph (digraph) D=(V, Nov 19 2018   From hidden to visible Zhang M., Ogata K. Theoretical Computer Science 722(C): 52-75, 2018.  Type: Article Algebraic specification is a technique in which a system is modeled by equations or conditional equations. This approach was originally used for defining data types and operations on them. An added benefit is that the equational system... Oct 12 2018   Characterization of context-free languages Badano M., Vaggione D. Theoretical Computer Science 676 92-96, 2017.  Type: Article The authors prove that a generalized Greibach normal form (GNF) grammar still generates a context-free language. They expand the left side of GNF-type rules to be any nonempty product of variables (nonterminals), not just a single vari... Sep 20 2018   New infinite family of regular edge-isoperimetric graphs Bezrukov S., Bulatovic P., Kuzmanovski N. Theoretical Computer Science 721(C): 42-53, 2018.  Type: Article An application, engineering or otherwise, often triggers the introduction of a new concept of a combinatorial nature. This leads researchers to study related theoretical and computational issues. Again, these problems are usually intra... Aug 10 2018   Decidability and independence of conjugacy problems in finitely presented monoids Araújo J., Kinyon M., Konieczny J., Malheiro A. Theoretical Computer Science 731(C): 88-98, 2018.  Type: Article In a group, two elements a and b are conjugate if there is some g with gag-1 = b. Conjugacy is an equivalence relation and can be... Jul 20 2018   Locating maximal approximate runs in a string Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017.  Type: Article Repetition and periodicity play an essential role in efficient pattern matching, data analysis, and data compression. This paper presents an efficient algorithm to identify maximal sequences of approximate repetitions within a string, ... Jul 3 2018   On the parameterized complexity of associative and commutative unification Akutsu T., Jansson J., Takasu A., Tamura T. Theoretical Computer Science 660(C): 57-74, 2017.  Type: Article Equational unification and matching play an important role in theorem proving, term rewriting, and declarative programming. Given a set of axioms and two terms, equational unification asks whether the terms can be made equal by variabl... Jun 28 2018   α-concave hull, a generalization of convex hull Asaeedi S., Didehvar F., Mohades A. Theoretical Computer Science 702 48-59, 2017.  Type: Article The calculation of the minima and maxima from convex hulls is an important research area in optimization, machine learning, and related fields. Mathematics and machine learning researchers have come up with innovative algorithms to qui... Apr 10 2018   A generalized attack on RSA type cryptosystems Bunder M., Nitaj A., Susilo W., Tonien J. Theoretical Computer Science 704 74-81, 2017.  Type: Article The safety of the well-known RSA cryptosystem is based on the fact that, in general, it is computationally very hard to factorize large integers. Given two large prime numbers p and q, the public k... Mar 23 2018   Languages with membership determined by single letter factors Higgins P., Alwan S. Theoretical Computer Science 680 15-24, 2017.  Type: Article This paper continues a previous one [1] by the authors, Higgins and Alwan, expanding on the notion of scan languages that require a word to be read completely before determining whether the word belongs to the language. This applies to... Mar 8 2018       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy