Nils Andersen, Neil D. Jones Generalizing Cook's Transformation to Imperative Stack Programs. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:1-18 [Conf]
Jean Berstel A Rewriting of Fife's Theorem about Overlap-Free Words. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:19-29 [Conf]
Wilfried Brauer, Ute Brauer Reconsidering the Jeep Problem - Or How to Transport a Birthday Present to Salosauna. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:30-33 [Conf]
Erzsébet Csuhaj-Varjú Cooperating Grammars' Systems: Power and Parameters. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:67-84 [Conf]
Karel Culik II, Jarkko Kari Parallel Pattern Generation with One-Way Communications. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:85-96 [Conf]
Joost Engelfriet Deciding the NTS Property of Context-Free Grammars. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:124-130 [Conf]
Ferenc Gécseg Homomorphic Representations by Producs of Tree Automata. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:131-139 [Conf]
Juha Honkala An Iteratio Property of Lindenmayerioan Power Series. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:159-168 [Conf]
Oscar H. Ibarra, Tao Jiang On Some Open Problems Concerning the Complexity of Cellular Arrays. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:183-196 [Conf]
Lila Kari Power of Controlled Insertion and Deletion. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:197-212 [Conf]
Werner Kuich On the Multiplicity Equivalence Problem for Context-free Grammars. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:232-250 [Conf]
Hermann A. Maurer Learning Theoretical Aspects is Important but (Sometimes) Dangerous. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:279-288 [Conf]
Hannu Nurmi Cryptographic Protocols for Auctions and Bargaining. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:317-324 [Conf]
Azaria Paz An Elementary Algorithmic Problem from an Advanced Standpoint. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:344-357 [Conf]
Keijo Ruohonen Event Detection for ODEs and Nonrecursive Hierarchies. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:358-371 [Conf]
Imre Simon String Matching Algorithms and Automata. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:386-395 [Conf]
Magnus Steinby Classifying Regular Languages by their Syntactic Algebras. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:396-409 [Conf]
Paavo Turakainen On Polynomial Matrix Equations X T = p(X) and X = p(X). Where all Parameters are Nonnegative. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:410-421 [Conf]
Emo Welzl Gram's Equation - A Probabilistic Proof. [Citation Graph (0, 0)][DBLP] Results and Trends in Theoretical Computer Science, 1994, pp:422-424 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP