:facetid:toc:\"db/journals/tcs/tcs106.bht\"
OK
:facetid:toc:db/journals/tcs/tcs106.bht
Arne AnderssonComments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint".Theor. Comput. Sci.1062391-3931992Journal Articlesopenjournals/tcs/Andersson9210.1016/0304-3975(92)90261-Dhttps://doi.org/10.1016/0304-3975(92)90261-Dhttps://dblp.org/rec/journals/tcs/Andersson92
URL#6875542
Marshall W. BernHoward J. KarloffPrabhakar RaghavanBaruch SchieberFast Geometric Approximation Techniques and Geometric Embedding Problems.Theor. Comput. Sci.1062265-2811992Journal Articlesopenjournals/tcs/BernKRS9210.1016/0304-3975(92)90252-Bhttps://doi.org/10.1016/0304-3975(92)90252-Bhttps://dblp.org/rec/journals/tcs/BernKRS92
URL#6875561
Hans L. BodlaenderDieter KratschThe Complexity of Coloring Games on Perfect Graphs.Theor. Comput. Sci.1062309-3261992Journal Articlesopenjournals/tcs/BodlaenderK9210.1016/0304-3975(92)90254-Dhttps://doi.org/10.1016/0304-3975(92)90254-Dhttps://dblp.org/rec/journals/tcs/BodlaenderK92
URL#6875569
GĂ©rard BoudolKim Guldstrand LarsenGraphical Versus Logical Specifications.Theor. Comput. Sci.10613-201992Journal Articlesopenjournals/tcs/BoudolL9210.1016/0304-3975(92)90276-Lhttps://doi.org/10.1016/0304-3975(92)90276-Lhttps://dblp.org/rec/journals/tcs/BoudolL92
URL#6875573
Jiazhen CaiRobert PaigeRobert Endre TarjanMore Efficient Bottom-Up Multi-Pattern Matching in Trees.Theor. Comput. Sci.106121-601992Journal Articlesopenjournals/tcs/CaiPT9210.1016/0304-3975(92)90277-Mhttps://doi.org/10.1016/0304-3975(92)90277-Mhttps://dblp.org/rec/journals/tcs/CaiPT92
URL#6875581
Didier CaucalOn the Regular Structure of Prefix Rewriting.Theor. Comput. Sci.106161-861992Journal Articlesopenjournals/tcs/Caucal9210.1016/0304-3975(92)90278-Nhttps://doi.org/10.1016/0304-3975(92)90278-Nhttps://dblp.org/rec/journals/tcs/Caucal92
URL#6875583
Carsten DammChristoph MeinelSeparating Complexity Classes Related to Omega-Decision Trees.Theor. Comput. Sci.1062351-3601992Journal Articlesopenjournals/tcs/DammM9210.1016/0304-3975(92)90257-Ghttps://doi.org/10.1016/0304-3975(92)90257-Ghttps://dblp.org/rec/journals/tcs/DammM92
URL#6875593
Muhammad El-TahaShaler Stidham Jr.Deterministic Analysis of Queueing Systems with Heterogeneous Servers.Theor. Comput. Sci.1062243-2641992Journal Articlesopenjournals/tcs/El-TahaS9210.1016/0304-3975(92)90251-Ahttps://doi.org/10.1016/0304-3975(92)90251-Ahttps://dblp.org/rec/journals/tcs/El-TahaS92
URL#6875611
Christiane FrougnyConfluent Linear Numeration Systems.Theor. Comput. Sci.1062183-2191992Journal Articlesopenjournals/tcs/Frougny92a10.1016/0304-3975(92)90249-Fhttps://doi.org/10.1016/0304-3975(92)90249-Fhttps://dblp.org/rec/journals/tcs/Frougny92a
URL#6875620
Roland HausserComplexity in Left-Associative Grammar.Theor. Comput. Sci.1062283-3081992Journal Articlesopenjournals/tcs/Hausser9210.1016/0304-3975(92)90253-Chttps://doi.org/10.1016/0304-3975(92)90253-Chttps://dblp.org/rec/journals/tcs/Hausser92
URL#6875643
Shou-Hsuan Stephen HuangHongfei LiuVenkatraman ViswanathanA Sublinear Parallel Algorithm for Some Dynamic Programming Problems.Theor. Comput. Sci.1062361-3711992Journal Articlesopenjournals/tcs/HuangLV9210.1016/0304-3975(92)90258-Hhttps://doi.org/10.1016/0304-3975(92)90258-Hhttps://dblp.org/rec/journals/tcs/HuangLV92
URL#6875656
Peter KirschenhoferHelmut ProdingerWojciech SzpankowskiProbabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.Theor. Comput. Sci.1062395-4001992Journal Articlesopenjournals/tcs/KirschenhoferPS9210.1016/0304-3975(92)90262-Ehttps://doi.org/10.1016/0304-3975(92)90262-Ehttps://dblp.org/rec/journals/tcs/KirschenhoferPS92
URL#6875676
Emmanuel KounalisTesting for the Ground (Co-)Reducibility Property in Term-Rewriting Systems.Theor. Comput. Sci.106187-1171992Journal Articlesopenjournals/tcs/Kounalis9210.1016/0304-3975(92)90279-Ohttps://doi.org/10.1016/0304-3975(92)90279-Ohttps://dblp.org/rec/journals/tcs/Kounalis92
URL#6875677
Pascal MichelComplexity of Logical Theories Involving Coprimality.Theor. Comput. Sci.1062221-2411992Journal Articlesopenjournals/tcs/Michel92a10.1016/0304-3975(92)90250-Jhttps://doi.org/10.1016/0304-3975(92)90250-Jhttps://dblp.org/rec/journals/tcs/Michel92a
URL#6875702
Alexander A. RazborovOn the Distributional Complexity of Disjointness.Theor. Comput. Sci.1062385-3901992Journal Articlesopenjournals/tcs/Razborov9210.1016/0304-3975(92)90260-Mhttps://doi.org/10.1016/0304-3975(92)90260-Mhttps://dblp.org/rec/journals/tcs/Razborov92
URL#6875733
J. M. RobsonMore Languages of Generalised Star Height 1.Theor. Comput. Sci.1062327-3351992Journal Articlesopenjournals/tcs/Robson9210.1016/0304-3975(92)90255-Ehttps://doi.org/10.1016/0304-3975(92)90255-Ehttps://dblp.org/rec/journals/tcs/Robson92
URL#6875737
Michael I. SchwartzbachInterpretations of Recursively Defined Types.Theor. Comput. Sci.1061119-1341992Journal Articlesopenjournals/tcs/Schwartzbach9210.1016/0304-3975(92)90280-Shttps://doi.org/10.1016/0304-3975(92)90280-Shttps://dblp.org/rec/journals/tcs/Schwartzbach92
URL#6875743
Helmut SeidlSingle-Valuedness of Tree Transducers is Decidable in Polynomial Time.Theor. Comput. Sci.1061135-1811992Journal Articlesopenjournals/tcs/Seidl9210.1016/0304-3975(92)90281-Jhttps://doi.org/10.1016/0304-3975(92)90281-Jhttps://dblp.org/rec/journals/tcs/Seidl92
URL#6875746
K. G. Subramanian 0001Rani SiromoneyLisa MathewLyndon Trees.Theor. Comput. Sci.1062373-3831992Journal Articlesopenjournals/tcs/SubramanianSM9210.1016/0304-3975(92)90259-Ihttps://doi.org/10.1016/0304-3975(92)90259-Ihttps://dblp.org/rec/journals/tcs/SubramanianSM92
URL#6875756
Roger VillemaireThe Theory of (N, +, Vk, V1) is Undecidable.Theor. Comput. Sci.1062337-3491992Journal Articlesopenjournals/tcs/Villemaire9210.1016/0304-3975(92)90256-Fhttps://doi.org/10.1016/0304-3975(92)90256-Fhttps://dblp.org/rec/journals/tcs/Villemaire92
URL#6875769