2003-11-19 On A-Truth-Table-Hard Languages. 383-389 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#HomerKR93 2003-11-19 The chords' problem. 319-336 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#DauratGN02 http://dx.doi.org/10.1016/S0304-3975(01)00073-1 2003-11-19 A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. 185-190 1975 1 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Preparata75 2003-11-19 Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. 121 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Preparata76 2003-11-19 A recognition and parsing algorithm for arbitrary conjunctive grammars. 365-399 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00853-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Okhotin03 2003-11-19 Fast Parallel String Prefix-Matching. 269-278 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Breslauer95 http://dx.doi.org/10.1016/0304-3975(94)00177-K 2003-11-19 Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. 177-192 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Breslauer96 http://dx.doi.org/10.1016/0304-3975(95)00068-2 2003-11-19 The Suffix Tree of a Tree and Minimizing Sequential Transducers. 131-144 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Breslauer98 http://dx.doi.org/10.1016/S0304-3975(96)00319-2 2003-11-19 Editorial. 269-270 2002 283 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#Gorrieri02 http://dx.doi.org/10.1016/S0304-3975(01)00135-9 2003-11-19 Complexity in Left-Associative Grammar. 283-308 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Hausser92 2005-12-22 An Overview of the Tecton Proof System. 307-339 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#KapurNM94 2003-11-19 Theory and Practice. 1-15 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Knuth91 2003-11-19 Generating Plans in Linear Logic I. Actions as Proofs. 349-370 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#MasseronTV93 2003-11-19 On two-sided infinite fixed points of morphisms. 659-675 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#ShallitW02 http://dx.doi.org/10.1016/S0304-3975(01)00092-5 2003-11-19 Preface. 151 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Fiadeiro02 2003-11-19 Correspondences between classical, intuitionistic and uniform provability. 273-298 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#Nadathur00 http://dx.doi.org/10.1016/S0304-3975(99)00177-2 2003-11-19 Efficient and Optimal Query Answering on Independent Schemes. 291-308 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#AtzeniC90 2003-11-19 Set Containment Inference and Syllogisms. 39-65 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#AtzeniP88 2003-11-19 Rules and Strategies for Contextual Specialization of Constraint Logic Programs. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#FioravantiPP99 2003-11-19 Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. 185-200 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00083-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#LeeIM03 2003-11-19 Dynamic Scheduling on Parallel Machines. 49-72 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#FeldmannST94 2003-11-19 Equivalence is in the Eye of the Beholder. 353-380 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#GurevichH97 http://dx.doi.org/10.1016/S0304-3975(96)00315-5 2003-11-19 Monadic Simultaneous Rigid E-unification. 133-152 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#GurevichV99 http://dx.doi.org/10.1016/S0304-3975(98)00123-6 2004-02-24 Structure of 3-Infix-Outfix Maximal Codes. 231-240 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#LongMZ97 http://dx.doi.org/10.1016/S0304-3975(97)00097-2 2003-11-19 (g 0, g 1, ... g k)-Trees and Unary OL Systems. 209-217 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#LeeLW83 2003-11-19 News from the online traveling repairman. 279-294 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00409-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#KrumkePPS03 2003-11-19 Attribute Exploration with Background Knowledge. 215-233 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Ganter99 http://dx.doi.org/10.1016/S0304-3975(98)00271-0 2003-11-19 Graphs and Free Partially Commutative Monoids. 319-346 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Konig91 2003-11-19 Weak lighting functions and strong 26-surfaces. 29-66 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#AyalaDFQ02 http://dx.doi.org/10.1016/S0304-3975(01)00051-2 2003-11-19 A Characterization of lambda Definability in Categorical Models of Implicit Polymorphism. 5-23 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#Alimohamed95 http://dx.doi.org/10.1016/0304-3975(94)00283-O 2003-11-19 A Family of Graphs with Expensive Depth Reduction. 89-93 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Schnitger82 2003-11-19 A geometric approach to leveraging weak learners. 67-108 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#DuffyH02 http://dx.doi.org/10.1016/S0304-3975(01)00083-4 2003-11-19 Scheduling UET-UCT Series-Parallel Graphs on Two Processors. 323-340 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#FintaLMB96 http://dx.doi.org/10.1016/0304-3975(96)00035-7 2003-11-19 The Turing closure of an Archimedean field. 143-156 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#BoldiV00 http://dx.doi.org/10.1016/S0304-3975(99)00096-1 2003-11-19 Equality is a Jump. 49-64 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#BoldiV99 http://dx.doi.org/10.1016/S0304-3975(98)00283-7 2003-11-19 On Horn Spectra. 329-339 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Szwast91 2003-11-19 Asigning a Single Server to Inhomogeneous Queues with Switching Costs. 203-216 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#Koole97 http://dx.doi.org/10.1016/S0304-3975(96)00186-7 2003-11-19 Underspecification for a simple process algebra of recursive processes. 935-950 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Majster-Cederbaum01 http://dx.doi.org/10.1016/S0304-3975(00)00419-9 2003-11-19 Degrees of Parallelism in the Continuous Type Hierarchy. 59-71 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Bucciarelli97 http://dx.doi.org/10.1016/S0304-3975(96)00234-4 2003-11-19 Computability in Higher Types, P omega and the Completeness of Type Assignment. 197-217 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#LongoM86 2003-11-19 A Category-Theoretic Characterization of Functional Completeness. 193-211 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#LongoM90 2003-11-19 Lower bounds for on-line single-machine scheduling. 439-450 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00488-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#EpsteinS03 2003-11-19 On the complexity of intersecting finite state automata and N L versus N P. 257-274 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00830-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#KarakostasLV03 2003-11-19 Planar Stage Graphs: Characterizations and Applications. 239-255 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#BauernoppelKKMSU97 http://dx.doi.org/10.1016/S0304-3975(96)00201-0 2003-11-19 On the Fragmentary Complexity of Symbolic Sequences. 1-17 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#DiamondKKP95 http://dx.doi.org/10.1016/0304-3975(94)00261-G 2003-11-19 Parsing natural language idioms with bidirectional finite-state machines. 131-140 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#Poibeau01 http://dx.doi.org/10.1016/S0304-3975(00)00300-5 2003-11-19 Comparative Metric Semantics for Concurrent Prolog. 14-43 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#BakkerK90 2003-11-19 Four Domains for Concurrency. 127-149 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#BakkerW91 2003-11-19 An optimal deterministic algorithm for online b-matching. 319-325 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#KalyanasundaramP00 http://dx.doi.org/10.1016/S0304-3975(99)00140-1 2003-11-19 Constructing Competitive Tours from Local Information. 125-138 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#KalyanasundaramP94 2003-11-19 A list of arithmetical structures complete with respect to the first-order definability. 115-151 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Korec01 http://dx.doi.org/10.1016/S0304-3975(00)00113-4 2003-11-19 Irrational Speeds of Configurations Growth in Generalized Pascal Triangles. 399-412 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Korec93 2003-11-19 Small Universal Register Machines. 267-301 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Korec96 http://dx.doi.org/10.1016/S0304-3975(96)00080-1 2003-11-19 Stable Families of Behavioural Equivalences. 19-41 1989 63 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Livesey89 2003-11-19 Correctness of Java card method lookup via logical relations. 305-331 2002 283 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#DenneyJ02 http://dx.doi.org/10.1016/S0304-3975(01)00138-4 2003-11-19 On the approximation of largest common subtrees and largest common point sets. 33-50 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#AkutsuH00 http://dx.doi.org/10.1016/S0304-3975(97)00278-8 2003-11-19 Quantum evolution of words. 263-269 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Malyshev02 http://dx.doi.org/10.1016/S0304-3975(00)00444-8 2003-11-19 On the Approximation of Protein Threading. 261-275 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#AkutsuM99 http://dx.doi.org/10.1016/S0304-3975(98)00089-9 2003-11-19 Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. 277-302 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00220-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#BousquetCLL03 2005-04-20 A Formal Derivation of the Decidability of the Theory SA. 1-23 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#HosonoI94 2003-11-19 Precategories for combining probabilistic automata. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#MateusSS99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 <i>P omega</i>do not Form a Continuous Lattice - A Solution to Scott's Problem. 137-142 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#HosonoS77 2006-03-10 Formal Verification of a Leader Election Protocol in Process Algebra. 459-486 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#FredlundGK97 http://dx.doi.org/10.1016/S0304-3975(96)00256-3 2003-11-19 Cartesian authentication codes from functions with optimal nonlinearity. 1737-1752 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ChansonDS03 2003-11-19 Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. 193-223 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Gallier81 2003-11-19 Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. 111 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Gallier82 2003-11-19 Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. 249-339 1993 110 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Gallier93 2003-11-19 Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. 299-368 1995 142 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#Gallier95 http://dx.doi.org/10.1016/0304-3975(94)00280-0 2003-11-19 Concerning Two-Adjacent Context-Free Languages. 169-184 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#DahlhausG85 2003-11-19 Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. 121-136 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#DahlhausK88 2003-11-19 An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. 493-528 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#DahlhausK94 2003-11-19 Finite Petri Nets as Models for Recursive Causal Behaviour. 169-179 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#GoltzR94 2003-11-19 An Inherently Iterative Algorithm for the Grzegorczyk Hierarchy. 355-360 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Matthews94 2003-11-19 An Extensional Treatment of Lazy Data Flow Deadlock. 195-205 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Matthews95 http://dx.doi.org/10.1016/0304-3975(95)00051-W 2003-11-19 Developing (Meta)Theory of Lambda-calculus in the Theory of Context. 2001 58 Electr. Notes Theor. Comput. Sci. 1 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#Miculan01 2003-11-19 Succint Representation of Regular Languages by Boolean Automata. 323-330 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Leiss81 2003-11-19 On Classes of Tractable Unrestricted Regular Expressions. 313-327 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Leiss85 2003-11-19 Generalized Language Equations with Multiple Solutions. 155-174 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Leiss86 2003-11-19 Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution. 311-330 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Leiss94 2003-11-19 Implicit Language Equations: Existence and Uniqueness of Solutions. 71-93 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Leiss95 http://dx.doi.org/10.1016/0304-3975(94)00176-J 2003-11-19 Solving Systems of Explicit Language Relations. 83-105 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#Leiss97 http://dx.doi.org/10.1016/S0304-3975(96)00218-6 2003-11-19 Gemmating P systems: collapsing hierarchies. 253-267 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00657-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#BesozziMPZ03 2003-11-19 A Compositional Framework for Fault Tolerance by Specification Transformation. 99-125 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#PeledJ94 2003-11-19 Proving Partial Order Properties. 143-182 1994 126 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#PeledP94 2003-11-19 Automata-driven efficient subterm unification. 187-223 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#RameshRS01 http://dx.doi.org/10.1016/S0304-3975(99)00131-0 2003-11-19 Automorphism Groups of Context-Free Graphs. 275-293 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Pelecq96 http://dx.doi.org/10.1016/0304-3975(96)00222-8 2003-11-19 Indexed Types. 147-165 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Zenger97 http://dx.doi.org/10.1016/S0304-3975(97)00062-5 2003-11-19 Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops. 175-195 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#BrazmaK86 2003-11-19 The Generalized Packet Routing Problem. 281-293 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#PelegU87 2003-11-19 Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#DawsonG01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 The Local Detection Paradigm and Its Application to Self-Stabilization. 199-229 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#AfekKY97 http://dx.doi.org/10.1016/S0304-3975(96)00286-1 2003-11-19 Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability. 187-214 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Sazonov93 2003-11-19 Algebraic Proofs of Consistency and Completeness. 161-191 1995 150 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs150.html#Gardiner95 http://dx.doi.org/10.1016/0304-3975(94)00211-Z 2003-11-19 Multidimensional Interval Routing Schemes. 115-133 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#FlamminiGNT98 http://dx.doi.org/10.1016/S0304-3975(97)00070-4 2003-11-19 A Classical Linear lambda-Calculus. 43-78 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Bierman99 http://dx.doi.org/10.1016/S0304-3975(99)00048-1 2003-11-20 On Recursive Bounds for the Exceptional Values in Speed-Up. 387-394 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#BridgesC94 2003-11-19 Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. 1647-1664 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BoufkhadDN03 2004-02-26 Rule-based Programming for Building Expert Systems: a Comparison in the Microbiological Data Validation and Surveillance Domain. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#LammaMMRS01 2003-11-19 Principal Type Scheme and Unification for Intersection Type Discipline. 181-209 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Rocca88 2003-11-19 Kernels of seminorms in constructive analysis. 259-267 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#BridgesW02 http://dx.doi.org/10.1016/S0304-3975(01)00067-6 2003-11-19 Rigorous results for random (2+p)-SAT. 109-129 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#AchlioptasKKK01 http://dx.doi.org/10.1016/S0304-3975(01)00154-2 2003-11-19 Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. 225-237 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#JosephY85 2003-11-19 The Semantics of Lazy Functional Languages. 105-111 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Josephs89 2003-11-19 Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#LeuschelJ99 2003-11-19 Unification with Extended Patterns. 1-50 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Duggan98 http://dx.doi.org/10.1016/S0304-3975(97)00141-2 2003-11-19 Efficient randomized routing algorithms on the two-dimensional mesh of buses. 227-239 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#IwamaMTT01 http://dx.doi.org/10.1016/S0304-3975(00)00141-9 2003-11-19 A First-Order Syntax for the Pi-Calculus in Isabelle/HOL using Permutations. 2001 58 Electr. Notes Theor. Comput. Sci. 1 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#Rockl01 2003-11-19 Combinatory Weak Reduction in Lambda Calculus. 239-247 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#CagmanH98 http://dx.doi.org/10.1016/S0304-3975(97)00250-8 2003-11-19 The Queue-Read Queue-Write Asynchronous PRAM Model. 3-29 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#GibbonsMR98 http://dx.doi.org/10.1016/S0304-3975(97)00193-X 2003-11-19 Semi-dynamic breadth-first search in digraphs. 201-217 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#FranciosaFG01 http://dx.doi.org/10.1016/S0304-3975(99)00132-2 2003-11-19 Complexity of Boolean Algebras. 221-247 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Kozen80 2003-11-19 Results on the Propositional mu-Calculus. 333-354 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#Kozen83 2003-11-19 Rational Spaces and Set Constraints. 73-94 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#Kozen96 http://dx.doi.org/10.1016/0304-3975(96)00070-9 2003-11-19 Completion for Rewriting Modulo a Congruence. 173-201 1989 67 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#BachmairD89 2003-11-19 Building Exact Computation Sequences. 125-150 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#PelinG87 2003-11-19 A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. 411-440 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Scott93 2003-11-19 Weights for Total Division Orderings on Strings. 345-359 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#Scott94 2003-11-19 The Conjunctive Complexity of Quadratic Boolean Functions. 257-268 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#LenzW91 2003-11-19 Efficient resource management for linear logic proof search. 133-163 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#CervesatoHP00 http://dx.doi.org/10.1016/S0304-3975(99)00173-5 2003-11-19 Scheduling Inverse Trees Under the Communication Model of the LogP-Machine. 137-168 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#MiddendorfLZ99 http://dx.doi.org/10.1016/S0304-3975(97)00161-8 2003-11-19 Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs. 223-232 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Valiev93 2003-11-19 On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code. 225-230 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Margolis82 2003-11-19 On the Randomized Construction of the Delaunay Tree. 339-354 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#BoissonnatT93 2006-04-04 Fast Linear-Space Computations of Longest Common Subsequences. 3-17 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#ApostolicoBG92 2003-11-19 Parallel Detection of all Palindromes in a String. 163-173 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#ApostolicoBG95 http://dx.doi.org/10.1016/0304-3975(94)00083-U 2003-11-19 Pattern Decomposition for Tessellation Automata. 211-226 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#MaruokaKS81 2003-11-19 On Space-Efficient Algorithms for Certain NP-Complete Problems. 311-315 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Ferreira93 2003-11-19 How to Prove Equivalence of Term Rewriting Systems Without Induction. 369-390 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Toyama91 2003-11-19 The limits of fixed-order computation. 465-499 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#SagonasSW01 http://dx.doi.org/10.1016/S0304-3975(99)00341-2 2003-11-19 Weak repetitions in Sturmian strings. 2137-2146 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Karaman03 2003-11-19 Parametrized semantics of logic programs--a unifying framework. 429-447 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00047-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#LoyerSS03 2003-11-19 Dynamical analysis of a class of Euclidean algorithms. 447-486 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00652-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Vallee03 2003-11-19 Deciding bisimulation-like equivalences with finite-state processes. 409-433 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#JancarKM01 http://dx.doi.org/10.1016/S0304-3975(00)00027-X 2005-09-28 Direct and dual laws for automata with multiplicities. 105-120 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#DuchampFLL01 http://dx.doi.org/10.1016/S0304-3975(00)00298-X 2003-11-19 Node rewriting in graphs and hypergraphs: a categorical framework. 463-487 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#BauderonJ01 http://dx.doi.org/10.1016/S0304-3975(00)00200-0 2003-11-19 Uncomputably large integral points on algebraic plane curves? 145-162 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Rojas00 http://dx.doi.org/10.1016/S0304-3975(99)00188-7 2003-11-19 A Convex Geometric Approach to Counting the Roots of a Polynomial System. 105-140 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Rojas94 2003-11-19 Information integration using logical views. 189-210 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Ullman00 http://dx.doi.org/10.1016/S0304-3975(99)00219-4 2003-11-19 Computability Concepts for Programming Language Semantics. 133-145 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#EgliC76 2003-11-19 A Rewrite Mechanism for Logic Programs with Negation. 77-106 1998 192 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#AnantharamanR98 http://dx.doi.org/10.1016/S0304-3975(97)00146-1 2003-11-19 On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. 237-253 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#MonienS82 2003-11-19 Bandwidth Constrained NP-Complete Problems. 141-167 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#MonienS85 2003-11-19 Min Cut is NP-Complete for Edge Weighted Treees. 209-229 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#MonienS88 2003-11-19 On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. 255-267 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#KhullerMV94 2003-11-19 Uniform Generation of a Motzkin Word. 529-536 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Alonso94 2003-11-19 Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons. 291-300 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#SridharHC95 http://dx.doi.org/10.1016/0304-3975(94)00195-O 2003-11-19 Fault tolerant K-center problems. 237-245 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#KhullerPS00 http://dx.doi.org/10.1016/S0304-3975(98)00222-9 2003-11-19 A Unifying View for Logic Programming with Non-Monotonic Reasoning. 1-5 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#BrogiLMM97 http://dx.doi.org/10.1016/S0304-3975(97)80755-4 2004-05-24 A classification of plane and planar 2-trees. 337-363 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00224-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#LabelleLL03 2003-11-19 A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. 77-105 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#ChazelleEGS91 2003-11-19 Graph Theoretical Structures in Logic Programs and Default Theories. 209-244 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#DimopoulosT96 http://dx.doi.org/10.1016/S0304-3975(96)80707-9 2003-11-19 Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. 137-145 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Leung91 2003-11-19 The Undecidability of the Unrestricted Modified Edit Distance. 203-215 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Leung97 http://dx.doi.org/10.1016/S0304-3975(96)00187-9 2003-11-19 A Solution of the Sperner-Erdös Problem. 99-103 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#BerenguerDH82 2003-11-19 The Linear Abstract Machine (Corrigenda). 327-328 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Lafont88a 2003-11-19 Logical Definability on Infinite Traces. 67-84 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#EbingerM96 http://dx.doi.org/10.1016/0304-3975(95)00130-1 2003-11-19 Combinatorial Algorithms - Preface. 241 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Iliopoulos00 http://dx.doi.org/10.1016/S0304-3975(00)00060-8 2003-11-19 Computing in General Abelian Groups is Hard. 81-93 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Iliopoulos85 2003-11-19 On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. 211-222 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Iliopoulos88 2003-11-19 On the variance of the internal path length of generalized digital trees - The Mellin convolution approach. 143-168 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Hubalek00 http://dx.doi.org/10.1016/S0304-3975(98)00213-8 2003-11-19 Self-stabilization of circular arrays of automata. 143-144 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Levin00 http://dx.doi.org/10.1016/S0304-3975(99)00187-5 2003-11-19 Computational Complexity of Functions. 267-271 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Levin96 http://dx.doi.org/10.1016/0304-3975(95)00163-8 2003-11-19 Recognizing Different Types of Beta-Cycles in a Database Scheme. 295-304 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#CheungZ91 2003-11-19 On the Relative Sizes of Learnable Sets. 139-156 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#FortnowFGKKSS98 http://dx.doi.org/10.1016/S0304-3975(97)00175-8 2003-11-25 M. J. Fischer: On the Complexity of 2-Output Boolean Networks. 177-185 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Galbiati81 2003-11-19 Efficient String Matching with k Mismatches. 239-249 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#LandauV86 2003-11-19 Generating Self-Affine Fractals by Collage Grammars. 159-187 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#DrewesHKT95 http://dx.doi.org/10.1016/0304-3975(94)00118-3 2003-11-19 Alarm placement in systems with fault propagation. 269-288 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#LakshmananRR00 http://dx.doi.org/10.1016/S0304-3975(98)90214-6 2003-11-19 On Depth in Edtol Languages. 155-169 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Eisman83 2003-11-19 On the Ratio of Growth Functions in EDT0L Languages. 325-349 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Eisman84 2003-11-19 Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. 89-124 1995 142 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#ProiettiP95 http://dx.doi.org/10.1016/0304-3975(94)00227-A 2003-11-19 Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. 25-42 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#BlumKRV00 http://dx.doi.org/10.1016/S0304-3975(99)00181-4 2003-11-19 A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? 33-40 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#GoldstinePW82 2003-11-19 Constructible complexes and recursive division of posets. 225-237 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Hachimori00 http://dx.doi.org/10.1016/S0304-3975(99)00195-4 2003-11-19 Watson-Crick D0L systems: the power of one transition. 187-200 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00580-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#SalomaaS03 2003-11-19 Alternating finite automata and star-free languages. 167-176 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#SalomaaY00 http://dx.doi.org/10.1016/S0304-3975(98)00047-4 2003-11-19 Decidability of EDT0L structural equivalence. 245-259 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#SalomaaY02 http://dx.doi.org/10.1016/S0304-3975(01)00197-9 2003-11-19 Decidability of Structural Equivalence of E0L Grammars. 131-139 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#SalomaaY91 2003-11-19 Synchronization Expressions with Extended Join Operation. 73-88 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#SalomaaY98 http://dx.doi.org/10.1016/S0304-3975(98)00056-5 2003-11-19 Surface Tree Languages and Parallel Derivation Trees. 9-27 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Engelfriet76 2003-11-19 Iterating Iterated Substitution. 85-100 1977 5 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Engelfriet77 2003-11-19 Determinacy - (Observation Equivalence = Trace Equivalence). 21-25 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Engelfriet85 2003-11-19 A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. 139-150 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Engelfriet91 2003-11-19 A Multiset Semantics for the pi-Calculus with Replication. 65-94 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#Engelfriet96 http://dx.doi.org/10.1016/0304-3975(95)00118-2 2003-11-19 The Undecidability of Simultaneous Rigid E-Unification. 291-300 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#DegtyarevV96 http://dx.doi.org/10.1016/0304-3975(96)00092-8 2003-11-19 A Topological Characterization of Thinning. 31-41 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Ronse86 2003-11-19 Computable Banach Spaces via Domain Theory. 169-184 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#EdalatS99a http://dx.doi.org/10.1016/S0304-3975(98)00288-6 2003-11-19 Refusal Testing. 241-284 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#Phillips87 2003-11-19 Partial Evaluation and omega-Completeness of Algebraic Specifications. 149-167 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Heering86 2003-11-19 Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. 183-220 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Kesner00 http://dx.doi.org/10.1016/S0304-3975(98)00166-2 2003-11-19 Concurrent Realizations of Reactive Systems. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#BednarczykB99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Substitutions and interval exchange transformations of rotation class. 323-344 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#LopezN01 http://dx.doi.org/10.1016/S0304-3975(99)00290-X 2003-11-19 PAC learning with nasty noise. 255-275 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#BshoutyEK02 2003-11-19 Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. 59-71 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#HagiyaRKS02 2003-11-19 Palindrome recognition using a multidimensional tape. 475-480 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(03)00086-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#BiedlBDDHV03 2003-11-19 The Mal'cev Lemma and rewriting on semirings. 611-614 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Sokratova01 http://dx.doi.org/10.1016/S0304-3975(00)00320-0 2003-11-19 Even linear simple matrix languages: formal language properties and grammatical inference. 425-456 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Fernau02 2003-11-19 Identification of function distinguishable languages. 1679-1711 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Fernau03 2003-11-19 Valuations of Languages, with Applications to Fractal Geometry. 177-217 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Fernau95 http://dx.doi.org/10.1016/0304-3975(94)00049-O 2003-11-19 Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. 231-245 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#EiterG93 2003-11-19 On the complexity of data disjunctions. 101-128 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#EiterV02 2003-11-19 On Regular Trace Languages. 59-75 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Sakarovitch87 2003-11-19 A Construction on Finite Automata that has Remained Hidden. 205-231 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Sakarovitch98 http://dx.doi.org/10.1016/S0304-3975(98)00040-1 2003-11-19 On the Existence of Speed-Independent Circuits. 343-364 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#Seger91 2003-11-19 On tiling under tomographic constraints. 2125-2136 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ChrobakCDW03 2003-11-19 Automatic Termination Analysis of Programs Containing Arithmetic Predicates. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#DershowitzLSS99 2003-11-19 A Logical Approach of Petri Net Languages. 155-169 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#ParigotP85 2003-11-19 A Comparison of Compatible, Finite, and Inductive Graph Properties. 145-168 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#HabelKL93 2003-11-19 Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. 97-117 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#MartensSH94 2003-11-19 The word problem for 1LC congruences is NP-hard. 245-268 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00283-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Rosaz03 2003-11-19 Inventories of Unavoidable Languages and the Word-Extension Conjecture. 151-170 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Rosaz98 http://dx.doi.org/10.1016/S0304-3975(97)00031-5 2003-11-19 Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. 33-62 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#HabelKV91 2003-11-19 Correctness of Parallel Programs: The Church-Rosser Approach. 183-207 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Rosen76 2003-11-19 On Tape Bounds for Single Letter Alphabet Language Processing. 213-224 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#HartmanisB76 2003-11-19 Complexity Classes without Machines: On Complete Languages for UP. 129-142 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#HartmanisH88 2003-11-19 Robust Machines Accept Easy Sets. 217-225 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#HartmanisH90 2003-11-19 One-Way Functions and the Nonisomorphism of NP-Complete Sets. 155-163 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#HartmanisH91 2003-11-19 Hybrid Atomicity for Nested Transactions. 151-178 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#FeketeLW95 http://dx.doi.org/10.1016/0304-3975(95)00029-V 2004-02-09 Computation Times of NP Sets of Different Densities. 17-32 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#HartmanisY84 2003-11-19 On the robustness of interconnections in random graphs: a symbolic approach. 515-534 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#FlajoletHNS02 2003-11-19 Is Binary Encoding Appropriate for the Problem-Language Relationship? 337-341 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Megiddo82 2003-11-19 A Simplified Design Strategy for Mapping Image Processing Algorithms on a SIMD Torus. 319-331 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#Seetharaman95 http://dx.doi.org/10.1016/0304-3975(95)95694-F 2003-11-19 Parameter Reduction of Higher Level Grammars. 47-85 1987 55 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Seidl87 2003-11-19 Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. 135-181 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Seidl92 2003-11-19 Finite Tree Automata with Cost Functions. 113-142 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Seidl94 2003-11-19 Terminating left-hand sides of scattered context productions M. Nivat. 423-427 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Meduna00 http://dx.doi.org/10.1016/S0304-3975(99)00292-3 2003-11-19 Massively Parallel Approximation of Irregular Triangular Meshes of Arbitrary Topology with Smooth Parametric Surfaces. 351-369 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Garcia96 http://dx.doi.org/10.1016/0304-3975(95)00037-2 2003-11-19 A Yacc Extension for LRR Grammar Parsing. 91-143 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Seite87 2003-11-19 Authentication tests and the structure of bundles. 333-380 2002 283 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#GuttmanT02 http://dx.doi.org/10.1016/S0304-3975(01)00139-6 2003-11-19 Switchbox Routing in VLSI Design: Closing the Complexity Gap. 31-49 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#HartmannSS98 http://dx.doi.org/10.1016/S0304-3975(97)00286-7 2003-11-19 Positive Rational Sequences. 317-322 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Soittola76 2003-11-19 Introduction: Selected Papers of MFCS 1994. 1 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Rovan96 2003-11-19 Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. 223-243 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00281-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#BonisV03 2003-11-19 Self-stabilizing l-exclusion. 653-692 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#AbrahamDHK01 http://dx.doi.org/10.1016/S0304-3975(00)00325-X 2003-11-19 On Standard Locally Catenative L Schemes. 237-248 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#SekiK91 2003-11-19 Langages Algebriques, Paires Iterantes et Transductions Rationnelles. 209-223 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Boasson76 2003-11-19 Dynamic Analysis of some Relational Databases Parameters. 125-159 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#GardyL95 http://dx.doi.org/10.1016/0304-3975(94)00305-3 2003-11-19 Nonterminal Separation in Graph Grammars. 95-111 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#EngelfrietLR91 2003-11-19 Embedding problems for paths with direction constrained edges. 897-917 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BattistaLLW02 2003-11-19 Notations for exponentiation. 3-19 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#Beckmann02 2003-11-19 Over Testable Languages. 157-190 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Selmi96 http://dx.doi.org/10.1016/0304-3975(95)00100-X 2003-11-19 <i>Corrigenda:</i>Pushdown Machines for the Macro Tree Tranducer. 339 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#EngelfrietV86a 2003-11-19 On the structure of minimum broadcast digraphs. 203-216 2000 245 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#Fertin00 http://dx.doi.org/10.1016/S0304-3975(99)00282-0 2003-11-19 A Context Dependent Equivalence Between Processes. 184-215 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Larsen87 2003-11-19 Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion. 265-288 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Larsen90 2003-11-19 The Expressive Power of Implicit Specifications. 119-147 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Larsen93 2003-11-19 Approximation of Nonlinear Dynamic Systems by Rational Series. 151-162 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#HespelJ91 2003-11-19 Negation in Rule-Based Database Languages: A Survey. 3-83 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Bidoit91 2003-11-19 From bidirectionality to alternation. 295-321 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00410-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#PitermanV03 2003-11-19 On the lattice of prefix codes. 755-782 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#RestivoS02 2003-11-19 The Semantics of Incomplete Databases as an Expression of Preferences. 113-136 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Royer91 2003-11-19 Higher-Order Unification via Combinators. 273-298 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Dougherty93 2003-11-19 Complexity and Decidability for Chain Code Picture Languages. 173-202 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#SudboroughW85 2003-11-19 A comparison of three authentication properties. 285-327 2003 291 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#FocardiGM03 2003-11-19 Guarded Repair of Dependable Systems. 179-210 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#MeerTC94 2003-11-19 Hypothetical Datalog: Complexity and Expressibility. 3-51 1990 76 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Bonner90 2003-11-19 On Models for Propositional Dynamic Logic. 181-203 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#KnijnenburgL91 2003-11-19 Conceptual Level Concurrency Control of Relational Update Transactions. 1-42 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#VianuV92 2003-11-19 Local Constraints in Programming Languages Part I: Syntax. 265-290 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#JoshiLY80 2003-11-19 A Sublinear Parallel Algorithm for Some Dynamic Programming Problems. 361-371 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#HuangLV92 2003-11-19 Complete Systems of B-Rational Identities. 207-343 1991 89 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#Krob91a 2003-11-19 The Covering and Boundedness Problems for Vector Addition Systems. 223-231 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Rackoff78 2003-11-19 An Algebra of Concurrent Non-Deterministic Processes. 151-170 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#CherkasovaK91 2003-11-19 On the Representation of Finite Deterministic 2-Tape Automata. 1-63 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#PelletierS99 http://dx.doi.org/10.1016/S0304-3975(98)00179-0 2003-11-19 Computational and Attribute Models of Formal Languages. 241-264 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Penjam90 2003-11-19 Dynamic algorithms for classes of constraint satisfaction problems. 287-305 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#FrigioniMN01 http://dx.doi.org/10.1016/S0304-3975(00)00013-X 2003-11-19 Lambda Abstraction Algebras: Representation Theorems. 5-52 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#PigozziS95 http://dx.doi.org/10.1016/0304-3975(94)00203-U 2003-11-19 On the distribution of integer points on curves of genus zero. 163-170 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Silverman00 http://dx.doi.org/10.1016/S0304-3975(99)00189-9 2003-11-19 Any Iteration for Polynomial Equations Using Linear Information has Infinite Complexity. 195-208 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Wasilkowski83 2003-11-19 INTEX: An FST Toolbox. 33-46 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Silberztein00 http://dx.doi.org/10.1016/S0304-3975(99)00015-8 2003-11-19 Une équivalence sur les lambda-termes. 281-292 1994 126 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Regnier94 2003-11-19 The ultimate strategy to search on m rays? 267-295 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Lopez-OrtizS01 http://dx.doi.org/10.1016/S0304-3975(00)00144-4 2003-11-19 Approximation algorithms for routing and call scheduling in all-optical chains and rings. 429-448 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#BecchettiIM02 2003-11-19 Oracle Computations in Parallel Numerical Linear Algebra. 99-121 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#CodenottiLR94 2003-11-19 Computations in APS. 145-171 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#LetichevskyKK93 2003-11-19 Toward an Abstract Theory of Data Compression. 221-237 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Storer83 2003-11-19 Some structural properties of low-rank matrices related to computational complexity. 89-107 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#CodenottiPR00 http://dx.doi.org/10.1016/S0304-3975(99)00185-1 2003-11-19 Non-Recursiveness of the Operations on Real Numbers. 425-429 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Skandalis90 2003-11-19 exists-Universal termination of logic programs. 273-296 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Ruggieri01 http://dx.doi.org/10.1016/S0304-3975(99)00155-3 2003-11-19 Static and dynamic low-congested interval routing schemes. 315-354 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#CiceroneSF02 http://dx.doi.org/10.1016/S0304-3975(01)00279-1 2003-11-19 Lower Bounds for the Complexity of Polynomials. 15-23 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Stoss89a 2006-05-02 Upper semi-lattice of binary strings with the relation "x is simple conditional to y". 69-95 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#ChernovMRSV02 http://dx.doi.org/10.1016/S0304-3975(01)00032-9 2003-11-19 An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time. 93-104 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#NiederreiterV99 http://dx.doi.org/10.1016/S0304-3975(99)00067-5 2003-11-19 Attributed Tree Grammars. 3-22 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Barbar93 2003-11-19 Symmetries of decimation invariant sequences and digit sets. 105-136 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BarbeH02 2003-11-19 Decimation-invariant sequences and their automaticity. 379-403 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#BarbeS01 http://dx.doi.org/10.1016/S0304-3975(00)00021-9 2003-11-19 Monadic Thue Systems. 231-251 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#BookJW82 2003-11-19 Preface. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#HofmannRP99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Approximate reasoning by similarity-based SLD resolution. 389-426 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Sessa02 http://dx.doi.org/10.1016/S0304-3975(01)00188-8 2003-11-19 Iterative Belief Revision in Extended Logic Programming. 383-406 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#YouCL96 http://dx.doi.org/10.1016/S0304-3975(96)80712-2 2003-11-19 Pebble Games for Studying Storage Sharing. 69-84 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Sethi82 2003-11-19 On the Verifiability of Two-Party Algebraic Protocols. 101-130 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#BookO85a 2003-11-19 The continuum as a final coalgebra. 105-122 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#PavlovicP02 http://dx.doi.org/10.1016/S0304-3975(01)00022-6 2003-11-19 Turing Machines with Linear Alternation, Theories of Bounded Concatenation and the Decision Problem of First Order Theories. 333-337 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Volger83 2003-11-19 Complete Semi-Thue Systems for Abelian Groups. 199-208 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Diekert86 2003-11-19 On the Knuth-Bendix Completion for Concurrent Processes. 117-136 1989 66 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Diekert89 2003-11-19 Word Problems Over Traces which are Solvable in Linear Time. 3-18 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Diekert90 2003-11-19 Möbius Functions and Confluent Semi-Commutations. 25-43 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Diekert93 2003-11-19 A Partial Trace Semantics for Petri Nets. 87-105 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Diekert94 2003-12-01 Reachability problems for sequential dynamical systems with threshold functions. 41-64 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00395-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#BarrettHMRRS03 2003-11-19 Unambiguous Computations and Locally Definable Acceptance Types. 137-161 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#NiedermeierR98 http://dx.doi.org/10.1016/S0304-3975(97)00005-4 2003-11-19 Coalgebra morphisms subsume open maps. 123-135 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#Lasota02 http://dx.doi.org/10.1016/S0304-3975(01)00023-8 2003-12-19 Maude: specification and programming in rewriting logic. 187-243 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#ClavelDELMMQ02 http://dx.doi.org/10.1016/S0304-3975(01)00359-0 2003-11-19 Sur l'équivalence de descriptions de figures itérées. 325-354 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Morcrette96 http://dx.doi.org/10.1016/0304-3975(96)00226-5 2003-11-19 Time-Based Expressivity of Time Petri Nets for System Specification. 1-53 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#CeroneM99 http://dx.doi.org/10.1016/S0304-3975(98)00008-5 2003-11-19 An Axiomatization of the Algebra of Petri Net Concatenable Processes. 277-296 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Sassone96 http://dx.doi.org/10.1016/S0304-3975(96)80709-2 2003-11-19 Counting Classes: Thresholds, Parity, Mods, and Fewness. 3-23 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#BeigelG92 2003-11-19 Inductive-data-type systems. 41-68 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#BlanquiJO02 http://dx.doi.org/10.1016/S0304-3975(00)00347-9 2003-11-19 Automaticity of Double Sequences Generated by One-Dimensional Linear Cellular Automata. 195-209 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#AlloucheHPPS97 http://dx.doi.org/10.1016/S0304-3975(96)00298-8 2003-11-19 The consistency dimension and distribution-dependent learning from queries. 197-215 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#BalcazarCGS02 2003-11-19 Viability in Hybrid Systems. 141-168 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#KohnNRY95 http://dx.doi.org/10.1016/0304-3975(94)00150-H 2003-11-19 Motif statistics. 593-617 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#NicodemeSF02 2003-11-19 Certifying Term Rewriting Proofs in ELAN. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#Nguyen01a 2003-11-19 A Dual Problem to Least Fixed Points. 211-221 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#NguyenL81 2003-11-19 Solution of David Gale's lion and man problem. 663-670 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Sgall01 http://dx.doi.org/10.1016/S0304-3975(00)00411-4 2003-11-19 On Some Equations in Free Partially Commutative Monoids. 159-174 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#Duboc86 2003-11-19 On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields. 151-164 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#ClausenDGK91 2003-11-19 Higher-Order Subtyping. 235-282 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#PierceS97 http://dx.doi.org/10.1016/S0304-3975(96)00096-5 2003-11-19 Efficient CRCW-PRAM Algorithms for Universal Substring Searching. 331-344 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Apostolico93 2003-11-19 Simple and flexible detection of contiguous repeats using a suffix tree. 843-856 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#StoyeG02 http://dx.doi.org/10.1016/S0304-3975(01)00121-9 2003-11-19 Continuation-based transformations for coordination languages. 117-146 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#Jagannathan00 http://dx.doi.org/10.1016/S0304-3975(99)00229-7 2003-11-19 Restructuring Hierarchical Database Objects. 3-38 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#AbiteboulH88 2004-02-03 Computational topology: ambient isotopic approximation of 2-manifolds. 3-15 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00691-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#AmentaPR03 2003-11-19 Interpolation functor and computability. 487-498 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Yoshikawa02 http://dx.doi.org/10.1016/S0304-3975(01)00106-2 2003-11-19 Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog. 137-158 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#AbiteboulS91 2003-11-19 Queries and computation on the web. 231-255 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#AbiteboulV00 http://dx.doi.org/10.1016/S0304-3975(99)00221-2 2003-11-19 On Guarded Recursion. 403-408 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#BadouelD91 2003-11-19 Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. 307-314 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#AndreevCR96 http://dx.doi.org/10.1016/0304-3975(96)00014-X 2003-11-19 Optimal Bounds for the Approximation of Boolean Functions and Some Applications. 243-268 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#AndreevCR97 http://dx.doi.org/10.1016/S0304-3975(96)00217-4 2003-11-19 Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. 3-18 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#AndreevCR99 http://dx.doi.org/10.1016/S0304-3975(99)00024-9 2003-11-19 Examples of Undecidable Problems for 2-Generator Matrix Semigroups. 29-34 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#CassaigneK98 http://dx.doi.org/10.1016/S0304-3975(98)00029-2 2003-11-19 Modern Algebra - Foreword. 1 2000 249 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#KeimelMT00 http://dx.doi.org/10.1016/S0304-3975(00)00055-4 2003-11-19 Models of Lower-Bounds Proofs. 239-249 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Nigmatullin87 2005-11-18 A new method to obtain lower bounds for polynomial evaluation. 577-596 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#AldazMMP01 http://dx.doi.org/10.1016/S0304-3975(00)00149-3 2003-11-19 Reductions Among Polynomial Isomorphism Types. 207-224 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#MahaneyY85 2003-11-19 <i>Z</i>-Rational Functions and D0L Equivalence. 283-292 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Ruohonen76 2003-11-19 On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices. 377-384 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Ruohonen79 2003-11-19 On Equality of Multiplicity Sets of Regular Languages. 113-117 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Ruohonen85 2003-11-19 Confluence by Decreasing Diagrams. 259-280 1994 126 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Oostrom94 2003-11-19 Developing Developments. 159-181 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Oostrom97 http://dx.doi.org/10.1016/S0304-3975(96)00173-9 2003-11-19 Processes are in the Eye of the Beholder. 333-351 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#Lamport97 http://dx.doi.org/10.1016/S0304-3975(96)00153-3 2003-11-19 Proving Possibility Properties. 341-352 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Lamport98 http://dx.doi.org/10.1016/S0304-3975(98)00129-7 2003-11-19 Generating Power of Lazy Semantics. 203-219 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Karczmarczuk97 http://dx.doi.org/10.1016/S0304-3975(97)00065-0 2003-11-19 Syntactic Control of Interference Revisited. 211-252 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#OHearnPTT99 http://dx.doi.org/10.1016/S0304-3975(98)00359-4 2003-11-19 Strong Surjectivity is Equivalent to C-Injectivity. 269-277 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#MaruokaK82 2003-11-19 A Computational Model for Metric Spaces. 53-73 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#EdalatH98 http://dx.doi.org/10.1016/S0304-3975(96)00243-5 2003-11-19 Foundation of a computable solid modelling. 319-345 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#EdalatL02 http://dx.doi.org/10.1016/S0304-3975(01)00091-3 2003-11-19 I-Categories as a Framework for Solving Domain Equations. 77-106 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#EdalatS93 2003-11-19 A Domain-Theoretic Approach to Computability on the Real Line. 73-98 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#EdalatS99 http://dx.doi.org/10.1016/S0304-3975(98)00097-8 2003-11-19 On maximal suffixes, constant-space linear-time versions of KMP algorithm. 763-774 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00590-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Rytter03a 2003-11-19 Recursive Programming with Proofs. 335-336 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Parigot92 2003-11-19 A Characterization of Reversal-Bounded Multipushdown Machine Languages. 341-344 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#RytterC85 2003-11-19 Optimal Parallel Parsing of Bracket Languages. 295-306 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#RytterG87 2003-11-19 Some first-order probability logics. 191-212 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#OgnjanovicR00 http://dx.doi.org/10.1016/S0304-3975(98)00341-7 2003-11-19 Computing Abstract Decorations of Parse Forests Using Dynamic Programming and Algebraic Power Series. 145-166 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Tendeau98 http://dx.doi.org/10.1016/S0304-3975(97)00271-5 2003-11-19 Exponential Upper and Lower Bounds for the Order of a Regular Language. 253-262 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Weber94a 2003-11-19 On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages. 225-228 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#OkawaHY86 2003-11-19 On the Degree of Ambiguity of Finite Automata. 325-349 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#WeberS91 2003-11-19 The expressiveness of DAC. 3-32 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#AfratiGR02 http://dx.doi.org/10.1016/S0304-3975(01)00232-8 2003-11-19 Linearisability on datalog programs. 199-226 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00730-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#AfratiGT03 2003-11-19 A Solution for the Coloured Cubes Problem. 171-176 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#BasartG99 http://dx.doi.org/10.1016/S0304-3975(98)00335-1 2003-11-19 Domain Theory and Integration. 163-193 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Edalat95 http://dx.doi.org/10.1016/0304-3975(95)00050-7 2003-11-19 Homomorphic characterizations of recursively enumerable languages with very small language classes. 55-69 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#OkawaH01 http://dx.doi.org/10.1016/S0304-3975(99)00110-3 2003-11-19 Relations Among Mod-Classes. 325-328 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Hertrampf90 2003-11-19 Cyclic Automata. 307-317 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Garzon87 2003-11-19 Cayley Automata. 83-102 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Garzon93 2003-11-19 A generalization of diagonal flips in a convex polygon. 271-282 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Nakamigawa00 http://dx.doi.org/10.1016/S0304-3975(99)00199-1 2003-11-19 Edge and node searching problems on trees. 429-446 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#PengHHKT00 http://dx.doi.org/10.1016/S0304-3975(99)00241-8 2003-11-19 The Möbius Function of Factor Order. 91-98 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Bjorner93 2003-11-19 Une Nouvelle C beta-Réduction dans la Logique Combinatoire. 151-163 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Mezghiche84 2003-11-19 On Pseudo-c-beta-Normal Form in Combinatory Logic. 323-331 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Mezghiche89 2003-11-19 Weak Completeness of Type Assignment in lambda-Calculus Models: A Generalization of Hindley's Result. 203-208 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Mezghiche91 2003-11-19 c-beta-Machine with lambda-beta-Reduction. 221-228 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#Mezghiche97 http://dx.doi.org/10.1016/S0304-3975(97)00040-6 2003-11-19 Skew Power Series Rings with General Commutation Formula. 99-114 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Dumas92 2003-11-19 Subtyping dependent types. 273-309 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#AspinallC01 http://dx.doi.org/10.1016/S0304-3975(00)00175-4 2003-11-19 Some Combinatorial Aspects of Congruence Lattice Representations. 291-300 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#GratzerS99 http://dx.doi.org/10.1016/S0304-3975(98)00276-X 2003-11-19 Determinism in Parallel Systems. 225-231 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Rajlich83 2003-11-19 Advanced elementary formal systems. 51-70 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00418-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#LangeGJ03 2003-11-19 A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces. 81-90 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Gurvits01 http://dx.doi.org/10.1016/S0304-3975(00)00134-1 2003-11-19 On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. 137-156 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#KrauseP97 http://dx.doi.org/10.1016/S0304-3975(96)00019-9 2003-11-19 Abstract Commands: a Uniform Notation for Specification and Implementation. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#Dunne01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 The Complexity of Central Slice Functions. 247-257 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Dunne86 2003-11-19 On Monotone Simulations of Nonmonotone Networks. 15-25 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Dunne89 2003-11-19 Reconstruction of convex 2D discrete sets in polynomial time. 223-242 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#KubaB02 http://dx.doi.org/10.1016/S0304-3975(01)00080-9 2003-11-19 An Optimal Absorbing List Organization Strategy with Constant Memory Requirements. 355-361 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#OommenN93 2003-11-19 Factoring Polynomials and Primitive Elements for Special Primes. 77-89 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Gathen87 2003-11-19 Monotonic and Dual Monotonic Language Learning. 365-410 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#LangeZK96 http://dx.doi.org/10.1016/0304-3975(95)00284-7 2003-11-19 On-Line Learning of Smooth Functions of a Single Variable. 141-156 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#KimberL95 http://dx.doi.org/10.1016/0304-3975(95)00021-N 2003-11-19 A Remark on a Paper by Armando B. Matos. 329-330 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#Petersen95 http://dx.doi.org/10.1016/0304-3975(94)00217-7 2003-11-19 On the Language of Primitive Words. 141-156 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Petersen96 http://dx.doi.org/10.1016/0304-3975(95)00098-4 2003-11-19 A Polynomial Determination of the Most-Recent Property in Pascal-Like Programs. 3-15 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Armbruster88 2003-11-19 Computability and Decidability Issues in the Theory of Consistency Enforcement. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#LinkS01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 <i>(k)</i>Grammars. 321-349 1977 4 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#OlshanskyP77 2003-11-19 <i>omega</i>-Context-Free Languages. 83-98 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Linna77 2003-11-19 Un Modèle Asynchrone pour les Systèmes Distribués. 121-162 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Gastin90 2003-11-19 Compact factors of countable state Markov shifts. 935-946 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#FiebigF02 http://dx.doi.org/10.1016/S0304-3975(01)00105-0 2003-11-19 Separation of Deterministic, Nondeterministic and Alternating Complexity Classes. 297-311 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#BebjakS91 2003-11-19 Type 2 Computational Complexity of Functions on Cantor's Space. 1-18 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#WeihrauchK91 2003-11-19 Embedding Metric Spaces Into CPO's. 5-24 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#WeihrauchS81 2003-11-19 Admissible Representations of Effective CPO's. 131-147 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#WeihrauchS83 2003-11-19 Computability on continuous, lower semi-continuous and upper semi-continuous real functions. 109-133 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#WeihrauchZ00 http://dx.doi.org/10.1016/S0304-3975(98)00045-0 2003-11-19 Bisimilarity as a Theory of Functional Programming. 5-47 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#Gordon99 http://dx.doi.org/10.1016/S0304-3975(98)00353-3 2003-11-19 Effectiveness of the Global Modulus of Continuity on Metric Spaces. 439-450 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#WeihrauchZ99 http://dx.doi.org/10.1016/S0304-3975(98)00299-0 2003-11-19 An Equational Axiomatization of Systolic Systems. 265-289 1987 55 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Bartha87 2003-11-19 Foundations of a Theory of Synchronous Systems. 325-346 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Bartha92 2003-11-19 Efficient Enumeration of all Minimal Separators in a Graph. 169-180 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#ShenL97 http://dx.doi.org/10.1016/S0304-3975(97)83809-1 2003-11-19 Monadic Partition Logics and Finite Automata. 63-81 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#ShenT96 http://dx.doi.org/10.1016/0304-3975(95)00113-1 2003-11-19 On the equational definition of the least prefixed point. 341-370 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00412-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Santocanale03 2003-11-19 Logical operations and Kolmogorov complexity. 125-129 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#ShenV02 http://dx.doi.org/10.1016/S0304-3975(01)00035-4 2003-11-19 sigma-Game, sigma+-Game, and Two-Dimensional Additive Cellular Automata. 349-366 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#BaruaR96 http://dx.doi.org/10.1016/0304-3975(95)00091-7 2003-11-19 2-Role assignments on triangulated graphs. 201-214 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00084-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Sheng03 2003-11-19 A Short, Elementary and Easy WZ Proof of the Askey-Gasper Inequality That was Used by de Branges in his Proof of the Bieberbach Conjecture. 199-202 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Ekhad93 2005-07-25 On local transformation of polygons with visibility properties. 919-937 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#HernandoHH02 2003-11-19 Operational and Denotational Semantics for the Box Algebra. 1-83 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#KoutnyB99 http://dx.doi.org/10.1016/S0304-3975(97)00180-1 2003-11-19 Rational Index of Context-Free Languages in exp Theta(p root n) and n^(Theta((ln n)^(1/p))). 185-204 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#PierreF88 2003-11-19 Rounding Voronoi diagram. 203-221 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#DevillersG02 http://dx.doi.org/10.1016/S0304-3975(01)00076-7 2004-02-17 On the computational complexity of infinite words. 141-151 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00400-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#DuriM03 2003-11-19 On the Shrinkage Exponent for Read-Once Formulae. 269-282 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#HastadRY95 http://dx.doi.org/10.1016/0304-3975(94)00081-S 2003-11-19 Infinite Normal Forms for Non-Linear Term Rewritting Systems. 285-303 1995 152 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#InverardiN95a http://dx.doi.org/10.1016/0304-3975(94)00244-6 2003-11-19 Minimal Pairs of Polynomial Degrees with Subexponential Complexity. 73-76 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Machtey76 2003-11-19 Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. 139-159 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Ablayev96 http://dx.doi.org/10.1016/0304-3975(95)00157-3 2003-11-19 Communication Complexity of PRAMs. 3-28 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#AggarwalCS90 2003-11-19 An induction principle for pure type systems. 773-818 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#BartheHS01 http://dx.doi.org/10.1016/S0304-3975(00)00373-X 2003-11-19 Learning Orthogonal F-Horn Formulas. 177-190 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#TakimotoMMS97 http://dx.doi.org/10.1016/S0304-3975(97)00020-0 2003-11-19 Comparing logics for rewriting: rewriting logic, action calculi and tile logic. 319-358 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#GadducciM02 http://dx.doi.org/10.1016/S0304-3975(01)00362-0 2003-11-19 A New Planarity Test. 179-191 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#ShihH99 http://dx.doi.org/10.1016/S0304-3975(98)00120-0 2003-11-19 Refinement of Events in the Development of Real-Time Distributed Systems. 341-359 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Ramanathan94 2003-11-19 On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. 117-141 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#DemangeP96 http://dx.doi.org/10.1016/0304-3975(95)00060-7 2003-11-19 Periodes et Repetitions des Mots du Monoide Libre. 17-26 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Duval79 2003-11-19 Génération d'une Section des Classes de Conjugaison et Arbre des Mots de Lyndon de Longueur Bornée. 255-283 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#Duval88 2003-11-19 Périodes locales et propagation de périodes dans un mot. 87-98 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Duval98 http://dx.doi.org/10.1016/S0304-3975(98)00033-4 2003-11-19 Languages Recognized by Finite Aperiodic Groupoids. 299-317 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Beaudry98 http://dx.doi.org/10.1016/S0304-3975(97)00119-9 2003-11-19 A Simple Proof of a Theorem of Statman. 387-394 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Mairson92 2003-11-19 Position-Restricted Grammar Forms and Grammars. 1-27 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#BlattnerG82 2003-11-19 Matrix Systems and Principal Cones of Algebraic Power Series. 147-152 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Kuich88 2003-11-19 Automata and Languages Generalized to omega-Continuous Semirings. 137-150 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Kuich91 2003-11-19 Preface 195-196 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#WatanabeS02 2003-11-19 On Rational Definitions in Complete Algebras without Rank. 281-313 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Indermark82 2003-11-19 Parallel High-Level Replacement Systems. 43-81 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#Taentzer97 http://dx.doi.org/10.1016/S0304-3975(96)00215-0 2003-11-19 The Qu-Prolog Unification Algorithm: Formalisation and Correctness. 81-112 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#NickolasR96 http://dx.doi.org/10.1016/S0304-3975(96)00115-6 2003-11-19 On Hadamard square roots of unity. 447-454 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Litow00 http://dx.doi.org/10.1016/S0304-3975(99)00327-8 2003-11-19 A Context-Free Language Decision Problem. 339-343 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Litow94 2003-11-19 Fast Uniform Generation of Regular Graphs. 91-100 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#JerrumS90 2003-11-19 Complexité du Calcul du Développement d'un Nombre Réel en Fractions Continues. 219-235 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Labhalla91 2003-11-19 Normal forms of quasiperiodic strings. 313-324 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Mouchard00 http://dx.doi.org/10.1016/S0304-3975(00)00065-7 2003-11-19 Improved Shortest Path Algorithms for Nearly Acyclic Graphs. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#SaundersT01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Improved shortest path algorithms for nearly acyclic graphs. 535-556 2003 293 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#SaundersT03 2003-11-19 Substitutions et beta-systèmes de numération. 219-236 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Fabre95 http://dx.doi.org/10.1016/0304-3975(95)91132-A 2003-11-19 Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot. 65-79 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Fabre96 http://dx.doi.org/10.1016/0304-3975(95)00042-9 2003-11-19 Number conserving cellular automata II: dynamics. 269-290 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00134-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#FormentiG03 2003-11-19 Automated techniques for provably safe mobile code. 1175-1199 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ColbyCHLP03 2003-11-19 Transformations that Preserve Malignness of Universal Distributions. 289-306 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Kobayashi97a http://dx.doi.org/10.1016/S0304-3975(96)00275-7 2003-11-19 Repetitiveness of languages generated by morphisms. 337-378 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#KobayashiO00 http://dx.doi.org/10.1016/S0304-3975(99)00238-8 2003-11-19 Multiple splicing systems and the universal computability. 3-23 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#KobayashiS01 http://dx.doi.org/10.1016/S0304-3975(00)00211-5 2003-11-19 Realizability Interpretation of Generalized Inductive Definitions. 121-138 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#KobayashiT94 2003-11-19 Learning Approximately Regular Languages with Reversible Languages. 251-257 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#KobayashiY97 http://dx.doi.org/10.1016/S0304-3975(96)00224-1 2003-11-19 Debugging Prolog Using Annotations. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Kulas99 2003-11-19 Computational Indistinguishability: Algorithms vs. Circuits. 215-218 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#GoldreichM98 http://dx.doi.org/10.1016/S0304-3975(97)00162-X 2003-11-19 Preface to the Special Issue on the 1995 Latin American Theoretical Informatics Symposium. 1-2 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Baeza-YatesG97 http://dx.doi.org/10.1016/S0304-3975(96)00258-7 2003-11-19 Average Running Time of the Boyer-Moore-Horspool Algorithm. 19-31 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Baeza-YatesR92 2003-11-19 Confluent Linear Numeration Systems. 183-219 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Frougny92a 2003-11-19 New approximation algorithm for RTILE problem. 517-537 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00504-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#LorysP03 2003-11-19 Synchronized Rational Relations of Finite and Infinite Words. 45-82 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#FrougnyS93 2003-11-19 Synchronisation déterministe des automates à délai borné. 61-77 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#FrougnyS98 http://dx.doi.org/10.1016/S0304-3975(96)00305-2 2003-11-19 Off-line temporary tasks assignment. 419-428 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#AzarRSW02 2003-11-19 Encoding transition systems in sequent calculus. 411-437 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#McDowellMP03 2003-11-19 Generating Hamiltonian Circuits without Backtracking from Errors. 347-375 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#ShufeltB94 2003-11-19 The Bulk-Synchronous Parallel Random Access Machine. 109-130 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#Tiskin98 http://dx.doi.org/10.1016/S0304-3975(97)00197-7 2003-11-19 Information Systems for Continuous Posets. 201-229 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Vickers93 2003-11-19 Cut Elimination and Automatic Proof Procedures. 265-284 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Zhang91 2003-11-19 Stable Neighbourboods. 143-157 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Zhang92 2003-11-19 Cut-Formulas in Propositional Logic. 157-168 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Zhang93 2003-11-19 Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut Formulas. 193-206 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Zhang94 2003-11-19 On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences. 353-362 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Zhang95 http://dx.doi.org/10.1016/0304-3975(94)00257-J 2003-11-19 Quasi-Prime Algebraic Domains. 221-264 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Zhang96 http://dx.doi.org/10.1016/0304-3975(95)00133-6 2003-11-19 Specifying Causality in Action Theories: A Default Logic Approach. 489-513 1999 220 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#Zhang99 http://dx.doi.org/10.1016/S0304-3975(99)00011-0 2003-11-19 Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. 287-300 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Kundu91 2003-11-19 A Linear Speed-Up Theorem for Cellular Automata. 59-98 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#MazoyerR92 2003-11-19 Signals in One-Dimensional Cellular Automata. 53-80 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#MazoyerT99 http://dx.doi.org/10.1016/S0304-3975(98)00150-9 2003-11-19 Online paging and file caching with expiration times. 119-131 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Kimbrel01 http://dx.doi.org/10.1016/S0304-3975(00)00263-2 2003-11-19 Composing leads-to properties. 339-361 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#MeierS00 http://dx.doi.org/10.1016/S0304-3975(98)00233-3 2003-11-19 PSPACE-complete problems for subgroups of free groups and inverse finite automata. 247-281 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#BirgetMMW00 http://dx.doi.org/10.1016/S0304-3975(98)00225-4 2003-11-19 The Complexity of Grigorchuk Groups with Application to Cryptography. 83-98 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#GarzonZ91 2003-11-19 On Bisimulations for the Asynchronous pi-Calculus. 291-324 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#AmadioCS98 http://dx.doi.org/10.1016/S0304-3975(97)00223-5 2003-11-19 Entailment-Based Actions for Coordination. 259-286 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#MonteiroP98 http://dx.doi.org/10.1016/S0304-3975(97)00152-7 2003-11-19 Legality Concepts for Three-Valued Logic Programs. 45-68 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#NotaOPRT93 2003-11-19 Games and total Datalog¬ queries. 257-276 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#FlumKL00 http://dx.doi.org/10.1016/S0304-3975(99)00222-4 2003-11-19 Sur les Relations Rationnelles Entre Monoides Libres. 243-259 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Schutzenberger76 2003-11-19 Sur une Variante des Fonctions Sequentielles. 47-57 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Schutzenberger77 2003-11-19 Counting with Rational Functions. 81-101 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Schutzenberger88 2003-11-19 Finite-Model Theory - A Personal Perspective. 3-31 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#Fagin93 2003-11-19 On the Inductive Inference of Recursive Real-Valued Functions. 3-17 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#ApsitisAFHS99 http://dx.doi.org/10.1016/S0304-3975(98)00281-3 2003-11-19 Fixed Point Characterization of Infinite Behavior of Finite-State Systems. 1-69 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#Niwinski97 http://dx.doi.org/10.1016/S0304-3975(97)00039-X 2003-11-19 Guthrie's Problem: New Equivalences and Rapid Reductions. 3-22 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#CzumajG96 http://dx.doi.org/10.1016/0304-3975(95)00126-3 2003-11-19 On the symbolic reduction of processes with cryptographic functions. 695-740 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#AmadioLV03 2003-11-19 Standard Automata and Semidirect Products of Transformation Semigroups. 151-171 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Kunze93 2003-11-19 Optimization Complexity of Linear Logic Proof Games. 299-331 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#LincolnMS99 http://dx.doi.org/10.1016/S0304-3975(99)00057-2 2003-11-19 Strand design for biomolecular computation. 39-58 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#BrennemanC02 2003-11-19 Analysis of Petri Nets by Partitioning: Splitting Transitions. 321-330 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Fahmy90 2003-11-19 Decision tree approximations of Boolean functions. 609-623 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#MehtaR02 http://dx.doi.org/10.1016/S0304-3975(01)00011-1 2003-11-19 The closure properties on real numbers under limits and computable operators. 499-518 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Zheng02 http://dx.doi.org/10.1016/S0304-3975(01)00107-4 2003-11-19 Multi-Pattern Languages. 253-268 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#KariMPS95 http://dx.doi.org/10.1016/0304-3975(94)00087-Y 2003-11-19 ⁰Instructions Only. 337-344 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#AnderssonMT99 http://dx.doi.org/10.1016/S0304-3975(98)00172-8 2003-11-19 Finite-state analysis of two contract signing protocols. 419-450 2002 283 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#ShmatikovM02 http://dx.doi.org/10.1016/S0304-3975(01)00141-4 2003-11-19 Restriction, Terms and Nonlinearity of Boolean Functions. 207-223 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#ZhengZI99 http://dx.doi.org/10.1016/S0304-3975(99)00073-0 2003-11-19 Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks. 3-30 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#AguileraCT99 http://dx.doi.org/10.1016/S0304-3975(98)00235-7 2003-11-19 De la logique aux pavages. 311-324 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Durand02a http://dx.doi.org/10.1016/S0304-3975(02)00018-X 2003-11-19 On the Complexity of Deadlock Detection in Families of Planar Nets. 225-237 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#DurandF99 http://dx.doi.org/10.1016/S0304-3975(97)00185-0 2003-11-19 Comparison between the complexity of a function and the complexity of its graph. 37-46 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#DurandP02 http://dx.doi.org/10.1016/S0304-3975(01)00029-9 2003-11-19 First-Order Spectra with one Binary Predicate. 305-320 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#DurandR96 http://dx.doi.org/10.1016/0304-3975(95)00112-3 2003-11-19 Applicability of a Production in a Categorical Grammar. 37-44 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Kurka80 2003-11-19 Ergodic Languages. 351-355 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Kurka82 2003-11-19 Regular Unimodal Systems and Factors of Finite Automata. 49-64 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Kurka94 2003-11-19 On Topological Dynamics of Turing Machines. 203-216 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Kurka97 http://dx.doi.org/10.1016/S0304-3975(96)00025-4 2003-11-19 The Typed lambda-Calculus is not Elementary Recursive. 73-81 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Statman79a 2003-11-19 Rationality of the Möbius Function of Subword Order. 53-63 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#BjornerR92 2003-11-19 Complexity of Bezout's Theorem V: Polynomial Time. 141-164 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#ShubS94 2003-11-19 Additives of linear logic and normalization - Part I: a (restricted) Church-Rosser property. 489-524 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Falco03 2003-11-19 Towards a language theory for infinite N-free pomsets. 347-386 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00370-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Kuske03 2003-11-19 On institutions for modular coalgebraic specifications. 69-103 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#KurzH02 http://dx.doi.org/10.1016/S0304-3975(01)00021-4 2003-11-19 Restrictions of Graph Partition Problems. Part I. 93-109 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#BodlaenderJ95 http://dx.doi.org/10.1016/0304-3975(95)00057-4 2003-11-19 The Complexity of Coloring Games on Perfect Graphs. 309-326 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#BodlaenderK92 2003-11-19 Inplace run-length 2d compressed search. 1361-1383 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#AmirLS03 2003-11-19 On Multiple Context-Free Grammars. 191-229 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#SekiMFK91 2003-11-19 The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. 271-290 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#DietzfelbingerM93 2003-11-19 Complexity in Mechanized Hypothesis Formation. 203-225 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#PudlakS79 2003-11-19 Knuth-Bendix Completion for Non-Symmetric Transitive Relations. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#Struth01 2003-11-19 Quantifier rank for parity of embedded finite models. 153-169 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00401-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Fournier03a 2003-11-19 The Equivalence in the DCP Model. 97-114 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#FournierB91 2003-11-19 Exponential transients in continuous-time Liapunov systems. 353-372 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00310-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#SimaO03 2003-11-19 The Power of Nondeterminism in Polynomial-Size Bounded-Width Branching Programs. 319-325 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Meinel88 2003-11-19 About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. 143-172 1989 67 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#MadlenerO89 2003-11-19 Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings. 3-31 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#MadlenerR98 http://dx.doi.org/10.1016/S0304-3975(98)00077-2 2003-11-19 Automatic verification of recursive procedures with one integer parameter. 85-106 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00397-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#BouajjaniHM03 2003-11-19 May I Borrow Your Logic? (Transporting Logical Structures Along Maps). 311-347 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#CerioliM97 http://dx.doi.org/10.1016/S0304-3975(96)00160-0 2003-11-19 Control Machines: A New Model of Parallelism for Compositional Specifications and Their Effective Compilation. 43-80 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Heibig91 2003-11-19 Universal Algebra in Higher Types. 385-417 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Meinke92 2003-11-19 Topological Methods for Algebraic Specification. 263-290 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#Meinke96 http://dx.doi.org/10.1016/0304-3975(95)00261-8 2003-11-19 The Minimum Broadcast Time Problem for Several Processor Networks. 69-85 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#JansenM95 http://dx.doi.org/10.1016/0304-3975(94)00230-G 2003-11-19 An asymptotic fully polynomial time approximation scheme for bin covering. 543-551 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00363-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#JansenS03 2003-11-19 The homomorphism problem for trace monoids. 199-215 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00101-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Silva03 2003-11-19 Editorial - SAS'97. 1-2 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#Hentenryck02 http://dx.doi.org/10.1016/S0304-3975(00)00311-X 2003-11-19 Implication of Clauses is Undecidable. 287-296 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Schmidt-Schauss88 2003-11-19 A Decision Algorithm for Distributive Unification. 111-148 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#Schmidt-Schauss98 http://dx.doi.org/10.1016/S0304-3975(98)00081-4 2003-11-19 Decidability of Behavioural Equivalence in Unary PCF. 363-373 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#Schmidt-Schauss99 http://dx.doi.org/10.1016/S0304-3975(98)00024-3 2003-11-19 On Tape-Bounded Probabilistic Turing Machine Acceptors. 75-91 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Simon81 2003-11-19 An Improved Algorithm for Transitive Closure on Acyclic Digraphs. 325-346 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Simon88 2003-11-19 Factorization Forests of Finite Height. 65-94 1990 72 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Simon90 2003-11-19 On the relevance of time in neural computation and learning. 157-178 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Maass01 http://dx.doi.org/10.1016/S0304-3975(00)00137-7 2003-11-19 An Efficient Decision Procedure for the Theory of Rational Order. 227-233 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#FerranteG77 2004-12-08 Boolean Neural Nets are Observable. 51-61 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#BotelhoG94 2003-11-19 Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. 175-203 1998 203 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#BaumkerDH98 http://dx.doi.org/10.1016/S0304-3975(98)00020-6 2003-11-19 Solving 8×8 Domineering. 195-206 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#BreukerUH00 http://dx.doi.org/10.1016/S0304-3975(99)00082-1 2003-11-19 Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. 75-87 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Ziadi00 http://dx.doi.org/10.1016/S0304-3975(99)00018-3 2003-11-19 Regular Expression for a Language without Empty Word. 309-315 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Ziadi96 http://dx.doi.org/10.1016/0304-3975(96)00028-X 2003-11-19 Algebraic nets with flexible arcs. 285-310 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#KindlerV01 http://dx.doi.org/10.1016/S0304-3975(00)00205-X 2003-11-19 Approximate algorithms for neural-Bayesian approaches. 219-238 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#HeskesBK02 2003-11-19 Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems. 87-117 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Kounalis92 2003-11-19 Complexity of Optimal Vector Code Generation. 105-115 1991 80 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#PowellN91 2003-11-19 Non-Deterministic Information Systems and their Domains. 289-309 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#DrosteG90 2006-06-13 Concise Description of Finite Languages. 227-246 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#BucherMCW81 2003-11-19 The Compexity of Counting Homeomorphs. 345-348 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#FarrM85 2003-11-19 Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segments. 291-319 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Troesch93 2003-11-19 Combining Explicit Negation and Negation by Failure Via Belnap's Logic. 61-75 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#RuetF97 http://dx.doi.org/10.1016/S0304-3975(96)00125-9 2003-11-19 Cryptographically significant Boolean functions with five valued Walsh spectra. 133-146 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#MaitraS02 http://dx.doi.org/10.1016/S0304-3975(01)00196-7 2003-11-19 ^qin Two Computing Models: Blum-Shub-Smale Machine and Turing Machine. 79-94 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#Zhong98 http://dx.doi.org/10.1016/S0304-3975(97)00008-X 2003-11-19 Computability Structure of the Sobolev Spaces and Its Applications. 487-510 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Zhong99 http://dx.doi.org/10.1016/S0304-3975(98)00302-8 2003-11-19 Bounding the bandwidths for graphs. 357-368 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Zhou00a http://dx.doi.org/10.1016/S0304-3975(00)00068-2 2003-11-19 A Hybrid Algorithm for Compiling Equality Constraints and its Implementation. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#ZhouK99 2003-11-19 On the Asymptotic Complexity of Rectangular Matrix Multiplication. 171-185 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#LottiR83 2003-11-19 Resolution-Based Approach to Computability Analysis of Interacting Automata. 183-205 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#ChebotarevM98 http://dx.doi.org/10.1016/S0304-3975(97)00025-X 2003-11-19 Acyclic Logic Programs and the Completeness of SLDNF-Resolution. 81-92 1991 86 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#Cavedon91 2003-11-19 The Generalized Counting Method for Recursive Logic Queries. 187-220 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#SaccaZ88 2003-11-19 A Tranformation System for Deductive Databases Modules with Perfect Model Semantics. 377-403 1993 110 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Maher93 2003-11-19 Constrained Dependencies. 113-149 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#Maher97 http://dx.doi.org/10.1016/S0304-3975(96)00193-4 2003-11-19 Méthodes quasi-Monte-Carlo multidimensionnelles. 131-137 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Faure94 2003-11-19 A Transformation System for Generating Description Languages of Chain Code Pictures. 239-252 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Gutbrod89 2003-11-19 ₁Norms. 117-128 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Grolmusz97 http://dx.doi.org/10.1016/S0304-3975(96)00290-3 2003-11-19 Type-based Diagnosis of CLP Programs. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#DrabentMP99 2003-11-19 Space Bounded Computations: Review and New Separation Results. 289-302 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#RanjanCH91 2003-11-19 Characterizing Specification Languages which Admit Initial Semantics. 49-59 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#MahrM84 2003-11-19 Cryptographic Copyright Protection for Digital Images Based on Watermarking Techniques. 117-142 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#RuanaidhPHPP99 http://dx.doi.org/10.1016/S0304-3975(99)00069-9 2003-11-19 Query learning of bounded-width OBDDs. 83-114 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#Nakamura00 http://dx.doi.org/10.1016/S0304-3975(99)00267-4 2003-11-19 On Quasilinear-Time Complexity Theory. 325-349 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#NaikRS95 http://dx.doi.org/10.1016/0304-3975(95)00031-Q 2003-11-19 Free Upper Regular Bands. 93-98 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#MainB81 2003-11-19 Semantic Models for Total Correctness and Fairness. 305-332 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#MainB93 2003-11-19 Linear Time Parsers for Classes of Non Context Free Languages. 355-390 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#KulkarniS96 http://dx.doi.org/10.1016/0304-3975(95)00231-6 2003-11-19 Event-Clock Automata: A Determinizable Class of Timed Automata. 253-273 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#AlurFH99 http://dx.doi.org/10.1016/S0304-3975(97)00173-4 2003-11-19 A time-optimal solution for the path cover problem on cographs. 1541-1556 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#NakanoOZ03 2003-11-19 Generalized satisfiability problems: minimal elements and phase transitions. 417-430 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00890-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#CreignouD03 2003-11-19 Extending the Type Checker of Standard ML by Polymorphic Recursion. 157-181 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#EmmsL99 http://dx.doi.org/10.1016/S0304-3975(98)00139-X 2003-11-19 Towards a Mathematical Theory of Machine Discovery from Facts. 53-84 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#MukouchiA95 http://dx.doi.org/10.1016/0304-3975(95)91135-D 2003-11-19 Constructible Differentially Finite Algebraic Series in Several Variables. 59-65 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#BergeronS95 http://dx.doi.org/10.1016/0304-3975(94)00297-V 2003-11-19 Refutable language learning with a neighbor system. 89-110 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00420-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#MukouchiS03 2003-11-19 The complexity of functions on lattices. 195-225 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#SanderT00 http://dx.doi.org/10.1016/S0304-3975(99)00078-X 2003-11-19 The rectangle complexity of functions on two-dimensional lattices. 857-863 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#SanderT02 http://dx.doi.org/10.1016/S0304-3975(01)00281-X 2003-11-19 Hypothesis finding based on upward refinement of residue hypotheses. 5-19 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00416-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Yamamoto03 2003-11-19 On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction. 139-154 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Yamamoto97 http://dx.doi.org/10.1016/S0304-3975(96)00143-0 2003-11-19 Bilimites de Langages Reconnaissables. 335-342 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Girault-Beauquier84 2003-11-19 A Decomposition Theorem for Probabilistic Transition Systems. 391-396 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Maler95 http://dx.doi.org/10.1016/0304-3975(95)00004-G 2006-09-12 Minimal cover-automata for finite languages. 3-16 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#CampeanuSY01 http://dx.doi.org/10.1016/S0304-3975(00)00292-9 2003-11-19 Term rewriting restricted to ground terms. 135-165 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00745-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Vagvolgyi03a 2005-07-25 Intersection of finitely generated congruences over term algebra. 209-234 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00080-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#Vagvolgyi03b 2003-11-19 On-Line Algorithms for Satisfiability Problems with Uncertainty. 3-24 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#AusielloG97 http://dx.doi.org/10.1016/S0304-3975(96)00123-5 2003-11-19 Dynamic Maintenance of Directed Hypergraphs. 97-117 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#AusielloN90 2003-11-19 Superposition Theorem Proving for Abelian Groups Represented as Integer Modules. 149-177 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#Stuber98 http://dx.doi.org/10.1016/S0304-3975(98)00082-6 2006-05-02 Conditional complexity and codes. 97-109 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Muchnik02 http://dx.doi.org/10.1016/S0304-3975(01)00033-0 2003-11-19 The definable criterion for definability in Presburger arithmetic and its applications. 1433-1444 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Muchnik03 2003-11-19 On Common Information. 319-328 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Muchnik98 http://dx.doi.org/10.1016/S0304-3975(98)00070-X 2003-11-19 Preface. 119-120 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Marti-OlietM02 http://dx.doi.org/10.1016/S0304-3975(01)00356-5 2003-11-19 Semantic distance between specifications. 257-276 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#MiliDFM00 http://dx.doi.org/10.1016/S0304-3975(99)00085-7 2003-11-19 The P(n)/n-function for bi-infinite words. 35-46 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Heinis02 http://dx.doi.org/10.1016/S0304-3975(00)00432-1 2003-11-19 How to Tidy up a General Set-System by Use of Uncrossing Operations. 215-225 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Karzanov96 http://dx.doi.org/10.1016/0304-3975(95)00160-3 2003-11-19 Logical string rewriting. 25-51 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Manca01 http://dx.doi.org/10.1016/S0304-3975(00)00212-7 2003-11-19 A practical algorithm for making filled graphs minimal. 125-141 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#BlairHT01 http://dx.doi.org/10.1016/S0304-3975(99)00126-7 2003-11-19 Taut Monads and T0-spaces. 79-109 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Manes02 http://dx.doi.org/10.1016/S0304-3975(00)00415-1 2003-11-19 <i>if-then-else</i>. 413-417 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Manes90 2003-11-19 La Representation Ergodique d'un Automate fini. 221-241 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Perrin79 2003-11-19 Completing Biprefix Codes. 329-336 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Perrin84 2003-11-19 On Positive Matrices. 357-366 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Perrin92 2003-11-19 Definability and Fast Quantifier Elimination in Algebraically Closed Fields. 239-277 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Heintz83 2003-11-19 Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. 343 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Heintz85 2003-11-19 On Polynomials with Symmetric Galois Group which Are Easy to Compute. 99-105 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Heintz86 2003-11-19 Reduction Graphs in the Lambda Calculus. 251-275 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Zilli84 2003-11-19 Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem. 169-208 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#ManoO01 http://dx.doi.org/10.1016/S0304-3975(99)00340-0 2003-11-19 Varietes de Langages et Operations. 197-210 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Perrot78 2003-11-19 On Scott's Thesis for Domains of Information and Well-Quasi-Orderings. 151-158 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Bottinger90 2003-11-19 Polynomial-time counting and sampling of two-rowed contingency tables. 265-278 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#DyerG00 http://dx.doi.org/10.1016/S0304-3975(99)00136-X 2003-11-19 Exact results for accepting probabilities of quantum automata. 3-25 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00393-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#AmbainisK03 2005-07-25 Algebraic Translations, Correctness and Algebraic Compiler Construction. 25-56 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Janssen98 http://dx.doi.org/10.1016/S0304-3975(97)00267-3 2003-11-19 Two-way finite automata with quantum and classical state. 299-311 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#AmbainisW02 2003-11-19 Complexity of learning in artificial neural networks. 285-306 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Engel01 http://dx.doi.org/10.1016/S0304-3975(01)00167-0 2003-11-19 Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. 267-275 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#KrauseMW91 2003-11-19 On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters. 239-260 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#MaonY84 2003-11-19 Balance of Many-Valued Transductions and Equivalence Problems. 247-262 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#MaonY86 2003-11-19 Separating Complexity Classes With Tally Oracles. 309-318 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#HemachandraR92 2003-11-19 Kolmogorov Characterizations of Complexity Classes. 313-322 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#HemachandraW91 2003-11-19 Scheduling Parallel Tasks with Individual Deadlines. 209-223 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#KwonC99 http://dx.doi.org/10.1016/S0304-3975(97)00178-3 2003-11-19 A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. 193-212 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#AndrekaNS82 2003-11-19 On the Strength of Temporal Proofs. 125-151 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#AndrekaNS91 2003-11-19 DNF tautologies with a limited number of occurrences of every variable. 495-498 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#SavickyS00 http://dx.doi.org/10.1016/S0304-3975(00)00036-0 2003-11-19 On Reduction of Asynchronous Systems. 25-50 1977 5 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Kwong77 2003-11-19 A read-once lower bound and a (1, +k)-hierarchy for branching programs. 347-362 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#SavickyZ00 http://dx.doi.org/10.1016/S0304-3975(98)00219-9 2003-11-19 A Lower Bound on Branching Programs Reading Some Bits Twice. 293-301 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#SavickyZ97 http://dx.doi.org/10.1016/S0304-3975(96)00183-1 2003-11-19 Dense edge-disjoint embedding of complete binary trees in interconnection networks. 325-342 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#RavindranGP00 http://dx.doi.org/10.1016/S0304-3975(00)00066-9 2003-11-19 Rewriting logic: roadmap and bibliography. 121-154 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Marte-OlietM02 http://dx.doi.org/10.1016/S0304-3975(01)00357-7 2006-08-24 Algebraic Specifiability of Data Types with minimal Computable Parameters. 97-116 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Rodenburg91 2003-11-19 Representation of Computations in Concurrent Automata by Dependence Orders. 67-96 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#BrachoDK97 http://dx.doi.org/10.1016/S0304-3975(96)00012-6 2003-11-19 Case-Based Representation and Learning of Pattern Languages. 25-51 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#JantkeL95 http://dx.doi.org/10.1016/0304-3975(95)91134-C 2003-11-19 Solving Divergence in Knuth-Bendix Completion by Enriching Signatures. 145-185 1993 112 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#ThomasW93 2003-11-19 A Geometric Construction of a Superconcentrator of Depth 2. 215-219 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Meshulam84 2003-11-19 A Natural Semantics for Modal Logic Over Databases. 187-209 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Marek88 2003-11-19 From Geometry to Euler Identities. 213-220 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#FranceP89 2003-11-19 The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages. 77-91 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#ReedyS75 2003-11-19 Inductive inference of unbounded unions of pattern languages from positive data. 191-209 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#ShinoharaA00 http://dx.doi.org/10.1016/S0304-3975(99)00270-4 2003-11-19 On the Analysis of Algorithms for Trees. 155-169 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Francon77 2003-11-19 Sur la topologie d'un plan arithmétique. 159-176 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Francon96 http://dx.doi.org/10.1016/0304-3975(95)00059-3 2003-11-19 A First Order Logic of Effects. 277-318 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Mason97 http://dx.doi.org/10.1016/S0304-3975(97)00047-9 2003-11-19 Alternative Semantics for Temporal Logics. 121-130 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Emerson83 2003-11-19 Relativizations of the P=?NP Question over the Reals (and other Ordered Rings). 15-22 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Emerson94 2003-11-19 Preface. 1 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#ChangDMS01 http://dx.doi.org/10.1016/S0304-3975(00)00224-3 2003-11-19 A non-Hausdorff quaternion multiplication. 135-158 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00703-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#HardieSVW03 2003-11-19 Hardness results for multicast cost sharing. 215-236 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00085-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#FeigenbaumKSS03 2003-11-19 A Generalization of Sardinas and Patterson's Algorithm to Z-Codes. 251-270 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#MadoniaSS93 2003-11-19 Linear programs in a simple reversible language. 2063-2074 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Matos03 2003-11-19 Periodic Sets of Integers. 287-312 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Matos94 2003-11-19 Monadic Logic Programs and Functional Complexity. 175-204 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Matos97 http://dx.doi.org/10.1016/S0304-3975(96)00093-X 2003-11-19 Modelization of deterministic rational relations. 423-453 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Grigorieff02 http://dx.doi.org/10.1016/S0304-3975(02)00022-1 2003-11-19 Abstract Functional Dependency Structures. 117-126 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Matus91 2003-11-19 Stochastic Independence, Algebraic Independence and Abstract Connectedness. 455-471 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Matus94 2003-11-19 Computer arithmetic and hardware: "off the shelf" microprocessors versus "custom hardware". 3-27 2002 279 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#Etiemble02 http://dx.doi.org/10.1016/S0304-3975(00)00424-2 2003-11-19 Derived Linear Systems of Context-Free Grammars. 189-203 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Mauro91 2003-11-19 Programs over semigroups of dot-depth one. 135-148 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#MacielPT00 http://dx.doi.org/10.1016/S0304-3975(99)00278-9 2003-11-19 On Resource-Bounded Instance Complexity. 123-140 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#FortnowK96 http://dx.doi.org/10.1016/0304-3975(95)00097-6 2003-11-19 Interactive Proof Systems and Alternating Time-Space Complexity. 55-73 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#FortnowL93 2003-11-19 Hard variants of stable marriage. 261-279 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#ManloveIIMM02 http://dx.doi.org/10.1016/S0304-3975(01)00206-7 2003-11-19 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. 3-24 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#BockenhauerHKSU02 http://dx.doi.org/10.1016/S0304-3975(01)00287-0 2003-11-19 Algebraic proof systems over formulas. 83-102 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00446-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#GrigorievH03 2003-11-19 Computability of the Additive Complexity of Algebraic Circuits with Root Extracting. 91-99 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#GrigorievK96 http://dx.doi.org/10.1016/0304-3975(95)00177-8 2003-11-19 Counter Machines and Verification Problems. 165-189 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#IbarraSDBK02 2003-11-19 Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. 185-214 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#GrigorievV96 http://dx.doi.org/10.1016/0304-3975(95)00159-X 2003-11-19 Alternating and empty alternating auxiliary stack automata. 307-326 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00326-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#HolzerM03 2003-11-19 Unique Fixed Points Vs. Least Fixed Points. 229-254 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Tiuryn80 2003-11-19 Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. 829-843 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Slany02 2003-11-19 Local Model Checking for Infinite State Spaces. 157-174 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#BradfieldS92 2003-11-19 Tree Adjoining Grammars for RNA Structure Prediction. 277-303 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#UemuraHKY99 http://dx.doi.org/10.1016/S0304-3975(98)00090-5 2003-11-19 Normal Numbers and Sources for BPP. 155-169 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#Strauss97 http://dx.doi.org/10.1016/S0304-3975(96)00099-0 2003-11-19 Approximating the Permanent of Graphs with Large Factors. 283-305 1992 102 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#DagumL92 2003-11-19 Repetitions in Sturmian strings. 289-303 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#FrankKS00 http://dx.doi.org/10.1016/S0304-3975(00)00063-3 2003-11-19 Some results on k-power-free morphisms. 119-142 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#RichommeW02 http://dx.doi.org/10.1016/S0304-3975(00)00437-0 2003-11-19 Left ternary trees and non-separable rooted planar maps. 201-215 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#LungoRP00 http://dx.doi.org/10.1016/S0304-3975(98)00025-5 2003-11-19 New Lower Bounds on the Cost of Binary Search Trees. 315-325 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#PriscoS96 http://dx.doi.org/10.1016/0304-3975(95)00153-0 2003-11-19 On Pebble Automata. 111-121 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#ChangIPR86 2003-11-19 On a Characterization of Pushdown Permuters. 333-341 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Shyamasundar82 2003-11-19 Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. 183-197 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#OommenHM90 2003-11-19 Higher-Order Rewrite Systems and Their Confluence. 3-29 1998 192 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#MayrN98 http://dx.doi.org/10.1016/S0304-3975(97)00143-6 2003-11-19 Divide-and-Conquer Algorithms on the Hypercube. 283-296 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#MayrW96 http://dx.doi.org/10.1016/0304-3975(96)00033-3 2003-11-19 Subresultants revisited. 199-239 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00639-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#GathenL03 2003-11-19 Some Polynomials that are Hard to Compute. 331-335 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#GathenS80 2003-11-19 The regular viewpoint on PA-processes. 89-115 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#LugiezS02 http://dx.doi.org/10.1016/S0304-3975(00)00306-6 2003-11-19 A String-Matching Interpretation of the Equation xmyn = zp. 145-164 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#NeraudC92 2003-11-19 The Inclusion Problem for Simple Languages. 297-316 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Friedman76 2003-11-19 A Note on Non-Singular Deterministic Pushdown Automata. 333-339 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Friedman78 2003-11-19 On codes with a finite deciphering delay: constructing uncompletable words. 151-162 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#NeraudS01 http://dx.doi.org/10.1016/S0304-3975(99)00160-7 2003-11-19 Locally complete sets and finite decomposable codes. 185-196 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#NeraudS02 http://dx.doi.org/10.1016/S0304-3975(00)00440-0 2004-09-07 When does a planar bipartite framework admit a continuous deformation? 345-354 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#MaeharaT01 http://dx.doi.org/10.1016/S0304-3975(00)00254-1 2003-11-19 <i>D</i>. 129-134 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Latteux77 2003-11-19 A Propos du Lemme de Substitution. 119-123 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Latteux81 2003-11-19 Superlinear Period Lengths in Some Subtraction Games. 111-119 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#AlthoferB95 http://dx.doi.org/10.1016/0304-3975(95)00019-S 2003-11-19 Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. 333-338 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#GillHS80 2003-11-19 Seven-State Solutions to the Firing Squad Synchronization Problem. 313-332 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Yunes94 2003-11-19 On the semantics of the call-by-name CPS transform. 309-321 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#Boudol00 http://dx.doi.org/10.1016/S0304-3975(99)00302-3 2003-11-19 Solution of a problem in DNA computing. 387-391 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#AndersonCNSW02 2003-11-19 A Characterization of Passing Compatibility for Parameterized Specifications. 205-214 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Orejas87 2003-11-19 Effective Subdirect Decomposition: A Case Study. 137-156 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#BenningerS92 2003-11-19 Optimal Binary Search Trees. 1-44 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Nagaraj97 http://dx.doi.org/10.1016/S0304-3975(96)00320-9 2003-11-19 Resolution des Systemes d'Equations Algebriques. 77-110 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Lazard81 2003-11-19 MetaML and multi-stage programming with explicit annotations. 211-242 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#TahaS00 http://dx.doi.org/10.1016/S0304-3975(00)00053-0 2006-02-17 Algebraic Specification of Documents. 231-247 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#RamalhoAH98 http://dx.doi.org/10.1016/S0304-3975(97)00274-0 2003-11-19 On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. 189-201 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#FredericksonJ82 2003-11-19 Properties of Probabilistic Pushdown Automata. 117-130 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#MacarieO98 http://dx.doi.org/10.1016/S0304-3975(98)00059-0 2003-11-19 A formal model of real-time program compilation. 151-190 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#LermerF02 http://dx.doi.org/10.1016/S0304-3975(01)00047-0 2003-11-19 Refinement and state machine abstraction. 195-235 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#LermerS01 http://dx.doi.org/10.1016/S0304-3975(00)00169-9 2003-11-19 A Decidable Fragment of Predicate Calculus. 297-307 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#KetonenW84 2003-11-19 A Shrinking Lemma for Indexed Languages. 277-281 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Gilman96 http://dx.doi.org/10.1016/0304-3975(96)00244-7 2003-11-19 A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. 291-300 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#VaziraniV83 2003-11-19 An Extensional Fixed-Point Semantics for Nondeterministic Data Flow. 129-179 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#KearneyS91 2003-11-19 Periodic comparator networks. 175-202 2000 245 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#Oesterdiekhoff00 http://dx.doi.org/10.1016/S0304-3975(99)00281-9 2003-11-19 A hierarchy of deterministic context-free omega-languages. 1253-1300 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Duparc03 2003-11-19 Feasibility Problems for Recurring Tasks on one Processor. 3-20 1993 118 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#BaruahHR93 2003-11-19 Orderings for Term-Rewriting Systems. 279-301 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Dershowitz82 2003-11-19 Reliable Communication over Partially Authenticated Networks. 185-210 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#BeimelF99 http://dx.doi.org/10.1016/S0304-3975(98)00241-2 2003-11-19 Algorithms for generalized vertex-rankings of partial k-trees. 407-427 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#KashemZN00 http://dx.doi.org/10.1016/S0304-3975(99)00240-6 2003-11-19 The Power of Synchronizing Operations on Strings. 127-154 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Jantzen81 2003-11-19 Extending Regular Expressions with Iterated Shuffle. 223-247 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Jantzen85 2003-11-19 Algebraic aspects of families of fuzzy languages. 417-445 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Asveld03 2003-11-19 Abstract Grammars Based on Transductions. 269-288 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Asveld91 2003-11-19 Applying Cellular Automata to Complex Environmental Problems: The Simulation of the Bioremediation of Contaminated Soils. 131-156 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#GregorioSV99 http://dx.doi.org/10.1016/S0304-3975(98)00154-6 2003-11-19 Learning elementary formal systems with queries. 21-50 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00417-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#SakamotoHA03 2003-11-19 Uniform multi-hop all-to-all optical routings in rings. 385-397 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00649-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Opatrny03 2003-11-19 Using acceptors as transducers. 83-104 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#Nykanen01 http://dx.doi.org/10.1016/S0304-3975(00)00297-8 2003-11-19 A Pi-Calculus with Explicit Substitutions. 53-103 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#FerrariMQ96 http://dx.doi.org/10.1016/S0304-3975(96)00063-1 2003-11-19 Definability by Programs in First-Order Structures. 1-66 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Kfoury83 2003-11-19 Hyperedge Channels are Abelian. 387-393 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#DeutzER94 2003-11-19 Fanout limitations on constraint systems. 281-293 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Feder01 http://dx.doi.org/10.1016/S0304-3975(99)00288-1 2003-11-19 On Simulating Non-Returning PC Grammar Systems with Returning Systems. 319-329 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Vaszil98 http://dx.doi.org/10.1016/S0304-3975(97)00120-5 2003-11-19 The Theory of Functional and Template Dependencies. 317-331 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#SadriU82 2003-11-19 Do stronger definitions of randomness exist? 1987-1996 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DurandKUV03 2003-11-19 Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. 295-302 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Lingas89 2003-11-19 ^5/2). 307-316 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Lingas97 http://dx.doi.org/10.1016/S0304-3975(96)00276-9 2003-11-19 Polynomial-Time Reducibilities and ``Almost All'' Oracle Sets. 35-47 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#TangB91 2003-11-19 The height of a binary search tree: the limiting distribution perspective. 649-703 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#KnesslS02 2003-11-19 Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. 63-74 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#GarofalakisSTR94 2003-11-19 A Process Algebra with Distributed Priorities. 227-258 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#CleavelandLN98 http://dx.doi.org/10.1016/S0304-3975(97)00221-1 2003-11-19 The Limited Regular Languages. 1-10 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#TangZ83 2003-11-19 A universal cellular automaton in the hyperbolic plane. 327-364 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00660-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#HerrmannM03 2003-11-19 Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. 207-240 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#BlanckST02 http://dx.doi.org/10.1016/S0304-3975(01)00065-2 2003-11-19 On maximal codes with a finite interpreting delay. 167-183 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Guesnet02 http://dx.doi.org/10.1016/S0304-3975(00)00439-4 2003-11-19 On maximal synchronous codes. 129-138 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00097-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Guesnet03 2003-11-19 Categories of Chain-Complete Posets. 125-135 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Markowsky77 2003-11-19 Propositional default logics made easier: computational complexity of model checking. 591-627 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BaumgartnerG02 2003-11-19 Substitution Revisited. 317-325 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Stoughton88 2003-11-19 Interdefinability of Parallel Operations in PCF. 357-358 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Stoughton91 2003-11-19 On Good ET0L Forms. 263-272 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Skyum78 2003-11-19 Time-minimal paths amidst moving obstacles in three dimensions. 421-440 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Fujimura02 http://dx.doi.org/10.1016/S0304-3975(00)00408-4 2003-11-19 Gap-Languages and Log-Time Complexity Classes. 101-116 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#ReganV97 http://dx.doi.org/10.1016/S0304-3975(96)00288-5 2003-11-19 The Complexity of Colouring Problems on Dense Graphs. 337-343 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Edwards86 2003-11-19 Interactive Foundations of Computing. 315-351 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#Wegner98 http://dx.doi.org/10.1016/S0304-3975(97)00154-0 2003-11-19 Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. 211-238 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#LevcopoulosP96 http://dx.doi.org/10.1016/0304-3975(95)00256-1 2003-11-19 Operations and language generating devices suggested by the genome evolution. 701-738 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#DassowMS02 http://dx.doi.org/10.1016/S0304-3975(01)00096-2 2003-11-19 Parallel Algorithms for Priority Queue Operations. 171-180 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#PinottiP95 http://dx.doi.org/10.1016/0304-3975(95)00039-Y 2003-11-19 Multi-engine Horn Clause Prolog. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Tarau99 2003-11-19 Covering Numbers of Rotations. 97-116 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Chekhova00 http://dx.doi.org/10.1016/S0304-3975(97)00256-9 2003-11-19 On the Complexity of Multiplication in Finite Fields. 285-296 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#LempelSW83 2003-11-19 A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. 147-160 1996 169 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Feige96 http://dx.doi.org/10.1016/S0304-3975(96)00118-1 2003-11-19 Automatic verification of real-time systems with discrete probability distributions. 101-150 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#KwiatkowskaNSS02 http://dx.doi.org/10.1016/S0304-3975(01)00046-9 2003-11-19 Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy. 167-183 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Tarui93 2003-11-19 On the computational complexity of determining polyatomic structures by X-rays. 91-106 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#GardnerGP00 http://dx.doi.org/10.1016/S0304-3975(97)00298-3 2005-05-23 A gap property of deterministic tree languages. 215-231 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00452-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#NiwiskiW03 2003-11-19 Directed virtual path layouts in ATM networks. 3-28 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#BermondMPP03 2005-07-25 Induction in the Timed Interval Calculus. 181-207 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(01)00378-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#Wabenhorst03 2003-11-19 Effective decomposability of sequential behaviours. 71-89 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Kucera00 http://dx.doi.org/10.1016/S0304-3975(98)00201-1 2003-11-19 The complexity of bisimilarity-checking for one-counter processes. 157-183 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00081-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Kucera03 2003-11-19 A new lower bound for the list update problem in the partial cost model. 3-16 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#AmbuhlGS01 http://dx.doi.org/10.1016/S0304-3975(00)00257-7 2003-11-19 Upper Bounds for Sorting Integers on Random Access Machines. 263-276 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#KirkpatrickR84 2003-11-19 Remarks on Blind and Partially Blind One-Way Multicounter Machines. 311-324 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Greibach78a 2003-11-19 A truly concurrent semantics for a process algebra using resource pomsets. 369-421 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#GastinM02 http://dx.doi.org/10.1016/S0304-3975(02)00021-X 2005-07-25 A new framework for declarative programming. 91-160 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(01)00308-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#FinkelsteinFL03 2003-11-19 The Poset of Infinitary Traces. 101-121 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#GastinR93 2003-11-19 Resource traces: a domain for processes sharing exclusive resources. 195-221 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#GastinT02 http://dx.doi.org/10.1016/S0304-3975(00)00336-4 2003-11-19 Constructing an asymptotic phase transition in random binary constraint satisfaction problems. 265-283 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Smith01 http://dx.doi.org/10.1016/S0304-3975(01)00166-9 2003-11-19 On the Border of Causality: Contact and Confusion. 245-270 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#Smith96 http://dx.doi.org/10.1016/0304-3975(95)00123-9 2003-11-19 Designware: Software Development by Refinement. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Smith99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Algorithms for vertex-partitioning problems on graphs with fixed clique-width. 719-734 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00725-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#GerberK03 2003-11-19 Ensuring completeness of symbolic verification methods for infinite-state systems. 145-167 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#AbdullaJ01 http://dx.doi.org/10.1016/S0304-3975(00)00105-5 2003-11-19 Model checking of systems with many identical timed processes. 241-264 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#AbdullaJ03 2003-11-19 Heaps with Bits. 1-12 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#CarlssonCM96 http://dx.doi.org/10.1016/0304-3975(95)00152-2 2006-05-02 Decidability of the theory of the natural integers with the cantor pairing function and the successor. 51-77 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#CegielskiR01 http://dx.doi.org/10.1016/S0304-3975(00)00109-2 2006-05-02 On Arithmetical First-Order Theories Allowing Encoding and Decoding of Lists. 55-75 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#CegielskiR99 http://dx.doi.org/10.1016/S0304-3975(97)00281-8 2003-11-19 On the rigidity of Vandermonde matrices. 477-483 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Lokam00 http://dx.doi.org/10.1016/S0304-3975(00)00008-6 2003-11-19 Extremality of submodular functions. 239-256 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Kashiwabara00 http://dx.doi.org/10.1016/S0304-3975(99)00196-6 2003-11-19 An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. 191-214 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#MemmiF85 2003-11-19 The calculus of constructions as a framework for proof search with set variable instantiation. 187-229 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#Felty00 http://dx.doi.org/10.1016/S0304-3975(99)00175-9 2003-11-19 Multiplicities of covers for sofic shifts. 349-375 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#FiebigFJ01 http://dx.doi.org/10.1016/S0304-3975(00)00278-4 2003-11-19 A note on first-order projections and games. 2085-2093 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Arratia-QuesadaS03 2003-11-19 On the Partially Commutative Shuffle Product. 405-410 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#DuchampK92 2003-11-19 Theoremes de Transfert pour les Polynomes Partiellement Commutatifs. 239-249 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#DuchampT88 2003-11-19 Reconstructing Convex Polyominoes from Horizontal and Vertical Projections. 321-347 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#BarcucciLNP96 http://dx.doi.org/10.1016/0304-3975(94)00293-2 2003-11-19 On Tables of Random Numbers (Reprinted from "Sankhya: The Indian Journal of Statistics", Series A, Vol. 25 Part 4, 1963). 387-395 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Kolmogorov98 http://dx.doi.org/10.1016/S0304-3975(98)00075-9 2003-11-19 Polyominoes Defined by Their Vertical and Horizontal Projections. 129-136 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#BarcucciLPS96 http://dx.doi.org/10.1016/0304-3975(95)00205-7 2003-11-19 Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes. 251-270 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#BurkartS99 http://dx.doi.org/10.1016/S0304-3975(99)00034-1 2003-11-19 Algebraic Implementation of Abstract Data Types. 209-263 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#EhrigKMP82 2003-11-19 On-Line Routing in All-Optical Networks. 19-39 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#BartalL99 http://dx.doi.org/10.1016/S0304-3975(99)00025-0 2003-11-19 Circuit Size is Nonlinear in Depth. 397-400 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#PatersonV76 2003-11-19 On Equivalence of Grammars Through Transformation Trees. 173-205 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#HarrisonHY79 2003-11-19 Equivalence of conservative, free, linear program schemas is decidable. 831-862 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#LaurenceDHHH03 2003-11-19 Boolean Operations, Joins, and the Extended Low Hierarchy. 317-327 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#HemaspaandraJRW98 http://dx.doi.org/10.1016/S0304-3975(98)00006-1 2005-07-25 The power of reachability testing for timed automata. 411-475 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00334-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#AcetoBBL03 2003-11-19 Distributed Loop Network with Minimum Transmission Delay. 223-241 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#ErdosH92 2003-11-19 The Alamo Execution Monitor Architecture. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Jeffery99 2003-11-19 Extension of Combinatory Logic to a Theory of Combinatory Representation. 157-173 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Weibel92 2003-11-19 An Order-Sorted Resolution in Theory and Practice. 393-410 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Weibel97 http://dx.doi.org/10.1016/S0304-3975(97)00051-0 2003-11-19 Power and size of extended Watson-Crick L systems. 1665-1678 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CsimaCS03 2003-11-19 Online Computations of Differentiable Functions. 331-345 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Schroder99a http://dx.doi.org/10.1016/S0304-3975(98)00295-3 2003-11-19 On ``On Graph Rewritings''. 37-58 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Kennaway87 2003-11-19 On ``On Graph Rewritings'' (Corrigendum). 317-320 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Kennaway88 2003-11-19 Implementing Term Rewrite Languages in Dactl. 225-249 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Kennaway90 2003-11-19 Factorizing fault tolerance. 1201-1222 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#PrasetyaS03 2003-11-19 A Framework for a Theory of Automated Learning. 161-176 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Hausen-Tropper96 http://dx.doi.org/10.1016/0304-3975(95)00143-3 2003-11-19 Bandwidth Constraints on Problems Complete for Polynomial Time. 25-52 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Sudborough83 2005-07-25 Typing correspondence assertions for communication protocols. 379-409 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00333-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#GordonJ03 2003-11-19 The accelerated k-in-a-row game. 865-875 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Pluhar02 http://dx.doi.org/10.1016/S0304-3975(01)00115-3 2003-11-19 Computation of Recursive Functionals Using Minimal Initial Segments. 305-315 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#GordonS83 2003-11-19 Bubbles in Modularity. 31-54 1998 192 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#Marchiori98 http://dx.doi.org/10.1016/S0304-3975(97)00144-8 2003-11-19 Design of Abstract Domains Using First-Order Logic. 153-179 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#Marchiori99 http://dx.doi.org/10.1016/S0304-3975(98)00231-X 2003-11-19 Formal properties of PA-matching. 117-131 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#KobayashiMPR01 http://dx.doi.org/10.1016/S0304-3975(00)00185-7 2005-08-02 Genetic Algorithms: Bridging the Convergence Gap. 11-22 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#LozanoLGA99 http://dx.doi.org/10.1016/S0304-3975(99)00090-0 2003-11-19 On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic. 3-45 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#HofmannS96 http://dx.doi.org/10.1016/0304-3975(96)00068-0 2003-11-19 Compact Normalisation Trace via Lazy Rewriting. 2001 57 Electr. Notes Theor. Comput. Sci. http://www.elsevier.nl/locate/entcs/volume57.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs57.html#Nguyen01 2003-11-19 A Tableau-Like Proof Procedure for Normal Modal Logics. 167-186 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Ognjanovic94 2003-11-19 A Note on Decidability Questions on Presentations of Word Semigroups. 83-92 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#ChoffrutHK97 http://dx.doi.org/10.1016/S0304-3975(96)00311-8 2003-11-19 On upper bound graphs with respect to operations on graphs. 219-223 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#EraOT00 http://dx.doi.org/10.1016/S0304-3975(99)00194-2 2003-11-19 Structuring the elementary components of graphs having a perfect internal matching. 179-210 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00048-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#BarthaK03 2003-11-19 The commutation of finite sets: a challenging problem. 69-79 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#ChoffrutKO02 http://dx.doi.org/10.1016/S0304-3975(00)00434-5 2003-11-19 Minimal Separating Sets for Acceptance Conditions in Muller Automata. 47-57 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#LescowV00 http://dx.doi.org/10.1016/S0304-3975(99)00016-X 2003-11-19 On a Conjecture of Bergstra and Tucker. 87-97 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#MarongiuT89 2003-11-19 On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. 129-143 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Kobayashi01 http://dx.doi.org/10.1016/S0304-3975(99)00332-1 2003-11-19 On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks. 149-167 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Kobayashi78 2003-11-19 On Proving Time Constructibility of Functions. 215-225 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Kobayashi85 2003-11-19 Repetition-Free Words. 175-197 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Kobayashi86 2003-11-19 A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation. 321-329 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#Kobayashi95 http://dx.doi.org/10.1016/0304-3975(94)00264-J 2003-11-19 Monad as Modality. 29-74 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Kobayashi97 http://dx.doi.org/10.1016/S0304-3975(96)00169-7 2003-11-19 Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. 2045-2051 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Meidl03 2003-11-19 Structured Theories and Institutions. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#DuranM99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Kolmogorov Complexity - Foreword. 1 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Durand02 http://dx.doi.org/10.1016/S0304-3975(01)00026-3 2003-11-19 Inversion of 2D Cellular Automata: Some Complexity Results. 387-401 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Durand94 2003-11-19 A Random NP-Complete Problem for Inversion of 2D Cellular Automata. 19-32 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Durand95 http://dx.doi.org/10.1016/0304-3975(94)00293-R 2003-11-19 Tilings and Quasiperiodicity. 61-75 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#Durand99 http://dx.doi.org/10.1016/S0304-3975(99)00027-4 2003-11-19 Loop checks for logic programs with functions. 441-461 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#ShenYY01 http://dx.doi.org/10.1016/S0304-3975(00)00197-3 2003-11-19 The Parallel Complexity of Deadlock Detection. 155-163 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Spirakis87 2004-12-06 Super link-connectivity of iterated line digraphs. 461-469 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00282-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#ChengDMNRSW03 2003-11-19 Collage system: a unifying framework for compressed pattern matching. 253-272 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00426-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#KidaMSTSA03 2003-11-19 A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. 161-189 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#DasGuptaS01 http://dx.doi.org/10.1016/S0304-3975(00)00188-2 2003-11-19 Decoders with Initial State Invariance for Multivalued Encodings. 365-375 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#CapocelliGV91 2003-11-19 A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. 63-78 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#CapocelliGV94 2003-11-19 On Distributed Catenation. 341-352 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#KudlekM97 http://dx.doi.org/10.1016/S0304-3975(97)00284-3 2003-11-19 Type Inference in Prolog: A New Approach. 23-38 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#CorsiniM93 2003-11-19 Transformation of Dynamic Integrity Constraints into Transaction Specifications. 115-142 1990 76 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Lipeck90 2003-11-19 An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions. 325-332 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#KleimanP78 2003-11-19 Complexity of path discovery game problems. 381-406 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#TohyamaA00 http://dx.doi.org/10.1016/S0304-3975(99)00331-X 2003-11-19 The size of power automata. 371-386 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00413-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Sutner03a 2003-11-19 Mechanizing Structural Induction Part II: Strategies. 347-362 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Aubin79a 2003-11-19 The Decomposition of Stochastic Systems. 223-233 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#KanaokaT84 2005-01-18 Homogeneous Decomposition of Stochastic Systems. 245-255 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#KanaokaT85 2003-11-19 A Complete and Recursive Feature Theory. 243-268 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#BackofenS95 http://dx.doi.org/10.1016/0304-3975(94)00188-O 2003-11-19 A Lower Bound for the Length of Addition Chains. 1-12 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Schonhage75 2003-11-19 An Elementary Proof for Strassen's Degree Bound. 267-272 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Schonhage76 2005-07-25 General parameterised refinement and recursion for the M-net calculus. 259-300 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00088-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#DevillersKR03 2003-11-19 Repetitive perhaps, but certainly not boring. 343-355 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Smyth00 http://dx.doi.org/10.1016/S0304-3975(00)00067-0 2003-11-19 Effectively given Domains. 257-274 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Smyth77 2003-11-19 The Largest Cartesian Closed Category of Domains. 109-119 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#Smyth83 2003-11-19 Semi-Metrics, Closure Spaces and Digital Topology. 257-276 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Smyth95 http://dx.doi.org/10.1016/0304-3975(95)00053-Y 2003-11-19 Small Deterministic Turing Machines. 241-255 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Kudlek96 http://dx.doi.org/10.1016/S0304-3975(96)00078-3 2003-11-19 On Separating the Erew and Crew Pram Models. 343-346 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#GafniNR89 2003-11-19 Ordinal Recursive Bounds for Higman's Theorem. 63-84 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#CichonB98 http://dx.doi.org/10.1016/S0304-3975(97)00009-1 2003-11-19 Lower bounds for invariant queries in logics with counting. 153-180 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#LibkinW02 2003-11-19 A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation. 105-150 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#Jeffrey99 http://dx.doi.org/10.1016/S0304-3975(98)00356-9 2003-11-19 On Domination Problems for Permutation and Other Graphs. 181-198 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#BrandstadtK87 2003-11-19 The Firing Squad Synchronization Problem for Graphs. 39-61 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#NishitaniH81 2003-11-19 The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. 181-210 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#AmaldiK95 http://dx.doi.org/10.1016/0304-3975(94)00254-G 2003-11-19 On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. 237-260 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#AmaldiK98 http://dx.doi.org/10.1016/S0304-3975(97)00115-1 2003-11-19 Infinite-Word Languages and Continuous Mappings. 59-79 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Redziejowski86 2003-11-19 Hybrid diagrams. 565-597 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#AlfaroK03 2003-11-19 A Feature Constraint System for Logic Programming with Entailment. 263-283 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#Ait-KaciPS94 2003-11-19 Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. 39-53 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#DurisG82 2003-11-19 One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. 121-125 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#DurisH83 2003-11-19 A Note on the Density of Oracle Decreasing Time-Space Complexity. 435-444 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#DurisR94 2003-11-19 No NP Problems Averaging Over Ranking of Distributions are Harder. 229-245 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#BelangerW97 http://dx.doi.org/10.1016/S0304-3975(96)00272-1 2003-11-19 Systolic Convolution of Arithmetic Functions. 207-229 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#QuintonR92 2003-11-19 Two-dimensional on-line bin packing problem with rotatable items. 939-952 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#FujitaH02 2003-11-19 Multi-Dimensional Logic Programming: Theoretical Foundations. 319-345 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#OrgunD97 http://dx.doi.org/10.1016/S0304-3975(97)00048-0 2003-11-19 Axioms for real-time logics. 151-182 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#SchobbensRH02 http://dx.doi.org/10.1016/S0304-3975(00)00308-X 2003-11-19 Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. 219-233 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#DauchetTT02 http://dx.doi.org/10.1016/S0304-3975(02)00014-2 2003-11-19 On Fault Tolerance of Syntax. 215-222 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Slissenko93 2003-11-19 Normal Petri Nets. 307-315 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Yamasaki84 2003-11-19 Language-Theoretical Representations of omega-Languages. 247-254 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Yamasaki89 2003-11-19 Recursion Equation Sets Computing Logic Programs. 309-322 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Yamasaki90 2003-11-19 A Denotational Semantics and Dataflow Construction for Logic Programs. 71-91 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Yamasaki94 2003-11-19 SLDNF Resolution with Non-Safe Rule and Fixpoint Semantics for General Logic Programs. 283-303 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#Yamasaki96 http://dx.doi.org/10.1016/0304-3975(95)00109-3 2003-11-19 The Arithmetic of Reversed Positional Games. 247-249 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Yamasaki97 http://dx.doi.org/10.1016/S0304-3975(96)00156-9 2004-02-26 Voronoi diagrams on piecewise flat surfaces and an application to biological growth. 263-274 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#IndermitteLTC01 http://dx.doi.org/10.1016/S0304-3975(00)00248-6 2003-11-19 Distributed Sorting Algorithms for Multi-Channel Broadcast Networks. 193-203 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#MarbergG87 2003-11-19 Topological properties of Hausdorff discretization, and comparison to other discretization schemes. 243-268 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#TajineR02 http://dx.doi.org/10.1016/S0304-3975(01)00082-2 2003-11-19 Inferring a DNA Sequence from Erroneous Copies. 3-13 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#KececiogluLT97 http://dx.doi.org/10.1016/S0304-3975(97)00013-3 2003-11-19 Homogeneously Orderable Graphs. 209-232 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#BrandstadtDN97 http://dx.doi.org/10.1016/S0304-3975(96)00091-6 2003-11-19 On Two-Way Sequential Transductions of Full Semi-AFL's. 287-309 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Ibarra78 2003-11-19 2DST Mapppings on Languages and Related Problems. 219-227 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Ibarra82 2003-11-19 On Some Decision Questions Concerning Pushdown Machines. 313-322 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Ibarra83 2003-11-19 On Repetition-Free Binary Words of Minimal Density. 161-175 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#KolpakovKT99 http://dx.doi.org/10.1016/S0304-3975(98)00257-6 2003-11-19 An NC Algorithm for Brooks' Theorem. 89-103 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Karloff89 2003-11-19 Reversible space-time simulation of cellular automata. 117-129 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Durand-Lose00 http://dx.doi.org/10.1016/S0304-3975(99)00075-4 2003-11-19 Parallel Transient Time of One-Dimensional Sand Pile. 183-193 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Durand-Lose98 http://dx.doi.org/10.1016/S0304-3975(97)00073-X 2003-11-19 Nonreturning PC Grammar Systems Can Be Simulated By Returning Systems. 463-474 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Dumitrescu96 http://dx.doi.org/10.1016/0304-3975(95)00258-8 2003-11-19 On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers. 207-229 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#AndreB98 http://dx.doi.org/10.1016/S0304-3975(97)00080-7 2004-09-08 A multi-tree routing scheme using acyclic orientations. 487-494 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#AnnexsteinBHS00 http://dx.doi.org/10.1016/S0304-3975(99)00244-3 2003-11-19 On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space. 113-128 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#CremersH77 2003-11-19 Explicit substitutions for pi-congruences. 83-134 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Quaglia01 http://dx.doi.org/10.1016/S0304-3975(00)00376-5 2003-11-19 On computing graph minor obstruction sets. 107-127 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#CattellDDFL00 http://dx.doi.org/10.1016/S0304-3975(97)00300-9 2003-11-19 A Contructive Method for Abstract Algebraic Software Specification. 139-204 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#Klaeren84 2003-11-19 The proof complexity of analytic and clausal tableaux. 477-487 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Massacci00 http://dx.doi.org/10.1016/S0304-3975(00)00148-1 2003-11-19 Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. 131-170 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#SagivRH96 http://dx.doi.org/10.1016/0304-3975(96)00072-2 2003-11-19 Foreword. 1 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Seebold03 2003-11-19 Fibonacci Morphisms and Sturmian Words. 365-384 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Seebold91 2003-11-19 On the Conjugation of Standard Morphisms. 91-109 1998 195 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#Seebold98 http://dx.doi.org/10.1016/S0304-3975(97)00159-X 2003-11-19 The Undecidability of the Preperfectness of Thue Systems. 165-174 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#NarendranM84 2003-11-19 Complexity Results on the Conjugacy Problem for Monoids. 227-243 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#NarendranO85 2003-11-19 The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. 27-38 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#NarendranO86 2003-11-19 Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. 319-332 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#NarendranO89 2003-11-19 Aspects of complexity of probabilistic learning under monotonicity constraints. 275-322 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Meyer01 http://dx.doi.org/10.1016/S0304-3975(00)00273-5 2003-11-19 Merging Regular Processes by Means of Fixed-Point Theory. 193-260 1986 45 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Meyer86 2003-11-19 Probabilistic Language Learning Under Monotonicity Constraints. 81-128 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Meyer97 http://dx.doi.org/10.1016/S0304-3975(97)00017-0 2003-11-19 Modular Specification of Process Algebras. 293-348 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#GlabbeekV93 2003-11-19 A Combinatorial Approach to Nonlinear Functional Expansions: An Introduction with an Example. 179-193 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#LerouxV91 2003-11-19 Merging of 4 or 5 Elements with n Elements. 19-37 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Monting81 2003-11-19 Language Operators Related to Init. 161-175 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#ProdingerU79 2003-11-19 Which Data Types have omega-complete Initial Algebra Specifications? 149-168 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#BergstraH94 2003-11-19 Church-Rosser Strategies in the Lambda Calculus. 27-38 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#BergstraK79 2003-11-19 Invertible Terms in the Lambda Calculus. 19-37 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#BergstraK80 2003-11-19 Proving Program Inclusion Using Hoare's Logic. 1-48 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#BergstraK84 2003-11-19 Algebra of Communicating Processes with Abstraction. 77-121 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#BergstraK85 2003-11-19 On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic. 269-279 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#BergstraM82 2003-11-19 Non-regular iterators in process algebra. 203-229 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#BergstraP01 http://dx.doi.org/10.1016/S0304-3975(00)00413-8 2003-11-19 Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. 303-315 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#BergstraT82 2003-11-19 Hoare's Logic and Peano's Arithmetic. 265-284 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#BergstraT83 2003-11-19 Hoare's Logic for Programming Languages with two Data Types. 215-221 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#BergstraT84 2003-11-19 Algebraic Specifications of Computable and Semicomputable Data Types. 137-181 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#BergstraT87 2003-11-19 Information Storage and Retrieval - Mathematical Foundations II (Combinatorial Problems). 183-211 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Lipski76 2003-11-19 Bounds on the Variety Generated by Completely Regular Syntactic Monoids from Finite Prefix Codes. 189-208 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Reilly94 2003-11-19 <i>d</i>-Ary Logic. 249-269 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Vilfan76 2003-11-19 Bounded Existentials and Minimal Typing. 75-96 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#GhelliP98 http://dx.doi.org/10.1016/S0304-3975(96)00300-3 2003-11-19 Dynamic deterministic pattern-matching. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#NedjahM00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Towards a Programming Language Based on the Notion of Two-Level Grammar. 13-43 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Maluszynski84 2003-11-19 A bijection for triangulations of a polygon with interior points and multiple edges. 385-401 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00226-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#PoulalhonS03 2003-11-24 Wire segmenting for buffer insertion based on RSTP-MSP. 257-267 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#LuGHS01 http://dx.doi.org/10.1016/S0304-3975(00)00199-7 2005-06-21 Hierarchical Verification of Asynchronous Circuits Using Temporal Logic. 269-291 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#MishraC85 2003-11-19 Concrete data structures and functional parallel programming. 233-267 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#HainsLM01 http://dx.doi.org/10.1016/S0304-3975(00)00010-4 2003-11-19 Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. 123-141 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#Gustedt98 http://dx.doi.org/10.1016/S0304-3975(97)00291-0 2003-11-19 Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. 211-224 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Esparza98 http://dx.doi.org/10.1016/S0304-3975(97)00235-1 2003-11-19 On the Need for a Different Backtracking Rule when Dealing with Late Evaluation. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#GavanelliM99 2003-11-19 Higher-Dimensional Word Problems with Applications to Equational Logic. 43-62 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Burroni93 2003-11-19 Equational Properties of Kleene Algebras of Relations with Conversion. 237-251 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#EsikB95 http://dx.doi.org/10.1016/0304-3975(94)00041-G 2003-11-19 Complete Classes of Automata for the alpha-0-Product. 1-14 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#EsikD86 2003-11-19 On alpha-0-Products and alpha-2-Products. 1-8 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#EsikG86 2003-11-19 On a Representation of Tree Automata. 243-255 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#EsikG87 2003-11-19 Equational Properties of Iteration in Algebraically Complete Categories. 61-89 1998 195 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#EsikL98 http://dx.doi.org/10.1016/S0304-3975(97)00158-8 2003-11-19 Finding Optimal Subgraphs by Local Search. 265-271 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Shimozono97 http://dx.doi.org/10.1016/S0304-3975(96)00135-1 2003-11-19 Alphabet Indexing for Approximating Features of Symbols. 245-260 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Shimozono99 http://dx.doi.org/10.1016/S0304-3975(98)00088-7 2003-11-19 Automata Represented by Products of Soliton Automata. 163-181 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#GecsegJ90 2003-11-19 On alpha-0-nu-1-Products of Automata. 35-51 1991 80 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#GecsegJ91 2003-11-19 Linear Indexed Languages. 47-60 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#DuskeP84 2003-11-19 Regular database update logics. 591-661 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#SpruitWM01 http://dx.doi.org/10.1016/S0304-3975(00)00289-9 2003-11-19 Universal computation with Watson-Crick D0L systems. 485-501 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Sosik02 2003-11-19 Watson-Crick D0L systems: generative power and undecidable problems. 101-112 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00214-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Sosik03 2003-11-19 Permutations Generated by Token Passing in Graphs. 103-118 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#AtkinsonLT97 http://dx.doi.org/10.1016/S0304-3975(96)00057-6 2003-11-19 Counting modulo finite semigroups. 107-114 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Esbelin01 http://dx.doi.org/10.1016/S0304-3975(00)00112-2 2003-11-19 Information Flow in Tabular Interpretations for Generalized Push-Down Automata. 167-198 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#ClergerieB98 http://dx.doi.org/10.1016/S0304-3975(97)00272-7 2003-11-19 Optimal placement of data replicas in distributed database with majority voting protocol. 555-571 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#ShekharW01 http://dx.doi.org/10.1016/S0304-3975(00)00161-4 2003-11-19 Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors. 61-79 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Lavault90 2003-11-19 Algorithms for the parallel alternating direction access machine. 151-173 2000 245 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#ChlebusCGKP00 http://dx.doi.org/10.1016/S0304-3975(99)00280-7 2003-11-19 Approximations for the general block distribution of a matrix. 145-160 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#AspvallHM01 http://dx.doi.org/10.1016/S0304-3975(00)00187-0 2003-11-19 On the Consistency of Koomen's Fair Abstraction Rule. 129-176 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#BaetenBK87 2003-11-19 Determinism - (Event Structure Isomorphism = Step Sequence Equivalence). 275-294 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Vaandrager91 2003-11-19 Using Induction and Rewriting to Verify and Complete Parameterized Specifications. 245-276 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Bouhoula96 http://dx.doi.org/10.1016/S0304-3975(96)80708-0 2003-11-19 PERT scheduling with convex cost functions. 145-164 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Sourd03 2003-11-19 Concurrent multicast in weighted networks. 359-377 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#MarcoGV01 http://dx.doi.org/10.1016/S0304-3975(00)00018-9 2003-11-19 Convexity and logical analysis of data. 95-116 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#EkinHK00 http://dx.doi.org/10.1016/S0304-3975(98)00337-5 2003-11-19 Competitive Algorithms for the Weighted Server Problem. 85-99 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#FiatR94 2003-11-19 Horn Functions and Submodular Boolean Functions. 257-270 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#EkinHP97 http://dx.doi.org/10.1016/S0304-3975(96)00202-2 2003-11-19 The Complexity of Gentzen Systems for Propositional Logic. 87-97 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Urquhart89 2003-11-19 Optimal Scheduling Algorithms for Parallel Gaussian Elimination. 159-173 1989 64 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#RobertT89 2003-11-19 A Nim game played on graphs II. 401-419 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00293-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Fukuyama03a 2003-11-19 Petri Nets with Individual Tokens. 185-213 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Reisig85 2003-11-19 Petri Nets and Algebraic Specifications. 1-34 1991 80 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Reisig91 2003-11-19 Tree Transducers with External Functions. 185-236 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#FulopHVV93 2003-11-19 A Topological Property of Rational omega-Languages. 29-36 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Arnold95a http://dx.doi.org/10.1016/0304-3975(95)00046-Y 2003-11-19 On Transductions of Formal Power Series over Complete Semirings. 27-39 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Karner92a 2003-11-19 Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise. 629-647 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#ArnoldB02 2003-11-19 An Algebraic Characterization of Observational Equivalence. 289-299 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#ArnoldC96 http://dx.doi.org/10.1016/0304-3975(95)00141-7 2003-11-19 Morphismes et Bimorphismes d'Arbres. 33-93 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#ArnoldD82 2003-11-19 A New Proof of two Theorems about Rational Transductions. 261-263 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#ArnoldL79 2003-11-19 Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. 181-205 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#ArnoldN80 2003-11-19 Towards an Algebra for Timed Behaviours. 335-363 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Maggiolo-SchettiniW92 2003-11-19 Weak normalization implies strong normalization in a class of non-dependent pure type systems. 317-361 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#BartheHS01a http://dx.doi.org/10.1016/S0304-3975(01)00012-3 2003-11-19 Branching time controllers for discrete event systems. 117-149 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#MadhusudanT02 http://dx.doi.org/10.1016/S0304-3975(00)00307-8 2003-11-19 On boolean lowness and boolean highness. 305-321 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#ReithW01 http://dx.doi.org/10.1016/S0304-3975(00)00146-8 2003-11-19 DyC: an expressive annotation-directed dynamic compiler for C. 147-199 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#GrantMPCE00 http://dx.doi.org/10.1016/S0304-3975(00)00051-7 2003-11-19 Preface. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#Fidge01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Foreword. 477 2003 293 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Fidge03 2003-11-19 A Criterion for Proving Noetherianity of a Relation. 321-325 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Dehornoy92 2004-06-11 Approximating uniform triangular meshes in polygons. 879-895 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#AurenhammerKKOX02 2003-11-19 On the Computational Power of Self-Stabilizing Systems. 159-170 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#AbelloD97 http://dx.doi.org/10.1016/S0304-3975(96)00150-8 2003-11-19 An efficient k nearest neighbors searching algorithm for a query line. 273-288 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00322-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#NandyDG03 2003-11-19 Dynamically maintaining the widest k-dense corridor. 627-639 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#NandyHA01 http://dx.doi.org/10.1016/S0304-3975(00)00370-4 2003-11-19 Regular Expressions into Finite Automata. 197-213 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Bruggemann-Klein93 2003-11-19 Equations in free semigroups with involution and their relation to equations in free groups. 271-280 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00642-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Gutierrez03 2003-11-19 epsilon-Approximations of k-Label Spaces. 145-157 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#HasegawaII95 http://dx.doi.org/10.1016/0304-3975(94)00165-F 2003-11-19 A predicative and decidable characterization of the polynomial classes of languages. 83-99 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#CaporasoZG01 http://dx.doi.org/10.1016/S0304-3975(99)00116-4 2003-11-19 On list update and work function algorithms. 393-418 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#AndersonHKRS02 2003-11-19 On the Order of Approximation in Approximative Triadic Decompositions of Tensors. 1-14 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#LehmkuhlL89 2003-11-19 Abstract Fairness and Semantics. 139-153 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#NolteP97 http://dx.doi.org/10.1016/S0304-3975(96)00237-X 2003-11-19 Integrating information visualization and retrieval for WWW information discovery. 547-571 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#OhwadaM03 2003-11-19 On Small Generators 337-341 1984 34 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#Schoning84a 2003-11-19 A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#GadducciHL99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Lower bounds for random 3-SAT via differential equations. 159-185 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Achlioptas01 http://dx.doi.org/10.1016/S0304-3975(01)00159-1 2003-11-19 Composition is Almost (but not Quite) as Good as s-1-1. 169-195 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Marcoux93 2003-11-19 A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. 99-111 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#DamiandHP01 http://dx.doi.org/10.1016/S0304-3975(00)00234-6 2003-11-19 Canonical derivatives, partial derivatives and finite automaton constructions. 137-163 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#ChamparnaudZ02 2003-11-19 Statistic and Ergodic Properties of Minkowski's Diagonal Continued Fraction. 197-212 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Kraaikamp89 2003-11-19 Generalized discrete timed automata: decidable approximations for safety verificatio. 59-74 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00432-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#DangIK03 2003-11-19 Optimal algorithms for complete linkage clustering in d dimensions. 139-149 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#KrznaricL02 http://dx.doi.org/10.1016/S0304-3975(01)00239-0 2003-11-19 Shuffle on Trajectories: Syntactic Constraints. 1-56 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#MateescuRS98 http://dx.doi.org/10.1016/S0304-3975(97)00163-1 2003-11-19 Presburger liveness verification of discrete timed automata. 413-438 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00485-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#DangPK03 2003-11-19 Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution. 313-334 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#BlundoMS98 http://dx.doi.org/10.1016/S0304-3975(98)80007-8 2003-11-19 Intersection number and topology preservation within digital surfaces. 109-150 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#FoureyM02 http://dx.doi.org/10.1016/S0304-3975(01)00059-7 2003-11-19 Genuine atomic multicast in asynchronous distributed systems. 297-316 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#GuerraouiS01 http://dx.doi.org/10.1016/S0304-3975(99)00161-9 2003-11-19 Semantics of Interference Control. 297-310 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#Tennent83 2003-11-19 Foreword: Special Volume of TAPSOFT 1995 Papers. 1 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#MossesNS96 2003-11-19 An example of a computable absolutely normal number. 947-958 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#BecherF02 http://dx.doi.org/10.1016/S0304-3975(01)00170-0 2003-11-19 Unbounded Hardware is Equivalent to Deterministic Turing Machines. 123-130 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#ChazelleM83 2003-11-19 Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals. 101-124 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#FlajoletS95 http://dx.doi.org/10.1016/0304-3975(94)00281-M 2003-11-19 Continued Fraction Algorithms, Functional Operators, and Structure Constants. 1-34 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#FlajoletV98 http://dx.doi.org/10.1016/S0304-3975(97)00123-0 2003-11-19 The Powerset Operator on Abstract Interpretations. 77-111 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#FileR99 http://dx.doi.org/10.1016/S0304-3975(98)00007-3 2003-11-19 Towards a Theory of Local and Global in Computation. 41-67 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Abelson78 2003-11-19 Language Complexity on the Synchronous Anonymous Ring. 169-185 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#AttiyaM87 2003-11-19 Fast Verification, Testing, and Generation of Large Primes. 1-16 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Plaisted79 2003-11-19 New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. 125-138 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Plaisted84 2003-11-19 Complete Divisibility Problems for Slowly Utilized Oracles. 245-260 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Plaisted85 2003-11-19 The Quotient of an Abstract Interpretation. 163-192 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#CortesiFW98 http://dx.doi.org/10.1016/S0304-3975(97)00137-0 2003-11-19 The System F of Variable Types, Fifteen Years Later. 159-192 1986 45 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Girard86 2003-11-19 Linear Logic. 1-102 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#Girard87 2003-11-19 On Denotational Completeness. 249-273 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Girard99 http://dx.doi.org/10.1016/S0304-3975(99)00055-9 2003-11-19 Truncated suffix trees and their application to data compression. 87-101 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00053-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#NaAIP03 2003-11-19 Regularity of Relations: A Measure of Uniformity. 323-339 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#JaouaMBD91 2003-11-19 Domino Tiling in Planar Graphs with Regular and Bipartite Dual. 137-142 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Chaboud96 http://dx.doi.org/10.1016/0304-3975(95)00206-5 2003-11-19 Some Behavioural Aspects of Net Theory. 133-153 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Thiagarajan90 2003-11-19 Fugitive-Search Games on Graphs and Related Parameters. 233-254 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#DendrisKT97 http://dx.doi.org/10.1016/S0304-3975(96)00177-6 2003-11-19 Univariate Polynomial Factorization Over Finite Fields. 1-36 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#NaudinQ98 http://dx.doi.org/10.1016/S0304-3975(97)80001-1 2003-11-19 Data abstractions for decision tree induction. 387-416 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#KudohHO03 2003-11-19 On the landscape ruggedness of the quadratic assignment problem. 159-172 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#AngelZ01 http://dx.doi.org/10.1016/S0304-3975(00)00239-5 2003-11-19 Autocorrelation Coefficient for the Graph Bipartitioning Problem. 229-243 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#AngelZ98 http://dx.doi.org/10.1016/S0304-3975(97)00176-X 2003-11-19 Computability of a Map and Decidability of its Graph in the Model of Blum, Shub and Smale. 219-223 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#CeolaL98 http://dx.doi.org/10.1016/S0304-3975(97)00177-1 2004-02-11 An Improved Algorithm for the Evaluation of Fixpoint Expressions. 237-255 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#BrowneCJLM97 http://dx.doi.org/10.1016/S0304-3975(96)00228-9 2003-11-19 System T, Call-by-Value and the Minimum Problem. 301-315 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#ColsonF98 http://dx.doi.org/10.1016/S0304-3975(98)00011-5 2003-11-19 Equational Programming in Lambda-Calculus via SL-Systems. Part 2. 185-216 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#Tronci96a http://dx.doi.org/10.1016/0304-3975(95)00106-9 2003-11-19 Biography of A.O. Slissenko. 3-5 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00441-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#BeauquierGM03 2003-11-19 Interval Logics and Their Decision Procedures. Part II: A Real-Time Interval Logic. 1-46 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#RamakrishnaMMDK96a http://dx.doi.org/10.1016/S0304-3975(96)80701-8 2003-11-19 Primality Testing and Factoring. 211-215 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#FinnL83 2003-11-19 Small Weight Bases for Hamming Codes. 337-345 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#TrompZZ97 http://dx.doi.org/10.1016/S0304-3975(96)00278-2 2004-11-22 Computer science and the fine structure of Borel sets. 85-105 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#DuparcFR01 http://dx.doi.org/10.1016/S0304-3975(00)00111-0 2003-11-19 Balance in AVL Trees and Space Cost of Brother Trees. 199-228 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#CameronW94 2003-11-19 A Comparison of Polynomial Time Reducibilities. 103-123 1975 1 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#LadnerLS75 2003-11-19 Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange Case" of Chaotic Rule 180. 171-187 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#CattaneoM98 http://dx.doi.org/10.1016/S0304-3975(97)00210-7 2003-11-19 Local and Global Relational Consistency. 283-308 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#DechterB97 http://dx.doi.org/10.1016/S0304-3975(97)86737-0 2003-11-19 The ``Magic'' Rule Spaces of Neural-Like Elementary Cellular Automata. 77-102 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#CattaneoV97 http://dx.doi.org/10.1016/S0304-3975(96)00053-9 2003-11-19 Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. 59-84 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#HabibMPV00 http://dx.doi.org/10.1016/S0304-3975(97)00241-7 2003-11-19 Fibred models of processes. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Fiore99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Fast Detection of Polyhedral Intersection. 241-253 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#DobkinK83 2003-11-19 Determining the Mode. 255-263 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#DobkinM80 2003-11-19 The Complexity of Linear Programming. 1-18 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#DobkinR80 2003-11-19 Prediction algorithms and confidence measures based on algorithmic randomness theory. 209-217 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#GammermanV02 2003-11-19 Padding, Commitment and Self-Reducibility. 189-199 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#KhadilkarB91 2003-11-19 Rewriting Extended Regular Expressions. 51-72 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#AntimirovM95 http://dx.doi.org/10.1016/0304-3975(95)80024-4 2003-11-19 Structural and Behavioral Equivalence Relations in Automata Networks. 223-237 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#SaitoN89 2003-11-19 A kappa-Denotational Semantics for Map Theory in ZFC + SI. 137-202 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#BerlineG97 http://dx.doi.org/10.1016/S0304-3975(96)00302-7 2003-11-19 A kappa-Denotational Semantics for Map Theory in ZFC+SI. 397-398 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#BerlineG99 http://dx.doi.org/10.1016/S0304-3975(98)00107-8 2003-11-19 Parallel and Sequential Computation on Boolean Networks. 275-300 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Fogelman-Soulie85 2003-11-19 Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. 247-260 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#Schwichtenberg99 http://dx.doi.org/10.1016/S0304-3975(98)00143-1 2003-11-19 Differential Approximation Algorithms for Some Combinatorial Optimization Problems. 107-122 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#DemangeGP98 http://dx.doi.org/10.1016/S0304-3975(97)00099-6 2003-11-19 Semantics and Strong Sequentiality of Priority Term Rewriting Systems. 87-110 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#SakaiT98 http://dx.doi.org/10.1016/S0304-3975(98)00080-2 2003-11-19 On D0L power series. 117-134 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Honkala00 http://dx.doi.org/10.1016/S0304-3975(98)00338-7 2003-11-19 On Parikh slender context-free languages. 667-677 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Honkala01 http://dx.doi.org/10.1016/S0304-3975(00)00393-5 2003-11-19 On images of D0L and DT0L power series. 1869-1882 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Honkala03 2003-11-19 Bases and Ambiguity of Number Systems. 61-71 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Honkala84 2003-11-19 A Necessary Condition for the Rationality of the Zeta Function of a Regular Language. 341-347 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Honkala89 2003-11-19 On Algebraic Generalized Zeta Functions of Formal Power Series. 263-273 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Honkala91 2003-11-19 On D0L Systems with Immigration. 229-245 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Honkala93 2003-11-19 On Generalized DT0L Systems and Their Fixed Points. 269-286 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Honkala94 2003-11-19 On Lindenmayerian Algebraic Sequences. 143-154 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Honkala97 http://dx.doi.org/10.1016/S0304-3975(96)00314-3 2003-11-19 On the Equivalence Problem for E-Pattern Languages. 231-248 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#OhlebuschU97 http://dx.doi.org/10.1016/S0304-3975(96)00289-7 2003-11-19 Program Composition via Unification. 139-179 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#FixFG94 2003-11-19 On the Random Generation and Counting of Matchings in Dense Graphs. 281-290 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#DiazSS98 http://dx.doi.org/10.1016/S0304-3975(97)00297-1 2003-11-19 Counting H-colorings of partial k-trees. 291-309 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#DiazST02 http://dx.doi.org/10.1016/S0304-3975(02)00017-8 2003-11-19 Reversible, Irreversible and Optimal lambda-Machines. 79-97 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#DanosR99 http://dx.doi.org/10.1016/S0304-3975(99)00049-3 2003-11-19 A Non-Ground Realization of the Stable and Well-Founded Semantics. 221-262 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#GottlobMNSS96 http://dx.doi.org/10.1016/0304-3975(95)00207-3 2003-11-19 Remarques sur les Langages de Parenthèses. 337-349 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#AutebertBBS84 2003-11-19 Undirected Edge Geography. 371-381 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#FraenkelSU93 2003-11-19 Kleene Chain Completeness and Fixedpoint Properties. 317-331 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#KamimuraT83 2003-11-19 Effectively Given Spaces. 155-166 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#KamimuraT84 2003-11-19 Sketches and Parametrization. 117-130 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#DuvalS94 2003-11-19 <i>SLD</i>-Derivations. 275-309 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#CominiM99 http://dx.doi.org/10.1016/S0304-3975(97)00174-6 2003-11-19 Polynomial time algorithms for three-label point labeling. 75-87 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00433-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#DuncanQVZ03 2003-11-19 Structural properties of bounded relations with an application to NP optimization problems. 101-124 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Merkle01 http://dx.doi.org/10.1016/S0304-3975(99)00121-8 2003-11-19 Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model. 279-341 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Takahashi96a http://dx.doi.org/10.1016/0304-3975(95)00085-2 2003-11-19 Program Schemata vs. Automata for Decidability of Program Logics. 15-27 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Shilov97 http://dx.doi.org/10.1016/S0304-3975(96)00168-5 2003-11-19 Characterizing bipartite Toeplitz graphs. 47-58 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Euler01 http://dx.doi.org/10.1016/S0304-3975(00)00230-9 2003-11-19 The Inference of Tree Languages from Finite Samples: An Algebraic Approach. 337-367 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#KnuutilaS94 2003-11-19 A Note on omega-Regular Languages. 217-225 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#TakahashiY83 2003-11-19 Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation. 139-156 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#KawamuraK90 2003-11-19 Generating irregular partitionable data structures. 31-80 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#PanangadenV00 http://dx.doi.org/10.1016/S0304-3975(98)00226-6 2003-11-19 ₄₄-Sparse Graphs. 269-286 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#GiakoumakisV97 http://dx.doi.org/10.1016/S0304-3975(96)00220-4 2003-11-19 Full Abstraction for Idealized Algol with Passive Expressions. 3-42 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#AbramskyM99 http://dx.doi.org/10.1016/S0304-3975(99)00047-X 2003-11-19 Towards a semantics of proofs for non-commutative logic: multiplicatives and additives. 335-351 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Abrusci03 2003-11-19 Shortest Path Algorithms for Nearly Acyclic Directed Graphs. 143-150 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#Takaoka98 http://dx.doi.org/10.1016/S0304-3975(97)00292-2 2003-11-19 Symbolic model checking with rich assertional languages. 93-112 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#KestenMMPS01 http://dx.doi.org/10.1016/S0304-3975(00)00103-1 2003-11-19 Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors. 273-282 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#KuriharaO92 2003-11-19 Modularity in Noncopying Term Rewriting. 139-169 1995 152 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#KuriharaO95 http://dx.doi.org/10.1016/0304-3975(94)00248-3 2003-11-19 Ramsey numbers for tournaments. 75-85 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#ManoussakisT01 http://dx.doi.org/10.1016/S0304-3975(00)00232-2 2003-11-19 Computing Downwards Accumulations on Trees Quickly. 67-80 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Gibbons96 http://dx.doi.org/10.1016/S0304-3975(96)00114-4 2003-11-19 GA performance distributions and randomly generated binary constraint satisfaction problems. 167-185 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#NaudtsS02 2003-11-19 Computation by `While' Programs on Topological Partial Algebras. 379-420 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#TuckerZ99 http://dx.doi.org/10.1016/S0304-3975(98)00297-7 2003-11-19 Foreword : Coalgebraic Methods in Computer Science 1998. 1 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#JacobsMR01 http://dx.doi.org/10.1016/S0304-3975(00)00119-5 2003-11-19 Synthesis and Equivalence of Concurrent Systems. 183-199 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Lisper88 2003-11-19 Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations. 61-85 1998 190 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#Lisper98 http://dx.doi.org/10.1016/S0304-3975(97)00084-4 2003-11-19 Large-Scale Addition of Machine Real Numbers: Accuracy Estimates. 151-170 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Mikov96 http://dx.doi.org/10.1016/0304-3975(95)00253-7 2003-11-19 Filter Models with Polymorphic Types. 143-148 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#JacobsMZ92 2003-11-19 The Parallel Complexity of Approximating the High Degree Subgraph Problem. 261-282 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#AndreevCCDAR98 http://dx.doi.org/10.1016/S0304-3975(97)00276-4 2003-11-19 Area Complexity of Merging. 157-163 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#PalkoSV91 2003-11-19 Free Shuffle Algebras in Language Varieties. 55-98 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#BloomE96a http://dx.doi.org/10.1016/0304-3975(95)00230-8 2003-11-19 Sturmian Words: Structure, Combinatorics, and Their Arithmetics. 45-82 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Luca97a http://dx.doi.org/10.1016/S0304-3975(96)00310-6 2003-11-19 On a Kind of Fatou Property of Context-Free Groups. 327-331 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Herbst92 2003-11-19 Some Combinatorial Properties of Sturmian Words. 361-285 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#LucaM94 2003-11-19 On Some Properties of Very Pure Codes. 157-170 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#LucaR80 2003-11-19 Star-Free Sets of Integers. 265-275 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#LucaR86 2003-11-19 Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups. 333-348 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#LucaV89 2003-11-19 Finiteness and Iteration Conditions for Semigroups. 315-327 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#LucaV91 2003-11-19 On Noncounting Regular Classes. 67-104 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#LucaV92 2003-11-19 Category-Sorted Algebra-Based Action Semantics. 73-95 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#EvenS90 2003-11-19 <i>st</i>-Numbering. 339-344 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#EvenT76 2003-11-19 <i>st</i>-Numbering. TCS 2(1976):339-344. 123 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#EvenT77 2003-11-19 Bounded time-stamping in message-passing systems. 221-239 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#MukundKS03 2003-11-19 Optimal binary search trees with costs depending on the access paths. 1799-1814 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#SzwarcfiterNBOCZ03 2003-11-19 Syntactic Theories in Practice. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#DanvyN01 2003-11-19 A first-order one-pass CPS transformation. 239-257 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00733-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#DanvyN03 2003-11-19 Lambda-dropping: transforming recursive equations into programs with block structure. 243-287 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#DanvyS00 http://dx.doi.org/10.1016/S0304-3975(00)00054-2 2003-11-19 A termination proof for epsilon substitution using partial derivations. 187-213 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00451-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Mints03 2003-11-19 A Logical Basis for Programming Methodology. 43-60 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#TakasuK81 2003-11-19 Proving sequential function chart programs using timed automata. 141-155 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#LHerPM01 http://dx.doi.org/10.1016/S0304-3975(00)00301-7 2003-11-19 A Fixed-Point Theorem in a Category of Compact Metric Spaces. 311-320 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#AlessiBB95 http://dx.doi.org/10.1016/0304-3975(95)00015-O 2003-11-19 A category of compositional domain-models for separable Stone spaces. 599-635 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#AlessiBH03 2003-11-19 Reductions and functors from problems to word problems. 81-104 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Birget00 http://dx.doi.org/10.1016/S0304-3975(98)00131-5 2003-11-19 Concatenation of Inputs in a Two-Way Automaton. 141-156 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Birget89 2003-11-19 Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity. 267-291 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Birget93 2003-11-19 Secure Multiparty Computations Without Computers. 173-183 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#NiemiR98 http://dx.doi.org/10.1016/S0304-3975(97)00107-2 2003-11-19 Efficient Voting with No Selling of Votes. 105-116 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#NiemiR99 http://dx.doi.org/10.1016/S0304-3975(99)00068-7 2003-11-19 Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. 213-238 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#JanickiLKD86 2003-11-19 The component hierarchy of chain-free cooperating distributed regular tree grammars. 229-240 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#DanyiF01 http://dx.doi.org/10.1016/S0304-3975(00)00192-4 2003-11-19 Compositions with Superlinear Deterministic Top-Down Tree Transformations. 57-85 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#DanyiF98 http://dx.doi.org/10.1016/S0304-3975(96)00332-5 2003-11-19 Infinite Linear Systems and one Counter Languages. 95-126 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#KuichU83 2003-11-19 Une Note sur le Cylindre des Langages Déterministes. 395-399 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Autebert79 2003-11-19 Some Results about Centralized PC Grammar Systems. 383-398 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Autebert99 http://dx.doi.org/10.1016/S0304-3975(98)00265-5 2003-11-19 Non-Uniform Partial-Match File Designs. 1-23 1977 5 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Burkhard77 2006-03-31 An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages. 193-222 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Burkhard85 2003-11-19 Fairness and Control in Multi-Agent Systems. 109-127 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#Burkhard97 http://dx.doi.org/10.1016/S0304-3975(96)00178-8 2003-11-19 Unique Decomposition of Processes. 357-363 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#MilnerM93 2003-11-19 Co-Induction in Relational Semantics. 209-220 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#MilnerT91 2003-11-19 On a Possible Classification of Real-Time Constructed Sequences. 143-148 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Bleuzen-Guernalec89 2003-11-19 An Event Structure Semantics for General Petri Nets. 129-170 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#HoogersKT96 http://dx.doi.org/10.1016/0304-3975(95)00120-4 2003-11-19 A small final coalgebra theorem. 129-145 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#KawaharaM00 http://dx.doi.org/10.1016/S0304-3975(97)00302-2 2003-11-19 New applications of the incompressibility method: Part II. 59-70 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#BuhrmanJLV00 http://dx.doi.org/10.1016/S0304-3975(99)00184-X 2003-11-19 One-Way Functions and the Isomorphism Conjecture. 309-321 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Ganesan94 2003-11-19 A Uniform Treatment of Order of Evalaution and Aggregate Update. 231-262 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#DraghicescuP93 2003-11-19 Preface. 1 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#AdamekEH03 2006-09-01 On abstract data types presented by multiequations. 427-462 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#AdamekHR02 http://dx.doi.org/10.1016/S0304-3975(01)00189-X 2003-11-19 Papers from CG 1998 - Foreword. 1-3 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#HerikI01 http://dx.doi.org/10.1016/S0304-3975(00)00072-4 2003-11-19 On the approximability of the Steiner tree problem. 387-402 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00414-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Thimm03 2003-11-19 A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm. 157-177 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#ManziniM99 http://dx.doi.org/10.1016/S0304-3975(99)00031-6 2003-11-19 Continuous Semilattices. 293-313 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#AdamekRN86 2003-11-19 Locally Commutative Power Semigroups and Counting Factors of Words. 3-16 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Almeida93 2003-11-19 A Polynomial-Bisimilar Normalization for Reset Petri Nets. 187-194 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#DufourdF99 http://dx.doi.org/10.1016/S0304-3975(98)00351-X 2003-11-19 Deterministic Generalized Automata. 191-208 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#GiammarresiM99 http://dx.doi.org/10.1016/S0304-3975(97)00166-7 2003-11-19 Animaux et arbres guingois. 67-89 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#BetremaP93 2003-11-19 Economy of Description by Parsers, DPDA'S, and PDA'S. 143-153 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#GellerHSU77 2003-11-19 If NP has Polynomial-Size Circuits, then MA=AM. 279-282 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#ArvindKSS95 http://dx.doi.org/10.1016/0304-3975(95)91133-B 2003-11-19 Self-Embedding Indexed Grammars. 219-223 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#ParchmannD86 2003-11-19 Grammars, Derivation Modes and Properties of Indexed and Type-0 Languages. 23-42 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#ParchmannD87 2003-11-19 The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective). 2001 58 Electr. Notes Theor. Comput. Sci. 1 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#VestergaardB01 2003-11-19 PC grammar systems with five context-free components generate all recursively enumerable languages. 785-794 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00852-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Csuhaj-VarjuPV03 2003-11-19 A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics. 489-512 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#YamasakiK01 http://dx.doi.org/10.1016/S0304-3975(00)00201-2 2003-11-19 Soudness of Abductive Proof Procedure with Respect to Constraint for Non-Ground Abducibles. 257-281 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#YamasakiK98 http://dx.doi.org/10.1016/S0304-3975(97)00171-0 2003-11-19 Generalized Parenthesis Languages and Minimization of their Parenthesis Parts. 1-11 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#YamasakiT84 2003-11-19 On the Power of Inductive Inference from Good Examples. 131-144 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#FreivaldsKW93 2003-11-19 Additive Cellular Automata and Algebraic Series. 345-354 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#LitowD93 2003-11-19 Deductive verification of real-time systems using STeP. 27-60 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#BjornerMSU01 http://dx.doi.org/10.1016/S0304-3975(00)00088-8 2003-11-19 Local properties of query languages. 277-308 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#DongLW00 http://dx.doi.org/10.1016/S0304-3975(99)00223-6 2003-11-19 A Linear Algorithm to Tile the Trapezes with h_m and v_n. 151-165 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Remila94 2003-11-19 Proving Entailment Between Conceptual State Specifications. 135-154 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Stark88 2003-11-19 Concurrent Transition Systems. 221-269 1989 64 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Stark89 2003-11-19 Construction of Voronoi Diagrams in the Plane by Using Maps. 331-343 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#ElbazS90 2003-11-19 On the Coarsest Congruence Within Global-Clock-Bounded Equivalence. 225-237 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Corradini98 http://dx.doi.org/10.1016/S0304-3975(97)00237-5 2003-11-19 Growth-sensitivity of context-free languages. 103-116 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00095-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Ceccherini-SilbersteinW03 2003-11-19 Preface. 333 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#GirardOS03 2003-11-19 <i>N</i><i>n</i><i>c</i><sup><i>ste</i></sup>. 31-49 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Didier99 http://dx.doi.org/10.1016/S0304-3975(97)00122-9 2003-11-19 Simultaneous (Poly-Time, Log-Space) Lower Bounds. 325-329 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#IwataK87 2003-11-19 The Othello game on an n*n board is PSPACE-complete. 329-340 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#IwataK94 2003-11-19 Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. 1-66 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#GirardSS92 2003-11-19 Reconstructing permutation matrices from diagonal sums. 235-249 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Lungo02 http://dx.doi.org/10.1016/S0304-3975(02)00015-4 2003-11-19 Polyominoes Defined by Two Vectors. 187-198 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Lungo94 2003-11-19 Rational Equivalence Relations. 39-60 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Johnson86a 2003-11-19 Preface: STRATEGIES 2001. 2001 58 Electr. Notes Theor. Comput. Sci. 2 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#BonacinaG01 2003-11-19 Towards a Foundation of Completion Procedures as Semidecision Procedures. 199-242 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#BonacinaH95 http://dx.doi.org/10.1016/0304-3975(94)00187-N 2003-11-19 The Densest Hemisphere Problem. 93-107 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#JohnsonP78 2003-11-19 Closure and decidability properties of some language classes with respect to ciliate bio-operations. 19-38 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00139-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#DaleyIK03 2003-11-19 Approximation Algorithms for Weighted Matching. 129-137 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Venkatesan87 2003-11-19 Asymptotic Optimal HEAPSORT Algorithm. 559-565 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#XunrangY94 2003-11-19 Optimal Heapsort Algorithm. 239-243 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#XunrangY96 http://dx.doi.org/10.1016/0304-3975(95)00233-2 2003-11-19 Forced color classes, intersection graphs and the strong perfect graph conjecture. 309-324 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Sakuma00 http://dx.doi.org/10.1016/S0304-3975(99)00201-7 2003-11-19 Représentations des nombres réels par développements en base entière et complexité. 171-182 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#LabhallaL91 2003-11-19 A Logico-Algebraic Approach to the Model Theory of Knowledge. 205-232 1989 66 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Abdallah89 2003-11-19 The Undecidability of the Second-Order Unification Problem. 225-230 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Goldfarb81 2003-11-19 Random Generation of Combinatorial Structures from a Uniform Distribution. 169-188 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#JerrumVV86 2003-11-19 Exact real number computations relative to hereditarily total functionals. 437-453 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Normann02 http://dx.doi.org/10.1016/S0304-3975(01)00100-1 2003-11-19 Dependent choice, `quote' and the clock. 259-276 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00776-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#Krivine03 2003-11-19 A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. 79-94 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Krivine94 2003-11-19 Characterizations of Some Classes of Regular Events. 17-42 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Stern85 2003-11-19 Codes and equations on trees. 483-509 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#MantaciR01 http://dx.doi.org/10.1016/S0304-3975(99)00317-5 2003-11-19 Some points in formal topology. 347-408 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00704-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Sambin03 2003-11-19 Programs and Program Verifications in a General Setting. 199-210 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Csirmaz81 2003-11-19 Determinateness of Program Equivalence over Peano Axioms. 231-235 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Csirmaz82 2003-11-19 Computations over Finite Monoids and their Test Complexity. 225-250 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#BeckerS91 2003-11-19 Generalized metrics and uniquely determined logic programs. 187-219 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00709-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#HitzlerS03 2003-11-19 Acceptable Programs Revisited. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#HitzlerS99 2003-11-19 Data Types, Abstract Data Types and Their Specification Problem. 89-127 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Majster79 2003-11-19 Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. 333-341 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Istrail82 2003-11-19 Nontrivial Monotone Weakly Symmetric Boolean Functions with Six Variables are Elusive. 193-197 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#GaoHW99 http://dx.doi.org/10.1016/S0304-3975(98)00350-8 2003-11-19 Principles of Programming with Complex Objects and Collection Types. 3-48 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#BunemanNTW95 http://dx.doi.org/10.1016/0304-3975(95)00024-Q 2003-11-19 On the Complexity of Regular Resolution and the Davis-Putnam Procedure. 23-46 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Galil77 2003-11-19 On the Theoretical Efficiency of Various Network Flow Algorithms. 103-111 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Galil81 2003-11-19 Combinatory Abstraction Bsing B, B' and Friends. 405-422 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#TriggHB94 2003-11-19 Eliminating the storage tape in reachability constructions. 687-706 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00545-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#IbarraD03 2003-11-19 Relating the Power of Cellular Arrays to Their Closure Properties. 225-238 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#IbarraJ88 2003-11-19 Characterizations and Computational Complexity of Systolic Trellis Automata. 123-153 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#IbarraK84 2003-11-19 A property of left-linear rewrite systems preserving recognizability. 477-498 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#GyenizseV00 http://dx.doi.org/10.1016/S0304-3975(00)00039-6 2003-11-19 Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. 71-97 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#GyenizseV96 http://dx.doi.org/10.1016/0304-3975(94)00303-3 2003-11-19 Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. 87-122 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#GyenizseV98 http://dx.doi.org/10.1016/S0304-3975(96)00333-7 2003-11-19 Two-Dimensional Iterative Arrays: Characterizations and Applications. 47-86 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#IbarraP88 2003-11-19 Simple Programming Languages and Restricted Classes of Turing Machines. 197-220 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#IbarraR83 2003-11-19 A Space-Optimal Solution of General Region Location. 329-336 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#EdelsbrunnerM81 2003-11-19 Augmenting the discrete timed automaton with other data structures. 191-204 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#IbarraS02 2003-11-19 On Space-Bounded Synchronized Alternating Turing Machines. 243-264 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#IbarraT92 2003-11-19 A Note on Simple Programs with Two Variables. 391-397 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#IbarraT93 2003-11-19 Parallel Parsing on a One-Way Linear Array of Finite-State Machines. 53-74 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#IbarraW91 2003-11-19 Inferences of Multivalued Dependencies in Fixed and Undetermined Universes. 93-105 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Biskup80 2003-11-19 Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Approach. 277-302 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Hortala-GonzalezR89 2003-11-19 Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. 1897-1913 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#PuricellaS03 2003-11-19 Parallel Chip Firing Games on Graphs. 291-300 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#BitarG92 2003-11-19 Tiling the Morse Sequence. 215-221 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Ferenczi92 2003-11-19 Tiling and Local Rank Properties of the Morse Sequence. 369-383 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Ferenczi94 2003-11-19 Computing LOGCFL certificates. 761-777 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#GottlobLS02 http://dx.doi.org/10.1016/S0304-3975(01)00108-6 2003-11-19 Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. 141-163 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#LutzM96 http://dx.doi.org/10.1016/0304-3975(95)00189-1 2003-11-19 Circuit Size Relative to Pseudorandom Oracles. 95-120 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#LutzS93 2003-11-19 Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. 185-194 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#LutzS99 http://dx.doi.org/10.1016/S0304-3975(99)00041-9 2003-11-19 Complexity measures and decision tree complexity: a survey. 21-43 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#BuhrmanW02 2003-11-19 The monadic second-order logic of graphs XII: planar graphs and planar maps. 1-32 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Courcelle00 http://dx.doi.org/10.1016/S0304-3975(99)00305-9 2003-11-19 The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. 1-36 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00578-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Courcelle03 2003-11-19 A Representation of Trees by Languages I. 255-279 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Courcelle78 2003-11-19 Fundamental Properties of Infinite Trees. 95-169 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Courcelle83 2003-11-19 Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars. 1-122 1986 42 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs42.html#Courcelle86 2003-11-19 An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars. 141-181 1987 55 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Courcelle87 2003-11-19 Recursive Queries and Context-free Graph Grammars. 217-244 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Courcelle91 2003-11-19 The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. 3-33 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Courcelle92 2003-11-19 Monadic Second-Order Definable Graph Transductions: A Survey. 53-75 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Courcelle94 2003-11-19 The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours. 125-162 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Courcelle95 http://dx.doi.org/10.1016/0304-3975(95)00049-3 2003-11-19 The Monadic Second-Order Logic of Graphs X: Linear Orderings. 87-143 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#Courcelle96 http://dx.doi.org/10.1016/0304-3975(95)00083-6 2003-11-19 The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. 35-58 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Courcelle99 http://dx.doi.org/10.1016/S0304-3975(98)00306-5 2003-11-19 Relations of Flow Languages to Petri Net Languages. 51-75 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#ArakiKT81 2004-02-18 Some permutation routing algorithms for low-dimensional hypercubes. 111-124 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#HwangYD02 http://dx.doi.org/10.1016/S0304-3975(00)00279-6 2003-11-19 Some Decision Problems for Polynomial Mappings. 317-325 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#BollmanL78 2003-11-19 Computing with quanta - impacts of quantum theory on computation. 267-298 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Hirvensalo02 2003-11-19 Presorting algorithms: An average-case point of view. 29-40 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#HwangYY00 http://dx.doi.org/10.1016/S0304-3975(98)00181-9 2003-11-19 Deciding True Concurrency Equivalences on Safe, Finite Nets. 107-143 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#JategaonkarM96 http://dx.doi.org/10.1016/0304-3975(95)00132-8 2003-11-19 Combinatoire des motifs d'une suite sturmienne bidimensionnelle. 261-285 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Vuillon98 http://dx.doi.org/10.1016/S0304-3975(97)00117-5 2003-11-19 Cell complexes, oriented matroids and digital geometry. 491-502 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00712-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Webster03 2003-11-19 Theories of Types and Proofs 1997 - Preface. 1-2 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#Dezani-CiancagliniOT02 http://dx.doi.org/10.1016/S0304-3975(00)00345-5 2003-11-19 Böhm's theorem for Berarducci trees. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Dezani-CiancagliniSV00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Infinitary lambda calculus and discrimination of Berarducci trees. 275-302 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00809-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Dezani-CiancagliniSV03 2003-11-19 Bounded Fixpoints for Complex Objects. 283-328 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Suciu97 http://dx.doi.org/10.1016/S0304-3975(96)00293-9 2003-11-19 Domain-Independent Queries on Databases with External Functions. 279-315 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#Suciu98 http://dx.doi.org/10.1016/S0304-3975(97)00093-5 2003-11-19 The prime number theorem is PRA-provable. 185-239 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Sudac01 http://dx.doi.org/10.1016/S0304-3975(00)00116-X 2003-11-19 Finite axiom systems for testing preorder and De Simone process languages. 97-139 2000 239 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Ulidowski00 http://dx.doi.org/10.1016/S0304-3975(99)00214-5 2003-11-19 Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . 71-96 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#DershowitzKP91 2003-11-19 Concurrent Regular Expressions and Their Relationship to Petri Nets. 285-304 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#GargR92 2003-11-19 Séparateurs dans les mots infinis engendrés par morphismes. 81-113 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Garel97 http://dx.doi.org/10.1016/S0304-3975(97)83808-X 2003-11-19 Methode de col et lois limites en analyse combinatoire. 261-280 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Gardy92 2003-11-19 Join Sizes, urn Models and Normal Limiting Distributions. 375-414 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Gardy94 2003-11-19 Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity. 141-157 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Herzog97 http://dx.doi.org/10.1016/S0304-3975(96)00267-8 2003-11-19 Polarized proof-nets and lambda-µ-calculus. 161-188 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Laurent03 2003-11-19 Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm. 59-78 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Stomp03 2003-11-19 Representing Scope in Intuitionistic Deductions. 129-188 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#Stone99 http://dx.doi.org/10.1016/S0304-3975(98)00244-8 2006-08-05 Filter Models for Conjunctive-Disjunctive lambda-Calculi. 83-128 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Dezani-CiancaglinidP96 http://dx.doi.org/10.1016/S0304-3975(96)80703-1 2003-11-19 On the Paging-Complexity of Periodic Arrangements. 171-197 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Stork77 2003-11-19 The Complexity of Evaluating Interpolation Polynomials. 319-323 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Stoss85 2003-11-19 On the Representation of Rational Functions of Bounded Complexity. 1-13 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Stoss89 2003-11-19 Axiomatisation of an Interval Calculus for Theorem Proving. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#Cerone01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 The Rank of a Formal Tree Power Series. 211-215 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#BozapalidisL83 2003-11-19 Generating Plans in Linear Logic I. A Geometry of Conjunctive Actions. 371-375 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Masseron93 2003-11-19 Application of Lempel-Ziv factorization to the approximation of grammar-based compression. 211-222 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00777-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Rytter03 2003-11-19 On the Complexity of Parallel Parsing of General Context-Free Languages. 315-321 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Rytter86 2003-11-19 On Efficient Parallel Computations for some Dynamic Programming Problems. 297-307 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Rytter88 2003-11-19 Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. 343-352 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Rytter95 http://dx.doi.org/10.1016/0304-3975(94)00265-K 2004-01-20 On computing Hilbert bases via the Elliot-MacMahon algorithm. 37-46 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Pasechnik01 http://dx.doi.org/10.1016/S0304-3975(00)00229-2 2003-11-19 Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting. 315-354 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#InverardiN95 http://dx.doi.org/10.1016/0304-3975(94)00074-S 2003-11-19 The Congruence Theory of Closure Properties of Regular Tree Languages. 261-271 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Tirri90 2003-11-19 On-line digit set conversion in real base. 221-235 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Frougny03 2003-11-19 Context-Free Grammars with Cancellation Properties. 3-13 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Frougny85 2003-11-19 Systemes de numeration linearires et Theta-representations. 223-236 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Frougny92 2003-11-19 Optimal Dimension-Exchange Token Distribution on Complete Binary Trees. 363-376 1999 220 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#HouleTT99 http://dx.doi.org/10.1016/S0304-3975(99)00007-9 2003-11-19 First-Order Linear Logic without Modalities is NEXPTIME-Hard. 139-153 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#LincolnS94 2003-11-19 Constant-Only Multiplicative Linear Logic is NP-Complete. 155-169 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#LincolnW94 2003-11-19 Proof-search in type-theoretic languages: an introduction. 5-53 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#GalmicheP00 http://dx.doi.org/10.1016/S0304-3975(99)00169-3 2003-11-19 On Proof Normalization in Linear Logic. 67-110 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#GalmicheP94 2003-11-19 DAL - A Logic for Data Analysis. 251-264 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#CerroO85 2003-11-19 <i>Corrigendum:</i>DAL-A Logic for Data Analysis. 345 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#CerroO86 2003-11-19 On reducibility and symmetry of disjoint NP pairs. 323-339 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00411-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Pudlak03 2003-11-19 Towards a Theory of Parallel Algorithms on Concrete Data Structures. 177-221 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#BrookesG92 2003-11-19 Foreword - MFPS 1996. 1-2 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#BrookesM02 http://dx.doi.org/10.1016/S0304-3975(00)00327-3 2003-11-19 A First Order Logic for Partial Functions. 37-69 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Gavilanes-FrancoL90 2003-11-19 Representation of Rational Functions with Prefix and Suffix Codings. 403-413 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#HarjuKLT94 2003-11-19 Graph Layout for Applications in Compiler Construction. 175-214 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Sander99 http://dx.doi.org/10.1016/S0304-3975(98)00270-9 2003-11-19 Selected Papers in honour of Maurice Nivat - Editorial. 1 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Ausiello02 http://dx.doi.org/10.1016/S0304-3975(02)00003-8 2003-11-19 Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword. 1 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Ausiello88 2003-11-19 Probabilistic inductive inference: a survey. 155-167 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Ambainis01 http://dx.doi.org/10.1016/S0304-3975(00)00218-8 2003-11-19 Multiple Sequence Comparison - A Peptide Matching Approach. 115-137 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#SagotVS97 http://dx.doi.org/10.1016/S0304-3975(96)00137-5 2003-11-19 Rasiowa-Sikorski deduction systems in computer science applications. 323-366 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Konikowska02 2003-11-19 Extensions to Barrington's M-Program Model. 31-61 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#BedardLM93 2003-11-19 Fault-diagnosis of grid structures. 1149-1174 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CarusoCMS03 2003-11-19 Confluency and strong normalizability of call-by-value lambda-µ-calculus. 429-463 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Nakazawa03 2003-11-19 Extended admissibility. 519-538 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Schroder02 http://dx.doi.org/10.1016/S0304-3975(01)00109-8 2003-11-19 Algorithms for the Fixed Point Property. 301-358 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Schroder99 http://dx.doi.org/10.1016/S0304-3975(98)00273-4 2003-11-19 PLC-automata: a new class of implementable real-time automata. 61-93 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#Dierks01 http://dx.doi.org/10.1016/S0304-3975(00)00089-X 2003-11-19 Termination and derivational complexity of confluent one-rule string-rewriting systems. 583-632 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#KobayashiKS01 http://dx.doi.org/10.1016/S0304-3975(00)00367-4 2003-11-19 Constant-Space String-Matching in Sublinear Average Time. 197-203 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#CrochemoreGR99 http://dx.doi.org/10.1016/S0304-3975(98)00259-X 2003-11-19 Average Polynomial Time Complexity of Some NP-Complete Problems. 219-327 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#DieuTH86 2003-11-19 sigma-Automata and Chebyshev-Polynomials. 49-73 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Sutner00 http://dx.doi.org/10.1016/S0304-3975(97)00242-9 2003-11-19 Cellular automata and intermediate degrees. 365-375 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00661-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Sutner03 2003-11-19 Distributed Concurrent Linear Logic Programming. 185-220 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#KobayashiSY99 http://dx.doi.org/10.1016/S0304-3975(99)00052-3 2003-11-19 Optimal insertion in deterministic DAWGs. 103-117 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00571-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#SgarbasFK03 2003-11-19 Characterization of omega-Regular Languages by First-Order Formulas. 315-327 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#KobayashiTY84 2003-11-19 Optimization Problems and the Polynomial Hierarchy. 279-289 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#LeggettM81 2003-11-19 Strong NP-Completeness of a Matrix Similarity Problem. 483-490 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#BrimkovCLR96 http://dx.doi.org/10.1016/0304-3975(96)00103-X 2003-11-19 Multiple-conclusion system as communication calculus. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Fujita00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Analysis of Scheduling Behaviour using Generic Timed Automata. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#GerdsmeierC01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Approximating minimum feedback vertex sets in hypergraphs. 107-116 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Fujito00 http://dx.doi.org/10.1016/S0304-3975(99)00043-2 2003-11-19 Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. 267-298 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#BlotVPS95 http://dx.doi.org/10.1016/0304-3975(95)00242-O 2003-11-19 Attribute Grammars and Recursive Program Schemes II. 235-257 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#CourcelleF82a 2003-11-19 <i>Caenorhabditis Elegans</i>. 157-172 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Bignone99 http://dx.doi.org/10.1016/S0304-3975(98)00155-8 2003-11-19 Faster deterministic sorting through better sampling. 1829-1850 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Sibeyn03 2003-11-19 Logichart - Intelligible Program Diagram for Prolog and its Processing System. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#AdachiTIY99 2003-11-19 Recursive Process Definitions with the State Operator. 285-302 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#BaetenB91 2003-11-19 Process Algebra with Propositional Signals. 381-405 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#BaetenB97 http://dx.doi.org/10.1016/S0304-3975(96)00253-8 2003-11-19 The complexity of path coloring and call scheduling. 33-50 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ErlebachJ01 http://dx.doi.org/10.1016/S0304-3975(99)00152-8 2003-11-19 Load-balanced parallel banded-system solvers. 313-334 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#ChungYW02 2003-11-19 Locating P/poly Optimally in the Extended Low Hierarchy. 263-285 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Kobler94 2003-11-19 On the Structure of Sets in NP and Other Complexity Classes. 181-200 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#LandweberLR81 2005-11-16 Average Case Optimality for Linear Problems. 1-25 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#TraubWW84 2003-11-19 Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases. 125-139 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Helfrich85 2003-11-19 Hard Promise Problems and Nonuniform Complexity. 277-290 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#LongpreS93 2003-11-19 From Static to Dynamic Abstract Data-Types: An Institution Transformation. 109-157 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#Zucca99 http://dx.doi.org/10.1016/S0304-3975(98)00125-X 2003-11-19 Graph Properties for Normal Logic Programs. 277-303 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#CortesiF93 2003-11-19 On the Design of Efficient RSA-based Off-line Electronic Cash Schemes. 173-184 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#VaradharajanNM99 http://dx.doi.org/10.1016/S0304-3975(99)00071-7 2003-11-19 Fixed Points Without Completeness. 273-314 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#MisloveRS95 http://dx.doi.org/10.1016/0304-3975(94)00170-N 2003-11-19 PAC learning of probability distributions over a discrete domain. 37-63 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(01)00265-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#MagnoniMMS03 2003-11-19 A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space. 113-127 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#AlessiB98 http://dx.doi.org/10.1016/S0304-3975(96)00335-0 2003-11-19 Partial order semantics and read arcs. 33-63 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Vogler02a http://dx.doi.org/10.1016/S0304-3975(01)00234-1 2003-11-19 A Typed Calculuc Based on a Fragment of Linear Logic. 333-342 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Solitro89 2003-11-19 On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. 63-76 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#HeimanNW93 2003-11-19 Tiling with bars under tomographic constraints. 1317-1329 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DurrCRR03 2003-11-19 Edge Separators for Graphs of Bounded Genus with Applications. 419-429 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#SykoraV93 2003-11-19 A Quadtree Algorithm for Template Matching on a Pyramid Computer. 387-417 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#SenoussiS94 2003-11-19 On the Computational Efficiency of Symmetric Neural Networks. 337-345 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Wiedermann91 2003-11-19 A Framework for Viewing Atomic Events in Distributed Computations. 45-70 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#Kshemkalyani98 http://dx.doi.org/10.1016/S0304-3975(97)00195-3 2003-11-19 Two short notes on the on-line travelling salesman: handling times and lookahead. 845-852 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Damaschke02a 2003-11-19 Generalized submodular cover problems and applications. 179-200 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Bar-IlanKP01 http://dx.doi.org/10.1016/S0304-3975(99)00130-9 2003-11-19 Effective metric spaces and representations of the reals. 347-372 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Hemmerling02 http://dx.doi.org/10.1016/S0304-3975(01)00093-7 2003-11-19 On Approximate and Algebraic Computability over the Real Numbers. 185-223 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Hemmerling99 http://dx.doi.org/10.1016/S0304-3975(98)00289-8 2003-11-19 The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees. 413-418 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Skurczynski93 2003-11-19 Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees. 231-271 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00318-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Baeza-YatesGM03 2003-11-19 Topics in the theory of DNA computing. 3-38 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#AmosPRS02 2003-11-19 Multilist Layering: Complexity and Applications. 337-350 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#DessmarkLM95 http://dx.doi.org/10.1016/0304-3975(94)00213-3 2003-11-19 Maximum packing for k-connected partial k-trees in polynomial time. 179-191 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#DessmarkLP00 http://dx.doi.org/10.1016/S0304-3975(99)00208-X 2003-11-19 Proof Systems for Structured Specifications with Observability Operators. 393-443 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#HennickerWB97 http://dx.doi.org/10.1016/S0304-3975(96)00162-4 2003-11-19 On a Question of S. Eilenberg. 219 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Reutenauer77 2003-11-19 Sur les Series Associees a Certains Systemes de Lindenmayer. 363-375 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Reutenauer79 2003-11-19 Preface. 1 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#LeonardiM01 http://dx.doi.org/10.1016/S0304-3975(00)00422-9 2003-11-19 Membrane systems with carriers. 779-796 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Martin-VidePR02 http://dx.doi.org/10.1016/S0304-3975(01)00117-7 2003-11-19 A Characterization of Digital Search Trees from the Successful Search Viewpoint. 117-134 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Szpankowski91 2003-11-19 Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars. 195-205 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Martin-VidePS98 http://dx.doi.org/10.1016/S0304-3975(97)00079-0 2003-11-19 Grid structures and undecidable constraint theories. 453-490 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#SeynhaeveTTT01 http://dx.doi.org/10.1016/S0304-3975(00)00032-3 2003-11-19 A Logic for Category Theory. 211-252 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#GilmoreT93 2003-11-19 On the Classifiability of Cellular Automata. 117-129 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#BaldwinS00 http://dx.doi.org/10.1016/S0304-3975(99)00042-0 2003-11-19 Multidimensional Trees. 293-311 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#BaldwinS91 2003-11-19 On learning of functions refutably. 111-143 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00421-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#JainKWZ03 2003-11-19 Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms. 27-39 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00394-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Atserias03 2003-11-19 Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. 311-339 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Koubarakis01 http://dx.doi.org/10.1016/S0304-3975(00)00177-8 2003-11-19 The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. 25-60 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#Koubarakis97 http://dx.doi.org/10.1016/S0304-3975(96)00124-7 2003-11-19 Analysis of an Optimized Search Algorithm for Skip Lists. 199-220 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#KirschenhoferMP95 http://dx.doi.org/10.1016/0304-3975(94)00296-U 2003-11-19 Alternating Simple Multihead Finite Automata. 291-308 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#MatsunoITT85 2003-11-19 A Graph-Based Regularity Test for Deterministic Context-free Languages. 117-125 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#ShankarA91 2003-11-19 Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. 339-340 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#ShankarA92 2003-11-19 On the Balance Property of Patricia Tries: External Path Length Viewpoint. 1-17 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#KirschenhoferPS89 2003-11-19 Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. 395-400 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#KirschenhoferPS92 2003-11-19 Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control. 67-92 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#KumarG95 http://dx.doi.org/10.1016/0304-3975(94)00256-I 2003-11-19 On the number of occurrences of a symbol in words of regular languages. 431-456 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00892-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#BertoniCGL03 2003-11-19 On the unique shortest lattice vector problem. 641-648 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#KumarS01 http://dx.doi.org/10.1016/S0304-3975(00)00387-X 2003-11-19 Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. 247-265 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#GehrkePR99 http://dx.doi.org/10.1016/S0304-3975(98)00243-6 2003-11-19 Additive and multiplicative properties of point sets based on beta-integers. 491-516 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00503-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#FrougnyGK03 2003-11-19 Names of the -calculus agents handled locally. 155-184 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#BodeiDP01 http://dx.doi.org/10.1016/S0304-3975(00)00093-1 2003-11-19 Pruning Terms for Principal Type Assignment. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Takeuti00 http://www.elsevier.nl/locate/entcs/volume31.html 2004-09-28 Domination Games on Infinite Graphs. 337-345 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#DiestelL94 2003-11-19 A Kind of Logical Compilation for Knowledge Bases. 197-218 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#MathieuD94 2003-11-19 A Matrix Extension of Winograd's Inner Product Algorithm. 475-477 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#AndersonM94 2003-11-19 A Representable Approach to Finite Nondeterminism. 3-25 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#AndersonP97 http://dx.doi.org/10.1016/S0304-3975(96)00232-0 2003-11-19 Rank two bipartite bound entangled states do not exist. 589-596 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#HorodeckiSTT03 2003-11-19 Representability of Locally Compact Regular Spaces by Domains and Formal Spaces. 319-331 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#SigstamS97 http://dx.doi.org/10.1016/S0304-3975(96)00152-1 2003-11-19 Algebraic and Operational Semantics of Specifications Allowing Exceptions and Errors. 289-313 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#GogollaDLE84 2003-11-19 Tabular parsing and algebraic transformations. 365-389 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Schneider03 2003-11-19 On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels. 257-274 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#Schneider93 2003-11-19 Coordinating action systems. 91-115 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#HedmanKS00 http://dx.doi.org/10.1016/S0304-3975(99)00228-5 2003-11-19 On congruences of automata defined by directed graphs. 31-43 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00544-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#KelarevS03 2003-11-19 On some generalizations of the Thue-Morse morphism. 283-298 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Seebold03a 2003-11-19 Lyndon factorization of the Prouhet words. 179-197 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00100-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Seebold03b 2004-01-16 Density results on floating-point invertible numbers. 135-141 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#HanrotRTZ03 2003-11-19 How to Decide the Lark. 419-432 1993 110 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#SprengerW93 2003-11-19 Playing by searching: two strategies against a linearly bounded liar. 285-302 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Pedrotti02 http://dx.doi.org/10.1016/S0304-3975(01)00071-8 2003-11-19 The Design Principles of a Weighted Finite-State Transducer Library. 17-32 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#MohriPR00 http://dx.doi.org/10.1016/S0304-3975(99)00014-6 2003-11-19 Infinitary Lambda Calculus. 93-125 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#KennawayKSV97 http://dx.doi.org/10.1016/S0304-3975(96)00171-5 2003-11-19 Computational Foundations of Basic Recursive Function Theory. 89-112 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#ConstableS93 2003-11-19 Transforming Normal Logic Programs to Constraint Logic Programs. 27-56 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#KanchanasutS92 2003-11-19 A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. 143-159 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#HirshfeldJM96 http://dx.doi.org/10.1016/0304-3975(95)00064-X 2003-11-19 Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. 183-222 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#LisitsaS97 http://dx.doi.org/10.1016/S0304-3975(96)00174-0 2003-11-19 Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability. 173-213 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#LisitsaS99 http://dx.doi.org/10.1016/S0304-3975(98)00312-0 2003-11-19 Molecular interaction. 801-827 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#CiobanuR02 2003-11-19 Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines. 217-223 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#KoiranM99 http://dx.doi.org/10.1016/S0304-3975(98)00117-0 2003-11-19 A generalization of Naundorf's fixpoint theorem. 291-296 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#Hesselink00 http://dx.doi.org/10.1016/S0304-3975(00)00202-4 2003-11-19 Interpretations of Recursion under Unbounded Nondeterminacy. 211-234 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Hesselink88 2003-11-19 Processes and Formalism for Unbounded Choice. 105-119 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Hesselink92 2003-11-19 Nondeterminacy and Recursion via Stacks and Games. 273-295 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Hesselink94 2003-11-19 A characterization of partial metrizability: domains are quantifiable. 409-432 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00705-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Schellekens03 2003-11-19 Objects, Interference, and the Yoneda Embedding. 253-282 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#OHearnR99 http://dx.doi.org/10.1016/S0304-3975(98)00360-0 2003-11-19 On BPP versus NPcoNP for ordered read-once branching programs. 127-137 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#AblayevKM01 http://dx.doi.org/10.1016/S0304-3975(00)00216-4 2003-11-19 Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". 391-393 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Andersson92 2003-11-19 On the Connectedness of Pictures in Chain Code Picture Languages. 289-294 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Dassow91 2003-11-19 On the Size of Binary Decision Diagrams Representing Boolean Functions. 45-69 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#BreitbartHR95 http://dx.doi.org/10.1016/0304-3975(94)00181-H 2003-11-19 Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. 225-241 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#AllenderBHH93 2004-02-24 On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. 123-134 1989 68 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#ArvindB89 2003-11-19 On pseudorandomness and resource-bounded measure. 205-221 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ArvindK01 http://dx.doi.org/10.1016/S0304-3975(99)00164-4 2003-11-19 A nonadaptive NC checker for permutation group intersection. 597-611 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#ArvindT01 http://dx.doi.org/10.1016/S0304-3975(00)00159-6 2003-11-19 The Generating Function of the Number of Subpatterns of a D0L Sequence. 57-68 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Johansen79 2003-11-19 On-line String Matching with Feedback. 53-67 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#Johansen95 http://dx.doi.org/10.1016/0304-3975(94)00184-7 2004-02-24 Exact learning via teaching assistants. 51-81 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#ArvindV00 http://dx.doi.org/10.1016/S0304-3975(99)00266-2 2004-02-24 Solvable Black-Box Group Problems are Low for PP. 17-45 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#ArvindV97 http://dx.doi.org/10.1016/S0304-3975(96)00100-4 2003-11-19 A Logical Semantics for Depth-First Prolog with Ground Negation. 105-143 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#Andrews97 http://dx.doi.org/10.1016/S0304-3975(96)00138-7 2003-11-19 Words whose complexity satisfies lim p(n)/n = 1. 31-46 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00091-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Aberkane03 2003-11-19 Separating Classes in the Exponential-Time Hierarchy From Classes in PH. 221-231 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Mocas96 http://dx.doi.org/10.1016/0304-3975(95)00078-X 2003-11-19 Scott Induction and Closure under omega-Sups. 251-263 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#PasztorS86 2003-11-19 PCF Extended with Real Numbers. 79-115 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Escardo96 http://dx.doi.org/10.1016/0304-3975(95)00250-2 2003-11-19 Complexity of Some Problems in Petri Nets. 277-299 1977 4 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#JonesLL77 2003-11-19 Log Space Machines with Multiple Oracle Tapes. 25-39 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Lynch78 2003-11-19 Multilayered Cellular Automata. 99-113 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#BandiniM99 http://dx.doi.org/10.1016/S0304-3975(98)00152-2 2003-11-19 Weighted Systems of Equations. 39-62 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#DevienneLD93 2003-11-19 Binary Search and Recursive Graph Problems. 119-139 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#GasarchG97 http://dx.doi.org/10.1016/S0304-3975(96)00266-6 2003-11-19 Operational Techniques in PVS - A Preliminary Evaluation. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#FordM01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. 309-335 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#KloksKS97 http://dx.doi.org/10.1016/S0304-3975(96)00206-X 2003-11-19 Variétés d'Automates Descendants d'Arbres Infinis. 315-335 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Saoudi86 2003-11-19 Editorial. 237-241 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#NijholtSH03 2003-11-19 Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem. 165-177 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#Saoudi91 2003-11-19 An Easy Priority-Free Proof of a Theorem of Friedberg. 249-251 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Kummer90 2006-03-14 Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#GermanM99 2003-11-19 The self-reduction in lambda calculus. 171-181 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#SongXQ00 http://dx.doi.org/10.1016/S0304-3975(99)00190-5 2003-11-19 Variétés et fonctions rationnelles. 229-240 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#ReutenauerS95 http://dx.doi.org/10.1016/0304-3975(94)00180-Q 2003-11-19 A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties. 73-82 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Escrig84 2003-11-19 Probabilistic Ianov's Schemes. 67-97 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Escrig87 2003-11-19 Asymptotically efficient in-place merging. 159-181 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#GeffertKP00 http://dx.doi.org/10.1016/S0304-3975(98)00162-5 2003-11-19 The Propositional Dynamic Logic of Deterministic, Well-Structured Programs. 127-165 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#HalpernR83 2003-11-19 Converting two-way nondeterministic unary automata into simpler automata. 189-203 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00403-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#GeffertMP03 2003-11-19 Sorting algorithms for broadcast communications: mathematical analysis. 51-67 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#GrabnerP02 2003-11-19 Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata. 263-277 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Zhang92a 2003-11-19 Efficient Simplicity Testing of Automata. 265-278 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Zhang92b 2003-11-19 Data Types with Errors and Exceptions. 275-299 1992 105 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#Zhang92c 2003-11-19 On Maximal Stable Functions. 331-339 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#Zhang95a http://dx.doi.org/10.1016/0304-3975(94)00167-H 2003-11-19 Number of Models and Satisfiability of Sets of Clauses. 277-288 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Zhang96a http://dx.doi.org/10.1016/0304-3975(95)00144-1 2003-11-19 The Largest Cartesian Closed Category of Stable Domains. 203-219 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#Zhang96b http://dx.doi.org/10.1016/0304-3975(95)00191-3 2003-11-19 Sum of Games Born on Days 2 and 3. 119-128 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Moews91 2003-11-19 Coin-Sliding and Go. 253-276 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Moews96 http://dx.doi.org/10.1016/0304-3975(96)00048-5 2003-11-19 The End of Pumping? 275-279 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#ZhangC97 http://dx.doi.org/10.1016/S0304-3975(96)00247-2 2003-11-19 Constraint Nets: A Semantic Model for Hybrid Dynamic Systems. 211-239 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#ZhangM95 http://dx.doi.org/10.1016/0304-3975(94)00149-D 2003-11-19 Decomposition of Recognizable Strong Maximal Codes. 173-183 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#ZhangQ93 2003-11-19 Defaults in Domain Theory. 155-182 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#ZhangR97 http://dx.doi.org/10.1016/S0304-3975(96)00238-1 2003-11-19 Completion of Recognizable Bifix Codes. 345-355 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#ZhangS95 http://dx.doi.org/10.1016/0304-3975(94)00300-8 2003-11-19 Tissue P systems. 295-326 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00659-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Martin-VidePPR03 2003-11-19 An Upper Bound on the Average Number of Iterations of the LLL Algorithm. 95-115 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#DaudeV94 2003-11-19 DAQV: Distributed Array Query and Visualization Framework. 289-317 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#HackstadtM98 http://dx.doi.org/10.1016/S0304-3975(97)00205-3 2003-11-19 A Survey of Strategies in Program Transformation Systems. 2001 57 Electr. Notes Theor. Comput. Sci. http://www.elsevier.nl/locate/entcs/volume57.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs57.html#Visser01 2003-11-19 Avant Propos. 217-218 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#MazoyerPP99 http://dx.doi.org/10.1016/S0304-3975(98)00333-8 2003-11-19 Polymorphic Syntax Definition. 57-86 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Visser98 http://dx.doi.org/10.1016/S0304-3975(97)00268-5 2003-11-19 Tseitin's Formula Revisited. 315-326 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Fouks92 2003-11-19 Towards an Algorithmic Theory of Adaptation. 121-142 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#Fouks99 http://dx.doi.org/10.1016/S0304-3975(97)00211-9 2003-11-19 Applying adversarial planning techniques to Go. 45-82 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#WillmottRBL01 http://dx.doi.org/10.1016/S0304-3975(00)00076-1 2003-11-19 On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages. 109-112 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#HiroseY85 2003-11-19 Reachability Trees for High-level Petri Nets. 261-292 1986 45 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#HuberJJJ86 2003-11-19 Shape preserving top-down tree transducers. 315-339 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00140-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#FulopG03 2003-11-19 Iterated relabeling tree transducers. 221-244 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#FulopT02 http://dx.doi.org/10.1016/S0304-3975(01)00181-5 2003-11-19 Restricted ground tree transducers. 219-233 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#FulopV01 http://dx.doi.org/10.1016/S0304-3975(99)00135-8 2003-11-19 A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. 1-15 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#FulopV91 2003-11-19 Principles of Plasma Pattern and Alternative Structure Compilation. 177-191 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#ArcangeliP90 2003-11-19 A constraint-based region inference algorithm. 299-392 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#BirkedalT01 http://dx.doi.org/10.1016/S0304-3975(00)00025-6 2003-11-19 An Arithmetic Model of Computation Equivalent to Threshold Circuits. 303-319 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#BoyarFS92 2003-11-19 Minimization algorithms for sequential transducers. 177-201 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#Mohri00 http://dx.doi.org/10.1016/S0304-3975(98)00115-7 2003-11-19 Preface. 133-134 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#KornerupBFM03 2003-11-19 Infinite Arrays and Infinite Computations. 195-205 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#SiromoneyDS83 2003-11-19 On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). 43-57 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#BoyarPP00 http://dx.doi.org/10.1016/S0304-3975(99)00182-6 2003-11-19 A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. 179-219 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#Bremond-GregoireL97 http://dx.doi.org/10.1016/S0304-3975(96)00229-0 2003-11-19 Full Abstraction for the Second Order Subset of an Algol-Like Language. 155-212 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Sieber96 http://dx.doi.org/10.1016/S0304-3975(96)00066-7 2003-11-19 Axiomatization of frequent itemsets. 669-693 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CaldersP03 2003-11-19 Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. 47-86 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#AllenderJMV98 http://dx.doi.org/10.1016/S0304-3975(97)00227-2 2003-11-19 Deciding stability and mortality of piecewise affine dynamical systems. 687-696 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#BlondelBKPT01 http://dx.doi.org/10.1016/S0304-3975(00)00399-6 2003-11-19 Guarded fixed point logics and the monadic theory of countable trees. 129-152 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#Gradel02 2003-11-19 Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy. 289-301 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Gradel88 2003-11-19 Capturing Complexity Classes by Fragments of Second-Order Logic. 35-57 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Gradel92 2003-11-19 The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. 165-170 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Zwick95 http://dx.doi.org/10.1016/0304-3975(95)00022-O 2003-11-19 <i>N</i>-Rational Series. 61-80 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Bassino97 http://dx.doi.org/10.1016/S0304-3975(96)00106-5 2003-11-19 <i>L</i>-Forms. 199-225 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#MaurerOS77 2003-11-19 Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. 185-227 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#FachiniN84 2003-11-19 C-Tree Systolic Automata. 155-186 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#FachiniN88 2003-11-19 Synchronized E0L Forms. 135-159 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#MaurerSW80 2003-11-19 L Codes and Number Systems. 331-346 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#MaurerSW83 2003-11-19 Bounded Delay L Codes. 265-279 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#MaurerSW91 2003-11-19 Infinite Arrays and Controlled Deterministic Table 0L Array Systems. 3-11 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#SiromoneySD84 2003-11-19 Nondeterministic Multicounter Machines and Complementation. 111-113 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#PardubskaS89 2003-11-19 Relating defeasible and normal logic programming through transformation properties. 499-529 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ChesnevarDSS03 2003-11-19 Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs. 1-21 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#SrinivasanR91 2003-11-19 <i>x</i>₀<i>u</i>^<i>i</i>₁<i>x</i>₁<i>u</i>^<i>i</i>₂<i>x</i>₂<i>u</i>^<i>i</i>₃<i>x</i>₃<i>y</i>₀<i>v</i>^<i>i</i>₁<i>y</i>₁<i>v</i>^<i>i</i>₂<i>y</i>₂<i>v</i>^<i>i</i>₃<i>y</i>₃<i>i</i>=0, 1, 2, ...) in a Free Monoid. 149-161 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#HakalaK99 http://dx.doi.org/10.1016/S0304-3975(97)00255-7 2003-11-19 Order Dependency in the Relational Model. 149-195 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#GinsburgH83 2003-11-19 Pushdown Acceptor Forms. 307-320 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#GinsburgS77 2003-11-19 On Completing Tables to Satisfy Functional Dependencies. 309-317 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#GinsburgS85 2003-11-19 Projection of Object Histories. 297-328 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#GinsburgT86 2003-11-19 Canonical Forms for Interval Functions. 299-313 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#GinsburgT87 2003-11-19 Cohesion of Object Histories. 63-90 1989 63 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#GinsburgT89 2003-11-19 Interval Queries on Object Histories. 291-316 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#GinsburgT95 http://dx.doi.org/10.1016/0304-3975(94)00133-4 2003-11-19 Graph Grammars with Path-Controlled Embedding. 151-170 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#AizawaN91 2003-11-19 Three-Valued Completion for Abductive Logic Programs. 171-200 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Teusink96 http://dx.doi.org/10.1016/0304-3975(96)00044-8 2003-11-19 Sorting Strings and Constructing Digital Search Trees in Parallel. 225-245 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#JaJaRV96 http://dx.doi.org/10.1016/0304-3975(94)00263-0 2003-11-19 The stack-size of tries: a combinatorial study. 441-461 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Nebel02 http://dx.doi.org/10.1016/S0304-3975(00)00416-3 2003-11-19 Recursively Indefinite Databases. 151-194 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#Meyden93 2003-11-19 Information-Theoretic Characterizations of Recursive Infinite Strings. 45-48 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Chaitin76 2003-11-19 The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. 263-284 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#ShoreS92 2003-11-19 Uniformly hard languages. 303-315 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00810-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#DowneyF03 2003-11-19 Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. 109-131 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#DowneyF95 http://dx.doi.org/10.1016/0304-3975(94)00097-3 2003-11-19 <i>W</i>[2]. 123-140 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#DowneyF98 http://dx.doi.org/10.1016/S0304-3975(97)00101-1 2003-11-19 Presentations of computably enumerable reals. 539-555 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#DowneyL02 http://dx.doi.org/10.1016/S0304-3975(01)00110-4 2003-11-19 Applications of Compactness in the Smyth Powerdomain of Streams. 251-282 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#MeyerV88 2003-11-19 Expressing Program Looping in Regular Dynamic Logic. 301-323 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#MeyerW82 2003-11-19 Higher-order matching for program transformation. 135-162 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#MoorS01 http://dx.doi.org/10.1016/S0304-3975(00)00402-3 2003-11-19 Conditioning a State by a Lukasiewicz Event: A Probabilistic Approach to Ulam Games. 149-166 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Gerla00 http://dx.doi.org/10.1016/S0304-3975(98)00349-1 2003-11-19 Recursion Theory on the Reals and Continuous-Time Computation. 23-44 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Moore96 http://dx.doi.org/10.1016/0304-3975(95)00248-0 2003-11-19 Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. 99-136 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Moore98 http://dx.doi.org/10.1016/S0304-3975(97)00028-5 2003-11-19 Complete Sets of Unifiers and Matchers in Equational Theories. 189-200 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#FagesH86 2003-11-19 On normalizing, non-terminating one-rule string rewriting systems. 489-498 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Geser00 http://dx.doi.org/10.1016/S0304-3975(00)00167-5 2003-11-19 Simplification of boolean verification conditions. 165-185 2000 239 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Gribomont00 http://dx.doi.org/10.1016/S0304-3975(99)00217-0 2003-11-19 On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. 67-108 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#MalgouyresM02 http://dx.doi.org/10.1016/S0304-3975(01)00054-8 2003-11-19 ⁵-equational theory of context unification is undecidable. 463-479 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Vorobyov02 http://dx.doi.org/10.1016/S0304-3975(01)00190-6 2003-11-19 Union of shadows. 493-502 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00233-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#BollobasL03 2003-11-19 Binary (generalized) Post Correspondence Problem. 183-204 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#HalavaHH02 http://dx.doi.org/10.1016/S0304-3975(01)00157-8 2003-11-19 Data structures and algorithms for tilings I. 431-445 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00500-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Friedrichs03 2003-11-19 Marked PCP is decidable. 193-204 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#HalavaHW01 http://dx.doi.org/10.1016/S0304-3975(99)00163-2 2003-11-19 General Approximation Algorithms for some Arithmetical Combinatorial Problems. 289-303 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Moran81 2003-11-19 Learning languages and functions by erasing. 143-189 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#JainKLWZ00 http://dx.doi.org/10.1016/S0304-3975(99)00269-8 2003-11-19 Code Selection by Inversion of Order-Sorted Derivors. 177-211 1990 73 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Giegerich90 2003-11-19 Weakly Expressive Models for Hoare Logic. 409-418 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Hoofman91 2003-11-19 Comparing Models of the Intensional Typed Lambda-Calculus. 83-99 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#Hoofman96 http://dx.doi.org/10.1016/0304-3975(95)00140-9 2003-11-19 On the Inference of Strategies. 5-18 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#SwartR89 2003-11-19 On Updating Suffix Tree Labels. 249-262 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#FerraginaGM98 http://dx.doi.org/10.1016/S0304-3975(97)00243-0 2003-11-19 On the Cost of Uniform and Nonuniform Algorithms. 301-318 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#NovakW99 http://dx.doi.org/10.1016/S0304-3975(98)00293-X 2003-11-19 Counting by quantum eigenvalue estimation. 139-153 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Mosca01 http://dx.doi.org/10.1016/S0304-3975(00)00217-6 2003-11-19 Amortized Efficiency of a Path Retrieval Data Structure. 273-281 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Italiano86 2003-11-19 Foreword. 1 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#Moser02 2003-11-19 Strong normalizability of the non-deterministic catch/throw calculi. 223-245 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#KameyamaS02 http://dx.doi.org/10.1016/S0304-3975(00)00352-2 2003-11-19 The customizable fault/error model for dependable distributed systems. 1223-1251 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#WalterS03 2003-11-19 Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. 245-258 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#VollmerW96 http://dx.doi.org/10.1016/0304-3975(95)00237-5 2003-11-19 Language-theoretic aspects of DNA complematarity. 163-178 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#MihalacheS01 http://dx.doi.org/10.1016/S0304-3975(99)00129-2 2003-11-19 Lower bounds for wide-sense nonblocking Clos network. 323-328 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#TsaiWH01 http://dx.doi.org/10.1016/S0304-3975(00)00147-X 2003-11-19 A formula for incorporating weights into scoring rules. 309-338 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#FaginW00 http://dx.doi.org/10.1016/S0304-3975(99)00224-8 2003-11-19 Modal Logic and Algebraic Specifications. 191-210 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#MossT93 2005-05-25 q-Adic Spectral Analysis of Some Arithmetic Sequences. 249-263 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Mosse89 2005-05-25 Puissances de mots et reconnaissabilité des point fixes d'une substitution. 327-334 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Mosse92 2003-11-19 Sur les Codes ZigZag et Leur Décidabilité. 341-354 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Anselmo90 2003-11-19 The Zig-Zag Power Series: A Two-Way Version of the * Operator. 3-24 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Anselmo91 2003-11-19 The Operation ^ on Formal Series. 39-43 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Anselmo93 2003-11-19 See More Through Lenses Than Bananas. 113-121 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Yarroll96 http://dx.doi.org/10.1016/S0304-3975(96)00116-8 2003-11-19 Games for the mu-Calculus. 99-116 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#NiwinskiW96 http://dx.doi.org/10.1016/0304-3975(95)00136-0 2003-11-19 Using Cost to Control Instrumentation Overhead. 241-258 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#HollingsworthM98 http://dx.doi.org/10.1016/S0304-3975(97)86792-8 2003-11-19 Logical Foundations for Programming Semantics. 253-290 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#GilmoreT93a 2003-11-19 Atomic Semicommutations. 259-272 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#ClerboutG94 2003-11-19 Partial Commutations and Faithful Rational Transductions. 241-254 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#ClerboutL84 2003-11-19 Proof Methods of Declarative Properties of Definite Programs. 99-166 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Deransart93 2003-11-19 Semicommutations and Algebraic Languages. 39-49 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#ClerboutR92 2003-11-19 Inferences for Numerical Dependencies. 271-287 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#GrantM85 2003-11-19 Markov's Constructive Analysis: A Participant's View. 267-285 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Kushner99 http://dx.doi.org/10.1016/S0304-3975(98)00291-6 2003-11-19 Continously Generated Fixed Points. 303-317 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Bracho89 2003-11-19 A Theory of Implementation and Refinement in Timed Petri Nets. 127-161 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#FelderGM98 http://dx.doi.org/10.1016/S0304-3975(97)00078-9 2003-11-19 Rank inequalities and separation algorithms for packing designs and sparse triple systems. 367-384 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00648-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Moura03 2003-11-19 Recursive Construction of Periodic Steady State for Neural Networks. 251-267 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Matamala95 http://dx.doi.org/10.1016/0304-3975(94)00114-X 2003-11-19 Alternation on Cellular Automata. 229-241 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Matamala97 http://dx.doi.org/10.1016/S0304-3975(96)00214-9 2003-11-19 The Ciao Modular, Standalone Compiler and Its Generic Program Processing Library. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#GrasH99a 2003-11-19 Multiplication, Division and Shift Instructions in Parallel Random Access Machines. 1-44 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#TrahanLR92 2003-11-19 A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms. 371-375 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#DavidN97 http://dx.doi.org/10.1016/S0304-3975(97)00004-2 2003-11-19 Predictive learning models for concept drift. 323-349 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#CaseJKSS01 http://dx.doi.org/10.1016/S0304-3975(00)00274-7 2003-11-19 The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions. 269-274 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Turakainen97 http://dx.doi.org/10.1016/S0304-3975(96)00246-0 2003-11-19 Polynomial Time 1-Turing Reductions from #PH to #P. 205-221 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#TodaW92 2003-11-19 System Presentation: An Analyser of Rewriting Systems Complexity. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#Moyen01 2003-11-19 Soundness of data refinement for a higher-order imperative language. 271-301 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Naumann02 http://dx.doi.org/10.1016/S0304-3975(00)00339-X 2003-11-19 Predicate Transformers and Higher-Order Programs. 111-159 1995 150 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs150.html#Naumann95 http://dx.doi.org/10.1016/0304-3975(94)00247-G 2003-11-19 Sur les facteurs des mots automatiques. 67-89 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Fagnot97 http://dx.doi.org/10.1016/S0304-3975(96)00239-3 2003-11-19 Term Graph Rewriting and Garbage Collection Using Ppfibrations. 29-94 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Banach94a 2003-11-19 Analog Computation via Neural Networks. 331-360 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#SiegelmannS94 2003-11-19 On the Expressiveness of Internal Mobility in Name-Passing Calculi. 205-226 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#Boreale98 http://dx.doi.org/10.1016/S0304-3975(97)00220-X 2003-11-19 Computational Depth and Reducibility. 37-70 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#JuedesLL94 2003-11-19 Propositional Dynamic Logic with Local Assignments. 71-87 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#TiomkinM85 2003-11-19 On the Computational Complexity of Prolog Programs. 63-102 1993 119 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Dikovsky93 2003-11-19 On the Many Facets of Lists. 275-305 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#ElgotS77 2003-11-19 A Semantically Meaningful Characterization of Reducible Flowchart Schemes. 325-357 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#ElgotS79 2003-11-19 Timing Conditions for Linearizability in Uniform Counting Networks. 67-91 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#LynchSST99 http://dx.doi.org/10.1016/S0304-3975(98)00237-0 2003-11-19 Heterogeneous Multiprocessor Systems with Breakdowns: Performance and Optimal Repair Strategies. 91-109 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#ChakkaM94 2003-11-19 Some arithmetical restatements of the Four Color Conjecture. 167-183 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Matiyasevich01 http://dx.doi.org/10.1016/S0304-3975(00)00115-8 2003-11-19 Cartesian logic. 3-21 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Freyd02 http://dx.doi.org/10.1016/S0304-3975(00)00328-5 2003-11-19 Structural Polymorphism. 107-129 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Freyd93 2003-11-19 Path Integrals, Bayesian Vision, and Is Gaussian Quadrature Really Good? 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Freyd99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Note on Free Algebras Over Continuous Domains. 421-425 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#Koslowski97 http://dx.doi.org/10.1016/S0304-3975(96)00287-3 2003-11-19 An efficient algorithm to generate binary sequences for cryptographic purposes. 679-688 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Fuster-SabaterG01 http://dx.doi.org/10.1016/S0304-3975(00)00410-2 2003-11-19 Does snooping help? 407-415 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Vyugin02a http://dx.doi.org/10.1016/S0304-3975(01)00122-0 2003-11-19 Non-Stochastic Infinite and Finite Sequences. 363-382 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Vyugin98a http://dx.doi.org/10.1016/S0304-3975(98)00073-5 2003-11-19 On-line stream merging in a general setting. 27-46 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00430-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#ChanLTW03 2003-11-19 Geometric Containment and Vector Dominance. 345-352 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#SantoroSSU87 2003-11-19 On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem. 407-421 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Sarkar00 http://dx.doi.org/10.1016/S0304-3975(00)00020-7 2003-11-19 Stratified Least Fixpoint Logic. 95-120 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Compton94 2003-11-19 Sur la symétrie et l'asymétrie des structures combinatoires. 3-22 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Labelle93 2003-11-19 Hypermap Rewriting: A Combinatorial Approach. 253-281 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Sopena91 2003-11-19 Compiling dyadic first-order specifications into map algebra. 447-475 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#CantoneFOZ03 2003-11-19 A Syntactic Theory of Sequential Control. 205-237 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#FelleisenFKD87 2003-11-19 Learnability of quantified formulas. 485-511 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00342-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#DalmauJ03 2003-11-19 Turning back time in Markovian process algebra. 1947-1986 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Harrison03 2006-05-09 On the Yoneda completion of a quasi-metric space. 159-194 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#KunziS02 http://dx.doi.org/10.1016/S0304-3975(00)00335-2 2003-11-19 Morphic Congruences and D0L Languages. 537-544 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Harrison94 2003-11-19 Dynamical Properties of PWD0L Systems. 269-284 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Harrison95 http://dx.doi.org/10.1016/0304-3975(94)00109-V 2003-11-19 On Almost Cylindrical Languages and the Decidability of the D0L and PWD0L Primitivity Problems. 29-40 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Harrison96 http://dx.doi.org/10.1016/0304-3975(95)00168-9 2003-11-19 Arborescence optimization problems solvable by Edmonds' algorithm. 427-437 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00888-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Georgiadis03 2003-11-19 Stationary Deterministic Flows in Discrete Systems I. 107-127 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Gelenbe83 2003-11-19 Floyds Principle, Correctness Theories and Program Equivalence. 113-149 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#BergstraTT82 2003-11-19 Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. 345-360 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#BafnaKP94 2003-11-19 A System for Automatically Generating Documentation for (C)LP Programs. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Hermenegildo99 2003-11-19 Approximation Algorithms for Multiple Sequence Alignment. 233-244 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#BafnaLP97 http://dx.doi.org/10.1016/S0304-3975(97)00023-6 2003-11-19 Familles de Langages Fermees par Crochet Ouvert. 385-398 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Rodriguez79 2003-11-19 Conjunctive query containment revisited. 211-229 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#ChekuriR00 http://dx.doi.org/10.1016/S0304-3975(99)00220-0 2003-11-19 The Subgraph Isomorphism Problem for Outerplanar Graphs. 91-97 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Syslo82 2003-11-19 Modified binary searching for static tables. 73-88 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#MerliniSV02a http://dx.doi.org/10.1016/S0304-3975(01)00291-2 2003-11-19 A strategy for searching with different access costs. 571-584 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#LaberMP02 2003-11-19 From Local to Global Consistency in Temporal Constraint Networks. 89-112 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#Koubarakis97a http://dx.doi.org/10.1016/S0304-3975(96)00192-2 2003-11-19 On the Complexity of Queries in the Logical Data Model. 33-57 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#KuperV93 2003-11-19 Improved approximate pattern matching on hypertext. 455-463 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Navarro00 http://dx.doi.org/10.1016/S0304-3975(99)00333-3 2003-11-19 A weakly mixing tiling dynamical system with a smooth model. 447-462 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00501-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#FitzkeeHR03 2003-11-19 RULE2001 - Foreword. 2001 59 Electr. Notes Theor. Comput. Sci. 4 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#BrandV01 2003-11-19 There are Infinitely Many Complete Prefix Codes of Constant Length l (l greater than 3). 337-339 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Netto80 2003-11-19 Wide-diameter and minimum length of fan. 257-266 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#KojimaA00 http://dx.doi.org/10.1016/S0304-3975(99)00197-8 2003-11-19 On the Hardness of Allocating Frequences for Hybrid Networks. 347-363 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#MalesinskaP98 http://dx.doi.org/10.1016/S0304-3975(98)00156-X 2003-11-24 Approximation algorithms for NMR spectral peak assignment. 211-229 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00086-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#ChenJLWXXX03 2003-11-19 Orphan gene finding - an exon assembly approach. 1407-1431 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BlayoRS03 2003-11-19 Compact Location Problems. 379-404 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#KrumkeMNRRR97 http://dx.doi.org/10.1016/S0304-3975(96)00304-0 2003-11-19 On Some Subclasses of the Class of Generable Languages. 1-7 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Meznik76 2003-11-19 On a Subclass of Infinite-Regular Languages. 25-32 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Meznik88 2003-11-19 A Lower Bound for Polynomial Multiplication. 319-322 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Kaminski85a 2003-11-19 Finite-Memory Automata. 329-363 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#KaminskiF94 2003-11-19 The Power of the "Always" Operator in First-Order Temporal Logic. 271-281 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#KaminskiW96 http://dx.doi.org/10.1016/0304-3975(95)00108-5 2003-11-19 Preface. 1-2 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#Bouajjani01 http://dx.doi.org/10.1016/S0304-3975(00)00098-0 2003-11-19 Finding the most vital node of a shortest path. 167-177 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00438-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#NardelliPW03 2003-11-19 Systolic Trees and Systolic Language Recognition by Tree Automata. 219-232 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Steinby83 2003-11-19 General Varieties of Tree Languages. 1-43 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Steinby98 http://dx.doi.org/10.1016/S0304-3975(98)00010-3 2005-07-25 On the non-termination of M-based abstract state enumeration. 161-179 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(01)00345-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#MohamedSC03 2003-11-19 The Implementation of the Hammurabi System. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Lesourd99 2003-11-19 On the k-path partition of graphs. 2147-2155 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Steiner03 2003-11-19 Petri Nets, Event Structures and Domains, Part I. 85-108 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#NielsenPW81 2003-11-19 Elementary Transition Systems. 3-33 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#NielsenRT92 2003-11-19 Simple Termination of Rewrite Systems. 127-158 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#MiddeldorpZ97 http://dx.doi.org/10.1016/S0304-3975(96)00172-7 2003-11-19 Termination of Rewriting with Local Strategies. 2001 58 Electr. Notes Theor. Comput. Sci. 2 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#FissoreGK01 2003-11-19 A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. 199-214 1976 1 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#LeeuwenW76 2003-11-19 Thin discrete triangular meshes. 73-105 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#BarnevaBN00 http://dx.doi.org/10.1016/S0304-3975(98)00346-6 2003-11-19 A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. 131-145 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#TarhioU88 2003-11-19 On learning unions of pattern languages and tree patterns in the mistake bound model. 237-254 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#GoldmanK02 2003-11-19 Domain-Independent Formulas and Databases. 281-306 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Topor87 2003-11-19 Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. 363-377 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Bussche01 http://dx.doi.org/10.1016/S0304-3975(99)00301-1 2003-11-19 Formalizing mathematics in higher-order logic: A case study in geometric modelling. 1-57 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#PuitgD00 http://dx.doi.org/10.1016/S0304-3975(98)00228-X 2003-11-19 On the Latest Cersion of DESIR-II. 81-86 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Pflugel97 http://dx.doi.org/10.1016/S0304-3975(97)00057-1 2003-11-19 Admissible Heuristic Search in And/Or Graphs. 207-219 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#BagchiM83 2003-11-19 Multi-cut alpha-beta-pruning in game-tree search. 177-196 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#BjornssonM01 http://dx.doi.org/10.1016/S0304-3975(00)00081-5 2003-11-19 Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. 131-144 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#DrosteJW02a 2003-11-19 Weak-order extensions of an order. 249-268 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00132-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#BertetGM03 2003-11-19 Learning Elementary Formal Systems. 97-113 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#ArikawaSY92 2003-11-19 Proof nets, garbage, and computations. 185-237 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#GuerriniMM01 http://dx.doi.org/10.1016/S0304-3975(00)00094-3 2003-11-19 Coherence for sharing proof-nets. 379-409 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#GuerriniMM03 2005-07-25 A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem. 365-378 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00332-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#Carlucci03 2003-11-19 Bertrand Numeration Systems and Recognizability. 17-43 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#BruyereH97 http://dx.doi.org/10.1016/S0304-3975(96)00260-5 2003-11-19 Maximal Bifix Codes. 107-121 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#BruyereP99 http://dx.doi.org/10.1016/S0304-3975(98)00253-9 2003-11-19 A Proof of Choffrut's Theorem on Subsequential Functions. 329-335 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#BruyereR99 http://dx.doi.org/10.1016/S0304-3975(98)00163-7 2003-11-19 Improving Spanning Trees by Upgrading Nodes. 139-155 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#KrumkeNMRRSW99 http://dx.doi.org/10.1016/S0304-3975(99)00030-4 2003-11-19 Specification of real-time and hybrid systems in rewriting logic. 359-405 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#OlveczkyM02 http://dx.doi.org/10.1016/S0304-3975(01)00363-2 2003-11-19 Construction d'une Famille de Codes Associes a Certains Groupes Finis. 165-179 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Rindone87 2003-11-19 Handsome proof-nets: perfect matchings and cographs. 473-488 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Retore03 2003-11-19 Comparing Hagino's Categorical Programming Language and Typed lambda-Calculi. 145-189 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#DybkjaerM93 2003-11-19 Exhausting strategies, joker games and full completeness for IMLL with Unit. 269-305 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#MurawskiO03 2003-11-19 Exhausting Strategies, Joker Games and IMLL with Units. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#MurawskiO99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Several Results in Program Size Complexity. 291-309 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#KatseffS81 2003-11-19 Polyomino Tilings, Cellular Automata and Codicity. 165-180 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#AigrainB95 http://dx.doi.org/10.1016/0304-3975(94)00201-S 2003-11-19 Worst-Case Analysis of the Set-Union Problem with Extended Backtracking. 57-70 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#GambosiIT89 2003-11-19 Super-Nets and their Hierarchy. 243-272 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#EtzionY83 2003-11-19 On Locally Presented Posets. 251-260 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#GambosiNT90 2003-11-19 A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps. 107-126 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#GambosiNT91 2003-11-19 Competitive analysis of randomized paging algorithms. 203-218 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#AchlioptasCN00 http://dx.doi.org/10.1016/S0304-3975(98)00116-9 2003-11-19 Error-detecting properties of languages. 355-375 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#KonstantinidisO02 http://dx.doi.org/10.1016/S0304-3975(01)00280-8 2003-11-19 Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. 349-357 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#LiptonD76 2003-11-19 Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1. 17-56 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#AverbuchGW88 2003-11-19 Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>. 143-203 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#AverbuchGW91 2003-11-19 Search algorithms in type theory. 55-90 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#CaldwellGU00 http://dx.doi.org/10.1016/S0304-3975(99)00170-X 2003-11-19 On Log-Tape Isomorphisms of Complete Sets. 273-286 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Hartmanis78 2003-11-19 Relations Between Diagonalization, Proof Systems, and Complexity Gaps. 239-253 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Hartmanis79 2003-11-19 A Note on Natural Complete Sets and Gödel Numberings. 75-89 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Hartmanis82 2003-11-19 On Gödel Speed-Up and Succinctness of Language Representations. 335-342 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Hartmanis83 2003-11-19 New Developments in Structural Complexity Theory. 79-93 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Hartmanis90 2003-11-19 Multiplicative Complexity of some Rational Functions. 53-61 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#HartmannS80 2003-11-19 Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs. 199-225 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#HartmannW01 http://dx.doi.org/10.1016/S0304-3975(01)00163-3 2003-11-19 Implications of Forbidden Structures for Extremal Algorithmic Problems. 195-210 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#HuangL85 2003-11-19 Call-by-Name, Call-by-Value and the lambda-Calculus. 125-159 1975 1 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Plotkin75 2003-11-19 LCF Considered as a Programming Language. 225-255 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Plotkin77 2003-11-19 Set-Theoretical and Other Elementary Models of the lambda-Calculus. 351-409 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Plotkin93 2003-11-19 Data Types over Multiple-Values Logics. 161-194 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Pigozzi90 2003-11-19 On Bounded Query Machines. 237-243 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#BalcazarBS85 2003-11-19 Allocation of Arguments and Evidence Theory. 221-246 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#Kohlas97 http://dx.doi.org/10.1016/S0304-3975(96)00130-2 2003-11-19 On Characterizations of the Class PSPACE/POLY. 251-267 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#BalcazarDG87 2003-11-19 An algorithm reconstructing convex lattice sets. 35-57 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00050-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#BrunettiD03 2003-11-19 Foreword: Selected Papers from ICDT 1997. 187 2000 239 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#AfratiK00 http://dx.doi.org/10.1016/S0304-3975(99)00218-2 2003-11-19 A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. 331-345 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#ColbournX98 http://dx.doi.org/10.1016/S0304-3975(97)00124-2 2003-11-19 Hybrid action systems. 937-973 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#RonkkoRS03 2003-11-19 Extended capabilities for visual cryptography. 143-161 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#AtenieseBSS01 http://dx.doi.org/10.1016/S0304-3975(99)00127-9 2003-11-19 Sokoban: improving the search with relevance cuts. 151-175 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#JunghannsS01 http://dx.doi.org/10.1016/S0304-3975(00)00080-3 2003-11-19 Languages of Colonies. 119-130 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#KelemenovaC94 2003-11-19 Representation of a Discretely Controlled Continuous System in Tense Arithmetic. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#MizutaniIS01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Connections among nonlinearity, avalanche and correlation immunity. 697-710 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#ZhengZ03 2006-04-04 Suites équilibrées. 91-108 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Hubert00 http://dx.doi.org/10.1016/S0304-3975(98)00202-3 2003-11-19 Propriétés combinatoires des suites définies par le billard dans les triangles pavants. 165-183 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Hubert96 http://dx.doi.org/10.1016/0304-3975(95)00208-1 2003-11-19 Detecting Degenerate Behaviors in First Order Algebraic Differential Equations. 7-25 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Hubert97 http://dx.doi.org/10.1016/S0304-3975(97)00054-6 2003-11-19 Notes on acyclic orientations and the shelling lemma. 9-16 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#FukudaPS01 http://dx.doi.org/10.1016/S0304-3975(00)00226-7 2003-11-19 Lower Bounds for Sorting of Sums. 137-155 1989 66 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Dietzfelbinger89 2003-11-19 On Logic Programs That Do Not Fail. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#PedreschiR99 2003-11-19 Mixed Computation: Potential Applications and Problems for Study. 41-67 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Ershov82 2003-11-19 The Bounded-Complete Hull of an Alpha-Space. 3-13 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Ershov97 http://dx.doi.org/10.1016/S0304-3975(96)00167-3 2003-11-19 On d-Spaces. 59-72 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Ershov99 http://dx.doi.org/10.1016/S0304-3975(98)00307-7 2003-11-19 The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. 123-143 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#BorgerB80 2003-11-19 Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. 613-622 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Grigoriev01 http://dx.doi.org/10.1016/S0304-3975(00)00157-2 2003-11-19 Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids. 23-33 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Grigoriev94 2003-11-19 NC Solving of a System of Linear Ordinary Differential Equations in Several Unknowns. 79-90 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Grigoriev96 http://dx.doi.org/10.1016/0304-3975(95)00176-X 2003-11-19 Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines. 217-228 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Grigoriev97 http://dx.doi.org/10.1016/S0304-3975(96)00188-0 2003-11-19 A Linear-History Semantics for Languages for Distributed Programming. 25-46 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#FrancezLP84 2003-11-19 On Completeness of Narrowing Strategies. 133-146 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Echahed90 2003-11-19 Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs. 19-36 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#ChangIP89 2003-11-19 Compiling Mercury to the .NET Common Language Runtime. 2001 59 Electr. Notes Theor. Comput. Sci. 1 http://www.elsevier.nl/locate/entcs/volume59.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#DowdHR01 2003-11-19 Can a convex polyhedron have a developable face-cycle? 267-270 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Maehara00 http://dx.doi.org/10.1016/S0304-3975(99)00198-X 2003-11-19 Automatic verification of parameterized networks of processes. 113-144 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#LesensHR01 http://dx.doi.org/10.1016/S0304-3975(00)00104-3 2003-11-19 PAC Learning of Concept Classes Through the Boundaries of Their Items. 91-120 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#ApolloniC97 http://dx.doi.org/10.1016/S0304-3975(95)00240-5 2003-11-19 P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration. 1-37 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#ApolloniG00 http://dx.doi.org/10.1016/S0304-3975(98)00215-1 2003-11-19 Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory. 141-162 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#ApolloniG98 http://dx.doi.org/10.1016/S0304-3975(97)00102-3 2003-11-19 Gaining degrees of freedom in subsymbolic learning. 295-321 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ApolloniM01 http://dx.doi.org/10.1016/S0304-3975(99)00289-3 2003-11-19 Number-conserving cellular automata I: decidability. 523-535 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00534-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#DurandFR03 2003-11-19 Testing Logic Programs for Local Stratification. 205-234 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Palopoli92 2003-11-19 A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem. 75-89 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Revesz92 2003-11-19 A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. 117-149 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#Revesz93 2003-11-19 On the complexity of recognizing the Hilbert basis of a linear diophantine system. 625-642 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#DurandHJ02 http://dx.doi.org/10.1016/S0304-3975(01)00017-2 2003-11-19 Set-sharing is redundant for pair-sharing. 3-46 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#BagnaraHZ02 http://dx.doi.org/10.1016/S0304-3975(00)00312-1 2003-11-19 Computation in Artificially Evolved, Non-Uniform Cellular Automata. 81-98 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#SipperT99 http://dx.doi.org/10.1016/S0304-3975(98)00151-0 2003-11-19 On the Reachability Problem for 5-Dimensional Vector Addition Systems. 135-159 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#HopcroftP79 2003-11-19 Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus. 95-104 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Hayashi85 2003-11-19 Proof by computation in the Coq system. 293-314 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#OostdijkG02 http://dx.doi.org/10.1016/S0304-3975(00)00354-6 2003-11-19 Reductions for non-clausal theorem proving. 81-112 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#AguileraGOV01 http://dx.doi.org/10.1016/S0304-3975(00)00044-X 2003-11-19 Trapping Mutual Exclusion in the Box Calculus. 95-128 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#EsparzaB96 http://dx.doi.org/10.1016/0304-3975(95)00119-0 2003-11-19 Descriptive complexity of computable sequences. 47-58 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#DurandSV02 http://dx.doi.org/10.1016/S0304-3975(01)00030-5 2003-11-19 A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. 185-205 1992 102 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#EsparzaS92 2003-11-19 Towards the Parallel Repetition Conjecture. 277-282 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Verbitsky96 http://dx.doi.org/10.1016/0304-3975(95)00165-4 2003-11-19 On the Bahncard problem. 161-174 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Fleischer01 http://dx.doi.org/10.1016/S0304-3975(00)00266-8 2003-11-19 Commutativity in Free Inverse Monoids. 35-54 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#ChoffrutD98 http://dx.doi.org/10.1016/S0304-3975(98)00030-9 2003-11-19 Distances between languages and reflexivity of relations. 117-138 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#ChoffrutP02 http://dx.doi.org/10.1016/S0304-3975(01)00238-9 2003-11-19 Counting with Rational Functions. 81-101 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#ChoffrutS88 2003-11-19 Communication Complexity of Fault-Tolerant Information Diffusion. 195-211 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#GarganoR98 http://dx.doi.org/10.1016/S0304-3975(97)00109-6 2003-11-19 Space-Filling Curves and Their Use in the Design of Geometric Data Structures. 3-15 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#AsanoRRWW97 http://dx.doi.org/10.1016/S0304-3975(96)00259-9 2003-11-19 Realtime subshifts. 307-325 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#KurkaM00 http://dx.doi.org/10.1016/S0304-3975(98)00192-3 2003-11-19 A cartesian closed category in Martin-Löf's intuitionistic type theory. 189-219 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Valentini03 2003-11-19 Incompleteness of First-Order Temporal Logic with Until. 317-325 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#SzalasH88 2003-11-19 Equational Programming in Lambda-Calculus via SL-Systems. Part 1. 145-184 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#Tronci96 http://dx.doi.org/10.1016/0304-3975(95)00105-0 2003-11-19 Finite Constants: Characterizations of a New Decidable Set of Constants. 303-318 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#SteffenK91 2003-11-19 The permutation-path coloring problem on trees. 119-143 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00635-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#CorteelVGBD03 2003-11-19 Implementing conditional term rewriting by graph rewriting. 311-331 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Ohlebusch01 http://dx.doi.org/10.1016/S0304-3975(00)00209-7 2003-11-19 On the Modularity of Termination of Term Rewriting Systems. 333-360 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Ohlebusch94 2003-11-19 Automatic Generation of Invariants and Intermediate Assertions. 49-87 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#BjornerBM97 http://dx.doi.org/10.1016/S0304-3975(96)00191-0 2003-11-19 A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). 7-18 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#AdlemanDH99 http://dx.doi.org/10.1016/S0304-3975(99)00061-4 2003-11-19 Curry's Type-Rules are Complete with Respect to the F-Semantics too. 127-133 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Hindley83a 2003-11-19 An Abstract Data Type for Real Numbers. 295-326 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#Gianantonio99 http://dx.doi.org/10.1016/S0304-3975(99)00036-5 2003-11-19 The Undecidability of Form Equivalence for Context-Free and E0L Forms. 261-277 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Niemi84 2003-11-19 Intersection Types for Combinatory Logic. 303-324 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Dezani-CiancagliniH92 2003-11-19 A Characterization of F-Complete Type Assignments. 121-157 1986 45 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Dezani-CiancagliniM86 2003-11-19 Finding the Intersection of n Half-Spaces in Time O(n log n). 45-55 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#PreparataM79 2003-11-19 On the closure properties of linear conjunctive languages. 663-685 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00543-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Okhotin03a 2003-11-19 Dynamic Planar Point Location with Optimal Query Time. 95-114 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#PreparataT90 2003-11-19 Parallel Evaluation of Arithmetic Circuits. 133-150 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#RevolR96 http://dx.doi.org/10.1016/0304-3975(95)00252-9 2003-11-19 ⁴-1. 25-36 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00617-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#BerrizbeitiaVA03 2003-11-19 Sequential Compounds of Combinatorial Games. 311-321 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#StromquistU93 2003-11-19 A2CCKS: Atomic Actions for CCS. 203-223 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#GorrieriMM90 2003-11-19 Auto-similarité dans la combinatoire des polynômes orthogonaux. 153-167 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Constantineau93 2003-11-19 A Data Structure for Lattice Representation. 373-392 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#TalamoV97 http://dx.doi.org/10.1016/S0304-3975(96)00209-5 2003-11-19 A Theory of Processes with Durational Actions. 73-94 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#GorrieriRS95 http://dx.doi.org/10.1016/0304-3975(94)00205-W 2003-11-19 Secret-sharing with a class of ternary codes. 285-298 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#DingKL00 http://dx.doi.org/10.1016/S0304-3975(00)00207-3 2003-11-19 Primitives for authentication in process algebras. 271-304 2002 283 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#BodeiDFP02 http://dx.doi.org/10.1016/S0304-3975(01)00136-0 2003-11-19 Ranking and Formal Power Series. 25-35 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#BertoniBG91 2003-11-19 Recursive Query Processing: The Power of Logic. 1-53 1989 69 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#Vieille89 2003-11-19 Fusing Logic and Control with Local Transformations: An Example Optimization. 2001 57 Electr. Notes Theor. Comput. Sci. http://www.elsevier.nl/locate/entcs/volume57.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs57.html#JohannV01 2003-11-19 Splicing on Tree-Like Structures. 227-243 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#SakakibaraF99 http://dx.doi.org/10.1016/S0304-3975(98)00087-5 2003-11-19 The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. 325-342 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#BertoniGS91 2003-11-19 Computing over the Reals with Addition and Order. 35-47 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Koiran94 2003-11-19 A Family of Universal Recurrent Networks. 473-480 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Koiran96 http://dx.doi.org/10.1016/S0304-3975(96)00088-6 2003-11-19 Elimination of Parameters in the Polynomial Hierarchy. 289-304 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Koiran99 http://dx.doi.org/10.1016/S0304-3975(98)00261-8 2003-11-19 Learning in the Presence of Inaccurate Information. 235-261 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#FulkJ96 http://dx.doi.org/10.1016/0304-3975(95)00135-2 2003-11-19 A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. 253-268 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Fulop91 2003-11-19 Undecidable Properties of Deterministic Top-Down Tree Transducers. 311-328 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Fulop94 2003-11-19 Model checking mobile ambients. 277-331 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00832-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#CharatonikDGMT03 2003-11-19 Wait-Free Implementations in Message-Passing Systems. 211-245 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#ChaudhuriHT99 http://dx.doi.org/10.1016/S0304-3975(98)00242-4 2003-11-19 On Second Order Homogeneous Linear Differential Equations with Liouvillian Solutions. 27-48 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Fakler97 http://dx.doi.org/10.1016/S0304-3975(97)00055-8 2003-11-19 On Computational Complexity and Honest Polynomial Degrees. 305-317 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Downey91 2003-11-19 A Closure Property of Regular Languages. 283-287 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Kretschmer88 2003-11-19 On the Power of Recursive Optimizers. 289-310 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Zeugmann88 2003-11-19 Sparse topologies with small spectrum size. 549-565 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00237-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#ElsasserKM03 2003-11-19 On finding common neighborhoods in massive graphs. 707-718 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00569-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#BuchsbaumGW03 2003-11-19 A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring. 27-50 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Bonnier-RignyK94 2003-11-19 Permutation Representation of k-Ary Trees. 83-98 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#RamananL85 2003-11-19 The Bancomat problem: an example of resource allocation in a partitionable asynchronous system. 103-131 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#SussmanM03 2003-11-19 A Probabilistic Distributed Algorithm for Set Intersection and its Analysis. 267-282 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#KurtzM87 2003-11-19 Petri Nets and Large Finite Sets. 173-183 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#McAloon84 2003-11-19 Bottom-up Abstract Interpretation of Logic Programs. 93-125 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#CodishDY94 2003-11-19 Additive Complexity in Directed Computations. 39-67 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Grigoryev82 2003-11-19 A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus. 227-245 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#HennessyA80 2003-11-19 Symbolic Bisimulations. 353-389 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#HennessyL95 http://dx.doi.org/10.1016/0304-3975(94)00172-F 2003-11-19 Synchronization Trees. 33-82 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#Winskel84 2003-11-19 On Powerdomains and Modality. 127-137 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Winskel85 2003-11-19 A Note on Model Checking the Modal nu-Calculus. 157-167 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Winskel91 2003-11-19 Bisimulations for a Calculus of Broadcasting Systems. 225-260 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#HennessyR98 http://dx.doi.org/10.1016/S0304-3975(97)00261-2 2003-11-19 The Parameterized Complexity of Sequence Alignment and Consensus. 31-54 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#BodlaenderDFW95 http://dx.doi.org/10.1016/0304-3975(94)00251-D 2003-11-19 On Competitive On-Line Paging with Lookahead. 365-375 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Breslauer98a http://dx.doi.org/10.1016/S0304-3975(98)00118-2 2003-11-19 Minimizing subsequential transducers: a survey. 131-143 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Choffrut03 2003-11-19 Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. 325-337 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Choffrut77 2003-11-19 Rational Relations and Ratonal Series. 5-13 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Choffrut92 2003-11-19 Approximate periods of strings. 557-568 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#SimIPS01 http://dx.doi.org/10.1016/S0304-3975(00)00365-0 2003-11-19 Foreword: Theoretical Aspects of Coordination Languages. 163-165 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#GorrieriH98 http://dx.doi.org/10.1016/S0304-3975(97)00148-5 2003-11-19 On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies. 195-252 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#GorrieriM95 http://dx.doi.org/10.1016/0304-3975(94)00073-R 2003-11-19 The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. 105-111 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Furer82 2003-11-19 Many-to-Many Routings on Trees via Matchings. 347-377 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#PantziouRS97 http://dx.doi.org/10.1016/S0304-3975(97)00049-2 2003-11-19 A Counterexample to Shyamasundar's Characterization of Pushdown Permuters. 103-105 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Ramanan83 2003-11-19 Testing the Optimality of Alphabetic Trees. 279-301 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Ramanan92 2003-11-19 Specifying Byrd's Box Model with a Continuation Semantics. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#JahierDR99 2003-11-19 The Power of Temporal Proofs. 35-83 1989 65 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Abadi89 2003-11-19 Corrigendum: The Power of Temporal Proofs. 275 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Abadi90 2003-11-19 Balances for fixed points of primitive substitutions. 47-75 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00092-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Adamczewski03 2003-11-19 Shuffle factorization is unique. 47-67 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#BerstelB02 http://dx.doi.org/10.1016/S0304-3975(00)00433-3 2003-11-19 Partial Words and a Theorem of Fine and Wilf. 135-141 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#BerstelB99 http://dx.doi.org/10.1016/S0304-3975(98)00255-2 2003-11-19 Sturmian Words, Lyndon Words and Trees. 171-203 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#BerstelL97 http://dx.doi.org/10.1016/S0304-3975(96)00101-6 2003-11-19 Average Cost of Duval's Algorithm for Generating Lyndon Words. 415-425 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#BerstelP94 2003-11-19 Local Languages and the Berry-Sethi Algorithm. 439-446 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#BerstelP96 http://dx.doi.org/10.1016/0304-3975(95)00104-2 2003-11-19 Recognizable Formal Power Series on Trees. 115-148 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#BerstelR82 2003-11-19 Coding rotations on intervals. 99-107 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#BerstelV02 http://dx.doi.org/10.1016/S0304-3975(02)00009-9 2003-11-19 A fast algorithm to generate necklaces with fixed content. 477-489 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(03)00049-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Sawada03 2003-11-19 Periodicities on Trees. 145-181 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#GiammarresiMMR98 http://dx.doi.org/10.1016/S0304-3975(97)00072-8 2003-11-19 Learning Unions of Tree Patterns Using Queries. 47-62 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#ArimuraIS97 http://dx.doi.org/10.1016/S0304-3975(97)00015-7 2003-11-19 On Read-Once vs. Multiple Access to Randomness in Logspace. 135-144 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#Nisan93 2003-11-19 Rudimentary Relations and Primitive Recursion: A Toolbox. 129-148 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#EsbelinM98 http://dx.doi.org/10.1016/S0304-3975(97)00002-9 2003-11-19 Erratum to "P-complete Problems in Data Compression". 325-326 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#Agostino00 http://dx.doi.org/10.1016/S0304-3975(99)00314-X 2003-11-19 P-complete Problems in Data Compression. 181-186 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Agostino94 2003-11-19 Une Extension du Theoreme de Winograd. 255-259 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Morgenstern79 2003-11-19 Linear Time and Branching Time Semantics for Recursion with Merge. 135-156 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#BakkerBKM84 2003-11-19 An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. 109-114 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#KapurKMN85 2003-11-19 Using PVS to validate the algorithms of an exact arithmetic. 203-218 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#LesterG03 2003-11-19 Continuation Semantics for Flowgraph Equations. 307-331 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#DowlingG86 2003-11-19 Inferring a Tree from Walks. 289-300 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#MaruyamaM96 http://dx.doi.org/10.1016/0304-3975(95)00156-5 2003-11-19 The Fixed Points of Logic Programs with Herbrand Base N. 309-319 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#DowlingK90 2003-11-19 25 Years. 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Nivat01 2003-11-19 On the Orbits of the Product of two Permutations. 449-461 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#BergeyC94 2003-11-19 Semi-Unification. 169-187 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#KapurMNS91 2003-11-19 P-Optimal Heuristics. 123-131 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Lieberherr80 2003-11-19 Uniform Complexity and Digital Signatures. 99-110 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Lieberherr81 2003-11-19 The Church-Rosser Property and Special Thue Systems. 123-133 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#KapurNKM85 2003-11-19 Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. 351-357 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#SrikantSSR93 2003-11-19 Generating Ordered Trees. 153-159 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Skarbek88 2003-11-19 The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. 167-188 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#BodlaenderFHWW00 http://dx.doi.org/10.1016/S0304-3975(98)00342-9 2003-11-19 How to analyse evolutionary algorithms. 101-130 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#BeyerSW02 2003-11-19 On the Hurwitz Product of Formal Power Series and Automata. 261-273 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Kuster91 2003-11-19 On weak and weighted computations over the real closure of Q. 593-600 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Cucker01 http://dx.doi.org/10.1016/S0304-3975(00)00007-4 2003-11-19 Analysis of a Simple Factorization Algorithm. 321-348 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#KnuthP76 2003-11-19 The Expected Linearity of a Simple Equivalence Algorithm. 281-315 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#KnuthS78 2003-11-19 Lifting results for categories of algebras. 257-269 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Mulry02 http://dx.doi.org/10.1016/S0304-3975(00)00338-8 2003-11-19 Categorical Fixed Point Semantics. 85-97 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Mulry90 2003-11-19 Monads and Algebras in the Semantics or Partial Data Types. 141-155 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Mulry92 2003-11-19 Partial Map Classifiers and Partial Cartesian Closed Categories. 109-123 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Mulry94 2003-11-19 Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes. 305-331 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Kamper91 2003-11-19 Extended thermography for multiple kos in Go. 23-43 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#Spight01 http://dx.doi.org/10.1016/S0304-3975(00)00075-X 2003-11-19 Coloured Petri Nets and the Invariant-Method. 317-336 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Jensen81 2003-11-19 Secrecy types for asymmetric communication. 387-415 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00863-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#AbadiB03 2003-11-19 The Existence of Refinement Mappings. 253-284 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#AbadiL91 2003-11-19 A Logical View of Composition. 3-30 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#AbadiP93 2003-11-19 Proof-term synthesis on dependent-type systems via explicit substitutions. 407-440 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Munoz01 http://dx.doi.org/10.1016/S0304-3975(00)00196-1 2003-11-19 A Comparison of Two Lower-Bound Methods for Communication Complexity. 39-51 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#DietzfelbingerHS96 http://dx.doi.org/10.1016/S0304-3975(96)00062-X 2003-11-19 A defect theorem for bi-infinite words. 237-243 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#KarhumakiMP03 2003-11-19 Generalized Factorizations of Words and Their Algorithmic Properties. 123-133 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#KarhumakiPR99 http://dx.doi.org/10.1016/S0304-3975(98)00254-0 2003-11-19 The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. 113-129 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#DietzfelbingerMS91 2003-11-19 Proof assistance for real-time systems using an interactive theorem prover. 53-99 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Kolano02 http://dx.doi.org/10.1016/S0304-3975(01)00045-7 2003-11-19 Word Operation Definable in the Typed lambda-Calculus. 1-14 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Zaionc87 2003-11-19 Term-Rewriting Systems with Rule Priorities. 283-301 1989 67 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#BaetenBKW89 2003-11-19 Arithmetical Hierarchy and Complexity of Computation. 227-237 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Hajek79 2003-11-19 Some Complexity Results on Transition Systems and Elementary Net Systems. 361-376 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#Hiraishi94 2003-11-19 Parallel On-Line Parsing in Constant Time per Word. 303-310 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Sikkel93 2003-11-19 Parsing Schemata and Correctness of Parsing Algorithms. 87-103 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Sikkel98 http://dx.doi.org/10.1016/S0304-3975(97)00269-7 2003-11-19 The minimum broadcast range assignment problem on linear multi-hop wireless networks. 751-761 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00538-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#ClementiIS03 2003-11-19 Independent Parallelism in Finite Copying Parallel Rewriting Systems. 87-120 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#RambowS99 http://dx.doi.org/10.1016/S0304-3975(97)00190-4 2003-11-19 New Plethysm Operation, Chern Characters of Exterior and Symmetric Powers with Applications to Stiefel-Whitney Classes of Grassmannians. 289-301 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Svrtan93 2003-11-19 The Intractability of Resolution. 297-308 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Haken85 2003-11-19 Distributed broadcast in radio networks of unknown topology. 337-364 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00851-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#ClementiMS03 2003-11-19 The Complexity Properties of Probabilistic Automata with Isolated Cut Point. 87-95 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Ablyv88 2003-11-19 Structure theory of multi-level deterministically synchronized sequential processes. 1-33 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#RecaldeTS01 http://dx.doi.org/10.1016/S0304-3975(99)00112-7 2003-11-19 Towards optimal lower bounds for clique and chromatic number. 537-584 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00535-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#EngebretsenH03 2003-11-19 Global and Local Views of State Fairness. 77-104 1991 80 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#HowellRY91 2003-11-19 Frameproof codes against limited coalitions of pirates. 295-304 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#EnchevaC02 http://dx.doi.org/10.1016/S0304-3975(00)00447-3 2003-11-19 A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. 157-172 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Vishkin84 2003-11-19 Pushdown Cellular Automata. 239-261 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Kutrib99 http://dx.doi.org/10.1016/S0304-3975(97)00187-4 2003-11-19 A Note on Some Languages in Uniform ACC0. 357-362 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#BarringtonC91 2003-11-19 Pattern Systems. 183-201 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#MitranaPRS96 http://dx.doi.org/10.1016/0304-3975(94)00258-4 2003-11-19 Observational proofs by rewriting. 675-698 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#BouhoulaR02 http://dx.doi.org/10.1016/S0304-3975(01)00333-4 2003-11-19 Optimal Parallel Algorithms for Path Problems on Planar Graphs. 27-43 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#SrikrishnaR95 http://dx.doi.org/10.1016/0304-3975(94)00189-P 2003-11-19 Actor theories in rewriting logic. 441-485 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Talcott02 http://dx.doi.org/10.1016/S0304-3975(01)00365-6 2003-11-19 A Theory for Program and Data Type Specification. 129-159 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Talcott92 2003-11-19 A Theory of Binding Structures and Applications to Rewriting. 99-143 1993 112 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Talcott93 2003-11-19 Solving Systems of Linear Equations over Polynomials. 69-88 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Kannan85 2003-11-19 A Sequential Reduction Strategy. 75-95 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#AntoyM96 http://dx.doi.org/10.1016/0304-3975(96)00041-2 2003-11-19 GSOS and Finite Labelled Transition Systems. 181-195 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Aceto94 2003-11-19 Regular closed sets of permutations. 85-100 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00212-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#AlbertAR03 2003-11-19 Average-Case Analysis of Unification Algorithms. 3-34 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#AlbertCF93 2003-11-19 Normal form algorithms for extended context-free grammars. 35-47 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#AlbertGW01 http://dx.doi.org/10.1016/S0304-3975(00)00294-2 2003-11-19 Reduction Strategies for Declarative Programming. 2001 57 Electr. Notes Theor. Comput. Sci. http://www.elsevier.nl/locate/entcs/volume57.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs57.html#Hanus01 2003-11-19 Horn Clause Programs with Polymorphic Types: Semantics and Resolution. 63-106 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#Hanus91 2003-11-19 Program Transformations and Algebraic Semantics. 39-65 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Guessarian79 2003-11-19 New results on edge-bandwidth. 503-513 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00234-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#CalamoneriMV03 2003-11-19 A Metric for Positional Games. 207-219 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Ettinger00 http://dx.doi.org/10.1016/S0304-3975(99)00107-3 2003-11-19 Graceful planes and lines. 151-170 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#BrimkovB02 http://dx.doi.org/10.1016/S0304-3975(01)00061-5 2003-11-19 Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables. 271-282 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#BigotteJOP02 http://dx.doi.org/10.1016/S0304-3975(00)00445-X 2003-11-19 String Matching with Weighted Errors. 319-328 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#BertossiLLP90 2003-11-19 Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. 61-81 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Harel80 2003-11-19 On the Total Correctness of Nondeterministic Programs. 175-192 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Harel81 2003-11-19 Separation of Complexity Classes in Koiran's Weak Model. 3-14 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#CuckerSS94 2003-11-19 Quantitative program logic and expected time bounds in probabilistic distributed algorithms. 191-219 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#McIver02 http://dx.doi.org/10.1016/S0304-3975(01)00049-4 2003-11-19 Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. 405-426 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#FernauHF01 http://dx.doi.org/10.1016/S0304-3975(00)00022-0 2003-11-19 Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. 633-662 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00541-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#FernauHF03 2003-11-19 Specification Styles in Distributed Systems Design and Verification. 179-206 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#VissersSSB91 2003-11-19 Flexible Queries in Relational Databases - The Example of the Division Operator. 281-302 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#BoscDPP97 http://dx.doi.org/10.1016/S0304-3975(96)00132-6 2003-11-19 Order-Sorted Completion: The Many-Sorted Way. 3-32 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#Ganzinger91 2003-11-19 A Notation for Lambda Terms: A Generalization of Environments. 49-98 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#NadathurW98 http://dx.doi.org/10.1016/S0304-3975(97)00184-9 2003-11-19 Penelope's Graph: A Hard Minimum Cost Tension Instance. 207-218 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#Hadjiat98 http://dx.doi.org/10.1016/S0304-3975(97)00186-2 2003-11-19 An Efficient Strategy for Non-Horn Deductive Databases. 245-259 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Demolombe91 2003-11-19 Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. 113-120 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Bunder85a 2003-11-19 On Branching and Looping, Part I. 187-220 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Havel80 2003-11-19 Two beta-Equal lambda-I-Terms with no Types in Common. 265-266 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#BunderH96 http://dx.doi.org/10.1016/0304-3975(95)00147-6