2003-11-19 The full Steiner tree problem. 55-67 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00209-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#LuTL03 2003-11-19 Deterministic Analysis of Queueing Systems with Heterogeneous Servers. 243-264 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#El-TahaS92 2003-11-19 About Primitive Recursive Algorithms. 57-69 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Colson91 2003-11-19 On Diagonal Fixed Points of Increasing Functions. 181-186 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#Colson99 http://dx.doi.org/10.1016/S0304-3975(98)00331-4 2003-11-19 A Generalization of the Concept of Sketch. 159-178 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Wells90 2003-11-19 Uniform Data Encodings. 145-165 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#RosenbergSS80 2003-11-19 Information Storage and Retrieval Systems: Mathematical Foundations. 331-354 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#MarekP76 2003-11-19 Approximating Sets with Equivalence Relations. 145-152 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#MarekR86 2003-11-19 The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs. 365-386 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#MarekS92 2003-11-19 Revision Programming. 241-277 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#MarekT98 http://dx.doi.org/10.1016/S0304-3975(97)00092-3 2003-11-19 The Computational Efficacy of Finite-Field Arithmetic. 291-309 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#SturtivantF93 2003-11-19 <i>P</i>-Positions as Moves. 283-296 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#FraenkelO98 http://dx.doi.org/10.1016/S0304-3975(98)00044-9 2003-11-19 Infinite cyclic impartial games. 13-22 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#FraenkelR01 http://dx.doi.org/10.1016/S0304-3975(00)00074-8 2003-11-19 Geography. 197-214 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#FraenkelS93 2003-11-19 The Exact Number of Squares in Fibonacci Words. 95-106 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#FraenkelS99 http://dx.doi.org/10.1016/S0304-3975(98)00252-7 2003-11-19 On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality. 225-262 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#DeneckerS94 2003-11-19 Observational Structures and Their Logics. 249-283 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#AstesianoGR92 2003-11-19 A new heap game. 5-12 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#FraenkelZ01 http://dx.doi.org/10.1016/S0304-3975(00)00073-6 2003-11-19 Logic Program Synthesis from First-Order Logic Specifications. 69-96 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#Kawamura94 2003-11-19 Long words: the theory of concatenation and omega-power. 533-548 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#BloomC01 http://dx.doi.org/10.1016/S0304-3975(00)00040-2 2003-11-19 Equational Logic of Circular Data Type Specification. 303-331 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#BloomE89 2003-11-19 Fixed-Point Operations on ccc's. Part I. 1-38 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#BloomE96 http://dx.doi.org/10.1016/0304-3975(95)00010-0 2003-11-19 The Equational Logic of Fixed Points (Tutorial). 1-60 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#BloomE97 http://dx.doi.org/10.1016/S0304-3975(96)00248-4 2003-11-19 Some combinatorial results on Bernoulli sets and codes. 143-165 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Luca02 http://dx.doi.org/10.1016/S0304-3975(00)00438-2 2003-11-19 Evaluation Transform. 163-177 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Minh91 2003-11-19 Standard Sturmian Morphisms. 205-224 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#Luca97 http://dx.doi.org/10.1016/S0304-3975(96)00054-0 2003-11-19 A Conjecture on Continued Fractions. 75-86 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Luca98 http://dx.doi.org/10.1016/S0304-3975(98)00032-2 2003-11-19 On the Combinatorics of Finite Words. 13-39 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Luca99 http://dx.doi.org/10.1016/S0304-3975(98)00248-5 2003-11-19 Experimenting with Process Equivalence. 223-237 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#BloomM92 2003-11-19 Learnability with Respect to Fixed Distributions. 377-390 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#BenedekI91 2003-11-19 Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. 265-286 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#BloomT79 2003-11-19 A Logical Characterization of Observation Equivalence. 43-53 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#BloomT85 2003-11-19 Color-Families are Dense. 29-41 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Welzl82 2003-11-19 On a Rational Approximation Problem in the Real Hardy Space H2. 175-197 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#BaratchartOW92 2003-11-19 Studying Equivalences of Transition Systems with Algebraic Tools. 187-205 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Malacaria95 http://dx.doi.org/10.1016/0304-3975(94)00047-M 2003-11-19 Scheduling in Synchronous Networks and the Greedy Algorithm. 157-183 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#LuiZ99 http://dx.doi.org/10.1016/S0304-3975(98)00240-0 2003-11-19 On the Hardness of Approximating Shortest Integer Relations among Rational Numbers. 287-297 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#RossnerS98 http://dx.doi.org/10.1016/S0304-3975(97)00118-7 2003-11-19 Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#Schachte01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Precise goal-independent abstract interpretation of constraint logic programs. 557-577 2003 293 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Schachte03 2003-11-19 Dependent Coercions. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#LuoS99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Eventually-Serializable Data Services. 113-156 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#FeketeGLLS99 http://dx.doi.org/10.1016/S0304-3975(98)00239-4 2006-06-28 A complementary survey on double-loop networks. 211-229 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Hwang01a http://dx.doi.org/10.1016/S0304-3975(00)00243-7 2003-11-19 An Upward Measure Separation Theorem. 127-135 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Lutz91 2003-11-19 On Independent Random Oracles. 301-307 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Lutz92 2003-11-19 An asymptotic theory for recurrence relations based on minimization and maximization. 1475-1501 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#HwangT03 2003-11-19 Bounds on the max and min bisection of random cubic and random 4-regular graphs. 531-547 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00236-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#DiazDSW03 2003-11-19 Some Decision Problems about Controlled Rewriting Systems. 281-346 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Senizergues90a 2003-11-19 On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. 1-38 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#AbrahamM94 2003-11-19 Connection methods in linear logic and proof nets construction. 231-272 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#Galmiche00 http://dx.doi.org/10.1016/S0304-3975(99)00176-0 2003-11-19 Constructive System for Automatic Program Synthesis. 227-239 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Galmiche90 2003-11-19 Program Development in Constructive Type Theory. 237-259 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Galmiche92 2003-11-19 Perfect Hashing. 1-143 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#CzechHM97 http://dx.doi.org/10.1016/S0304-3975(96)00146-6 2003-11-19 Formal Validation of Data-Parallel Programs: A Two-Component Assertional Proof System for a Simple Language. 71-107 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#BougeCGUV97 http://dx.doi.org/10.1016/S0304-3975(97)00041-8 2003-11-19 On Priority in Cosy. 199-216 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Okulicka90 2003-11-19 Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model. 99-112 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#CasasDM93 2003-11-19 Additive symmetries: the non-negative case. 143-157 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#DaumasL03 2003-11-19 The convergence of stochastic algorithms solving flow shop scheduling. 101-117 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#SteinhofelAW02 http://dx.doi.org/10.1016/S0304-3975(01)00293-6 2003-11-19 From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. 157-172 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Marion99 http://dx.doi.org/10.1016/S0304-3975(98)00311-9 2003-11-19 Computational Complexity of Loss Networks. 45-59 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#LouthMK94 2003-11-19 Proving Nonreachability by Modulo-Invariants. 49-64 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#DeselNR96 http://dx.doi.org/10.1016/0304-3975(95)00117-4 2003-11-19 Semantics and Reasoning with Free Procedures. 67-81 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#German92 2003-11-19 Design Factors for Parallel Processing Benchmarks. 175-189 1989 64 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Lyon89 2003-11-19 Quantum automata and quantum grammars. 275-306 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#MooreC00 http://dx.doi.org/10.1016/S0304-3975(98)00191-1 2003-11-19 The First-Order Theory of Lexicographic Path Orderings is Undecidable. 67-87 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#ComonT97 http://dx.doi.org/10.1016/S0304-3975(96)00049-7 2003-11-19 Picture Words with Invisible Lines. 357-363 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Slowinski93 2003-11-19 An Operator Embedding Theorem for Complexity Classes of Recursive Functions. 193-198 1976 1 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Moll76 2003-11-19 An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. 293-307 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#JaJaR94 2003-11-19 Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. 23-49 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#KrithivasanM95 http://dx.doi.org/10.1016/0304-3975(95)80023-3 2003-11-19 An Introduction to Commutative and Noncommutative Gröbner Bases. 131-173 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Mora94 2003-11-19 Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs. 221-272 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#More94 2003-11-19 On the computability of Walsh functions. 419-436 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Mori02 http://dx.doi.org/10.1016/S0304-3975(01)00099-8 2003-11-19 On the Fredholm Determinant of a Piecewise Linear Transformation. 243-248 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Mori89 2003-11-19 The Laws of Occam Programming. 177-229 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#RoscoeH88 2003-11-19 Decidability Problems in Grammar Systems. 169-189 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Mihalache99 http://dx.doi.org/10.1016/S0304-3975(97)00165-5 2003-11-19 Parametric corecursion. 139-163 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Moss01 http://dx.doi.org/10.1016/S0304-3975(00)00126-2 2003-11-19 Recursion and corecursion have the same equational logic. 233-267 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Moss03 2003-11-19 On the Nature of Events: Another Perspective in Concurrency. 425-454 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#PinnaP95 http://dx.doi.org/10.1016/0304-3975(94)00174-H 2003-11-19 Literal Shuffle. 281-299 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Berard87 2003-11-19 Global Serializability of Concurrent Programs. 41-70 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Berard94 2003-11-19 The Weighted List Update Problem and the Lazy Adversary. 371-384 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#dAmoreMN93 2003-11-19 The Simple Dynamics of Super Turing Theories. 461-472 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Siegelmann96 http://dx.doi.org/10.1016/S0304-3975(96)00087-4 2003-11-19 Weak Completeness in E and E_2. 149-158 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#JuedesL95 http://dx.doi.org/10.1016/0304-3975(95)80030-D 2004-02-03 Information distance and conditional complexities. 145-150 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Vyugin02 http://dx.doi.org/10.1016/S0304-3975(01)00037-8 2003-11-19 Ergodic Theorems for Individual Random Sequences. 343-361 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Vyugin98 http://dx.doi.org/10.1016/S0304-3975(98)00072-3 2003-11-19 Self-Reproduction in a Reversible Cellular Space. 337-366 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#MoritaI96 http://dx.doi.org/10.1016/S0304-3975(96)00083-7 2003-11-19 Two-dimensional cellular automata and deterministic on-line tessalation automata. 167-186 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00575-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Terrier03a 2003-11-19 More on Advice on Structuring Compilers and Proving them Correct. 223-249 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#ThatcherWW81 2003-11-19 Fairness, Distances and Degrees. 131-142 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#DarondeauNPY92 2003-11-19 The Processor Minimization Problem with Independent Waiting-Time Constraints. 3-16 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#CoffmanFPW94 2003-11-19 The multiplicative fragment of the Yanov equational theory. 417-425 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00887-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Dolinka03 2003-11-19 Graph Theoretic Models. 117-121 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Harary80 2003-11-19 Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives. 35-65 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#AsarinMP95 http://dx.doi.org/10.1016/0304-3975(94)00228-B 2003-11-19 Maximal Superpositions of Horizontally Convex Polyominoes. 273-283 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#dAndreaF99 http://dx.doi.org/10.1016/S0304-3975(98)00326-0 2003-11-19 The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. 213-216 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#DuttonB82 2003-11-19 Answering Queries from Context-Sensitive Probabilistic Knowledge Bases. 147-177 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#NgoH97 http://dx.doi.org/10.1016/S0304-3975(96)00128-4 2003-11-19 An algebraic characterization of deterministic regular languages over infinite alphabets. 155-175 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00246-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#FrancezK03 2003-11-19 Efficient High-Level Parallel Programming. 71-107 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#BotorogK98 http://dx.doi.org/10.1016/S0304-3975(97)00196-5 2003-11-19 <i>lambda-beta-mu</i>-Calculus. 323-337 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Dezani-Ciancaglini76 2003-11-19 Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL. 291-342 1989 65 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Hardin89 2003-11-19 Generalized filter models. 363-387 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#MargariaZ00 http://dx.doi.org/10.1016/S0304-3975(99)00083-3 2003-11-19 A short solution for the HDT0L sequence equivalence problem. 267-270 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Honkala00a http://dx.doi.org/10.1016/S0304-3975(00)00158-4 2003-11-19 Decidability results for Watson-Crick D0L systems with nonregular triggers. 481-488 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(03)00087-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Honkala03a 2003-11-19 Probabilistic Recurrence Relations Revisited. 45-56 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#ChaudhuriD97 http://dx.doi.org/10.1016/S0304-3975(96)00261-7 2003-11-19 On Lindenmayerian Algebraic Power Series. 113-142 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#HonkalaK97 http://dx.doi.org/10.1016/S0304-3975(96)00313-1 2003-11-19 Watson-Crick D0L systems with regular triggers. 689-698 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#HonkalaS01 http://dx.doi.org/10.1016/S0304-3975(01)00010-X 2003-11-19 Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. 205-223 1998 203 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#ChaudhuriZ98 http://dx.doi.org/10.1016/S0304-3975(98)00021-8 2003-11-19 A causal semantics for time Petri nets. 409-447 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#AuraL00 http://dx.doi.org/10.1016/S0304-3975(99)00114-0 2003-11-19 Process Logic with Regular Formulas. 307-322 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#HarelP85 2003-11-19 Essential Transitions to Bisimulation Equivalences. 397-419 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#ElorantaTV97 http://dx.doi.org/10.1016/S0304-3975(96)00281-2 2003-11-19 On Optimal Parallelization of Sorting Networks. 331-341 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#GannettKY90 2003-11-19 A Natural Semantics of First-Order Type Dependency. 31-53 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Bertrand94a 2003-11-19 Discrete Geometry for Computer Imagery - Preface. 1 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#BertrandM02 http://dx.doi.org/10.1016/S0304-3975(01)00048-2 2003-11-19 On the rate of convergence of error estimates for the partitioning classification rule. 181-196 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Pinter02 http://dx.doi.org/10.1016/S0304-3975(01)00087-1 2003-11-19 Factoring Multivariate Integral Polynomials. 207-213 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#Lenstra84 2003-11-19 Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. 113-128 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#ClementiT99 http://dx.doi.org/10.1016/S0304-3975(97)00226-0 2003-11-19 Accepting Conditions for Automata on omega-Languages. 137-147 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#MoriyaY88 2003-11-19 Transforming Constraint Logic Programs. 81-125 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#BensaouG98 http://dx.doi.org/10.1016/S0304-3975(97)00077-7 2003-11-19 A Proof of Ehrenfeucht's Conjecture. 121-123 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#AlbertL85 2003-11-19 Test Sets for Finite Substitutions. 117-122 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#AlbertL86 2003-11-19 Languages with Homomorphic Replacements. 291-305 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#AlbertW81 2003-11-19 Star-Free Trace Languages. 301-311 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#GuaianaRS92 2003-11-19 On the totalk-diameter of connection networks. 213-228 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#DinitzEMZ00 http://dx.doi.org/10.1016/S0304-3975(98)00348-X 2003-11-19 Mate with Bishop and Knight in Kriegspiel. 389-403 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Ferguson92 2003-11-19 Some Chip Transfer Games. 157-171 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Ferguson98 http://dx.doi.org/10.1016/S0304-3975(97)00135-7 2003-11-19 A simulation of cellular automata on hexagons by cellular automata on rings. 231-234 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Martin01 http://dx.doi.org/10.1016/S0304-3975(00)00244-9 2003-11-19 Ideal models of spaces. 277-297 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00698-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Martin03 2003-11-19 A Geometrical Approach to Multiset Orderings. 17-54 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Martin89 2003-11-19 A Universal Cellular Automaton in Quasi-Linear Time and its S-m-n Form. 199-237 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Martin94 2003-11-19 Restricted CRCW PRAM. 415-426 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Nishimura94 2003-11-19 On computing the diameter of a point set in high dimensional Euclidean space. 501-514 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#FinocchiaroP02 2003-11-19 Process algebra for performance evaluation. 43-87 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#HermannsHK02 http://dx.doi.org/10.1016/S0304-3975(00)00305-4 2003-11-19 Complexity in the case against accuracy estimation. 143-165 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00573-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Nock03 2003-11-19 On the Power of Several Queues. 75-91 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Huhne93 2003-11-19 Explicit versus implicit representations of subsets of the Herbrand universe. 1021-1056 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Pichler03 2003-11-19 The complexity of makespan minimization for pipeline transportation. 339-351 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00291-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#MilidiuPL03 2003-11-19 Lower Bounds to the Complexity of Symmetric Boolean Functions. 313-323 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#BabaiPRS90 2003-11-19 Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#McIverM01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. 507-534 2003 293 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#McIverM03 2004-01-20 On the number of inductively minimal geometries. 31-35 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#CaraLP01 http://dx.doi.org/10.1016/S0304-3975(00)00228-0 2003-11-19 Parameter Free Induction and Provably Total Computable Functions. 13-33 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Beklemishev99 http://dx.doi.org/10.1016/S0304-3975(98)00305-3 2003-11-19 On Formal Power Series Defined by Infinite Linear Systems. 339-340 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#JacobR84 2003-11-19 A full continuous model of polymorphism. 407-428 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BarbaneraB03 2003-11-19 Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting. 173-207 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#BarbaneraF96 http://dx.doi.org/10.1016/S0304-3975(96)80706-7 2003-11-19 Object-oriented hybrid systems of coalgebras plus monoid actions. 41-95 2000 239 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Jacobs00 http://dx.doi.org/10.1016/S0304-3975(99)00213-3 2003-11-19 Comprehension Categories and the Semantics of Type Dependency. 169-207 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#Jacobs93 2003-11-19 Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. 427-428 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#MonienRS94 2003-11-19 Approximating algebraic functions by means of rational ones. 643-657 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#PergolaPR02 http://dx.doi.org/10.1016/S0304-3975(01)00085-8 2003-11-19 The Complexitiy of Logical Theories. 71-77 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Berman80 2003-11-19 On Quasi Orders of Words and the Confluence Property. 205-224 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#HarjuI98 http://dx.doi.org/10.1016/S0304-3975(97)00259-4 2003-11-19 The Equivalence Problem of Multitape Finite Automata. 347-355 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#HarjuK91 2003-11-19 The Equations h(w)=w-n in Binary Alphabets. 327-329 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#HarjuL84 2003-11-19 On the independence of equations in three variables. 139-172 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00098-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#HarjuN03 2003-11-19 Norms on Terms and their use in Proving Universal Termination of a Logic Program. 297-328 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#BossiCF94 2003-11-19 Finite and infinite pseudorandom binary words. 249-261 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Mauduit02 http://dx.doi.org/10.1016/S0304-3975(00)00443-6 2003-11-19 Morphismes Unispectraux. 1-11 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#Mauduit86 2003-11-19 On a Small Class of Boolean Sums. 283-289 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Tsukiji96 http://dx.doi.org/10.1016/0304-3975(96)00007-2 2003-11-19 Properties of Input-Consuming Derivations. 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#BossiER99 2003-11-19 Language preorder as a precongruence. 391-408 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Fokkink00 http://dx.doi.org/10.1016/S0304-3975(98)00267-9 2003-11-19 Topological 3D-manifolds: a statistical study of the cells. 233-254 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#FranconB00 http://dx.doi.org/10.1016/S0304-3975(98)00229-1 2003-11-19 A Parallel Algorithm for the Generation of a Permutation and Applications. 15-28 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#AlonsoS96 http://dx.doi.org/10.1016/0304-3975(95)00198-0 2003-11-19 Computational isomorphisms in classical logic. 353-378 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#DanosJS03 2003-11-19 Satisfiability in Many-Valued Sentential Logic is NP-Complete. 145-153 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Mundici87 2003-11-19 Functions Computed by Monotone Boolean Formulas with no Repeated Variables. 113-114 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Mundici89 2003-11-19 Selected Papers from PEPM'97 - Foreword. 1-2 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#Consel00 http://dx.doi.org/10.1016/S0304-3975(00)00047-5 2003-11-19 Spiking neurons and the induction of finite state machines. 251-265 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#NatschlagerM02 2003-11-19 The topology of Mazurkiewicz traces. 237-258 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00694-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#KummetzK03 2003-11-19 On Games of Incomplete Information. 25-38 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#CaiCL92 2003-11-19 On the Algebraic Structure of Combinatorial Problems. 185-204 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#Jeavons98 http://dx.doi.org/10.1016/S0304-3975(97)00230-2 2003-11-19 Intensional Aspects of Function Definitions. 1-66 1995 152 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#Fredholm95 http://dx.doi.org/10.1016/0304-3975(94)00268-9 2003-11-19 Computing Minimum with Primitive Recursion over Lists. 269-276 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Fredholm96 http://dx.doi.org/10.1016/0304-3975(95)00243-X 2003-11-19 Order-Sorted Algebraic Specifications with Higher-Order Functions. 157-185 1997 183 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Haxthausen97 http://dx.doi.org/10.1016/S0304-3975(96)00323-4 2003-11-19 Inferring the Equivalence of Functional Programs That Mutate Data. 167-215 1992 105 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#MasonT92 2003-11-19 Actor Languages Their Syntax, Semantics, Translation, and Equivalence. 409-467 1999 220 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#MasonT99 http://dx.doi.org/10.1016/S0304-3975(99)00009-2 2003-11-19 Approximate sequencing for variable length tasks. 2037-2044 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CaiDW03 2003-11-19 Modular Nim. 319-333 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#FraenkelJKS95 http://dx.doi.org/10.1016/0304-3975(94)00260-P 2003-11-19 Semi-Commutations and Petri Nets. 67-81 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#HungK89 2004-08-26 The inapproximability of non-NP-hard optimization problems. 553-571 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#CaiJK02 2005-02-09 Machine Characterization of (E0L-E0L) Array Languages. 329-346 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#NirmalR91 2003-11-19 Limiting Semantics of Numerical Programs. 89-110 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Hoover97 http://dx.doi.org/10.1016/S0304-3975(96)00050-3 2003-11-19 More Efficient Bottom-Up Multi-Pattern Matching in Trees. 21-60 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#CaiPT92 2003-11-19 Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. 189-201 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#LarmoreR98 http://dx.doi.org/10.1016/S0304-3975(97)00253-3 2003-11-19 On the bandwidth of a Hamming graph. 491-498 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(03)00052-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Harper03 2003-11-19 Note on Ramsey theorems for spatial graphs. 205-210 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Negami01 http://dx.doi.org/10.1016/S0304-3975(00)00242-5 2003-11-19 The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. 3-38 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#HuntR83 2003-11-19 New Families of Non Real Time DPDA's and their Decidability Results. 255-274 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#ItzhaikY84 2003-11-19 Protocol insecurity with a finite number of sessions, composed keys is NP-complete. 451-475 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00490-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#RusinowitchT03 2003-11-19 Simple and efficient network decomposition and synchronization. 217-241 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#MoranS00 http://dx.doi.org/10.1016/S0304-3975(98)00206-0 2003-11-19 Optimal Covering of Cacti by Vertex-Disjoint Paths. 179-197 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#MoranW91 2003-11-19 _m. 147-164 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#CattaneoFMM00 http://dx.doi.org/10.1016/S0304-3975(98)00005-X 2003-11-19 On the Dynamical Behavior of Chaotic Cellular Automata. 31-51 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#CattaneoFMM99 http://dx.doi.org/10.1016/S0304-3975(98)00149-2 2003-11-19 Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. 3-30 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#AumannR94 2003-11-19 Conditional Equational Theories and Complete Sets of Transformations. 85-110 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#Holldobler90 2003-11-19 The Semantics and Proof Theory of Linear Logic. 161-184 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Avron88 2003-11-19 The Chemical Abstract Machine. 217-248 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#BerryB92 2003-11-19 Sequential Algorithms on Concrete Data Structures. 265-321 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#BerryC82 2003-11-19 Inferring evolutionary trees with strong combinatorial evidence. 271-298 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#BerryG00 http://dx.doi.org/10.1016/S0304-3975(99)00235-2 2003-11-19 An application of lattice theory to knowledge representation. 163-196 2000 249 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Oles00 http://dx.doi.org/10.1016/S0304-3975(00)00058-X 2003-11-19 From Regular Expressions to Deterministic Automata. 117-126 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#BerryS86 2003-11-19 Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. 183-208 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#AjiliC97 http://dx.doi.org/10.1016/S0304-3975(96)00195-8 2003-11-19 Algebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach. 311-362 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#BurmeisterMRV99 http://dx.doi.org/10.1016/S0304-3975(97)00282-X 2003-11-19 Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2. 183-197 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#HuynhT94 2003-11-19 Fréquences des facteurs des suites sturmiennes. 295-309 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Berthe96 http://dx.doi.org/10.1016/0304-3975(95)00224-3 2003-11-19 Minimality of the System of Seven Equations for the Category of Finite Sets. 347-353 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Massol97 http://dx.doi.org/10.1016/S0304-3975(97)81498-3 2003-11-19 Abstract Data Types and Algebraic Semantics of Programming Languages. 1-31 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Pair82 2003-11-19 Complex Boolean Networks Obtained by Diagonalization. 119-125 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Scarpellini85 2003-11-19 On Counting Problems and the Polynomial-Time Hierarchy. 161-173 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Angluin80 2003-11-19 Finiteness is Mu-Ineffable. 173-181 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Park76 2003-11-19 An Algebraic Formulation of the Aggregative Closure Query. 49-62 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#Park96 http://dx.doi.org/10.1016/0304-3975(95)00081-X 2003-11-19 Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. 263-273 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Park98 http://dx.doi.org/10.1016/S0304-3975(97)00277-6 2003-11-19 Generation of Invertible Functions. 289-297 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#JacopiniM89 2003-11-19 Reversible Parallel Computation: An Evolving Space-Model. 1-46 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#JacopiniS90 2003-11-19 General Recursive Functions in a Very Simply Interpretable Typed lambda-Calculus. 169-178 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#JacopiniS93 2003-11-19 Realizing Boolean Functions on Disjoint sets of Variables. 383-396 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Paul76 2003-11-19 On Heads Versus Tapes. 1-12 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Paul84 2003-11-19 On Solving the Equality Problem in Theories Defined by Horn Clauses. 127-153 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Paul86 2003-11-19 A Variant of Random Context Grammars: Semi-Conditional Grammars. 1-17 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Paun85 2003-11-19 Non Deterministic Polynomial Optimization Problems and their Approximations. 251-277 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#PazM81 2003-11-19 Deterministic parallel backtrack search. 309-324 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#HerleyPP02 http://dx.doi.org/10.1016/S0304-3975(00)00386-8 2003-11-19 On the size of parsers and LR(k)-grammars. 59-69 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#LeungW00 http://dx.doi.org/10.1016/S0304-3975(98)00199-6 2005-11-15 A Characterization of the Squares in a Fibonacci String. 281-291 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#IliopoulosMS97 http://dx.doi.org/10.1016/S0304-3975(96)00141-7 2003-11-19 Adding Closed World Assumptions to Well-Founded Semantics. 49-68 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#PereiraAA94 2003-11-19 Complexity-theoretic models of phase transitions in search problems. 243-263 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#DunneGZ00 http://dx.doi.org/10.1016/S0304-3975(00)00061-X 2003-11-19 Inclusion and Equivalence between Relational Database Schemata. 267-285 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#AtzeniABM82 2003-11-19 Min-max-boundary domain decomposition. 253-266 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#KiwiST01 http://dx.doi.org/10.1016/S0304-3975(00)00143-2 2003-11-19 Searching games with errors - fifty years of coping with liars. 71-109 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Pelc02 http://dx.doi.org/10.1016/S0304-3975(01)00303-6 2003-11-19 Lie Patterns in Search Procedures. 61-69 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Pelc86 2003-11-19 Searching with Known Error Probability. 185-202 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Pelc89 2003-11-19 On the Complexity of Theories of Permutations. 247-269 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Pelz85 2003-11-19 Algebraic Transformation of Unary Partial Algebras I: Double-Pushout Approach. 145-193 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#BurmeisterRTV97 http://dx.doi.org/10.1016/S0304-3975(96)00139-9 2003-11-19 Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems. 261-278 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Otto84a 2003-11-19 Explicit Substitution On the Edge of Strong Normalization. 375-395 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#BlooG99 http://dx.doi.org/10.1016/S0304-3975(97)00183-7 2003-11-19 Codes Modulo Finite Monadic String-Rewriting Systems. 175-188 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#OttoN94 2003-11-19 Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs. 93-106 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#KuceraNP80 2003-11-19 Costs of general purpose learning. 455-473 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#CaseCJ01 http://dx.doi.org/10.1016/S0304-3975(00)00028-1 2003-11-19 A Note on Guarded Theories. 73-83 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Bloom90 2003-11-19 Structural Operational Semantics for Weak Bisimulations. 25-68 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#Bloom95 http://dx.doi.org/10.1016/0304-3975(94)00152-9 2003-11-19 Generalized and geometric Ramsey numbers for cycles. 87-98 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#KarolyiR01 http://dx.doi.org/10.1016/S0304-3975(00)00233-4 2003-11-19 Uniform asymptotics of some Abel sums arising in coding theory. 145-158 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Hwang01 http://dx.doi.org/10.1016/S0304-3975(00)00238-3 2004-02-18 A survey on multi-loop networks. 107-121 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(01)00341-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Hwang03 2003-11-19 Complete formal systems for equivalence problems. 309-334 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Senizergues00 http://dx.doi.org/10.1016/S0304-3975(99)00106-1 2003-11-19 L(A)=L(B)? decidability results from complete formal systems. 1-166 2001 251 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs251.html#Senizergues01 http://dx.doi.org/10.1016/S0304-3975(00)00285-1 2003-11-19 L(A)=L(B)? A simplified decidability proof. 555-608 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Senizergues02 http://dx.doi.org/10.1016/S0304-3975(02)00027-0 2003-11-19 A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. 213-232 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Senizergues90 2003-11-19 Some Undecidable Termination Problems for Semi-Thue Systems. 257-276 1995 142 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#Senizergues95 http://dx.doi.org/10.1016/0304-3975(94)00278-9 2003-11-19 A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. 55-75 1998 192 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#Senizergues98 http://dx.doi.org/10.1016/S0304-3975(97)00145-X 2003-11-19 Neural circuits for pattern recognition with small total wire length. 239-249 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#LegensteinM02 2003-11-19 Spring algorithms and symmetry. 379-405 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#EadesL00 http://dx.doi.org/10.1016/S0304-3975(99)00239-X 2003-11-19 Algebraic Relations and Presentations. 39-60 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#KamimuraT83a 2003-11-19 Total Objects of Domains. 275-288 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#KamimuraT84a 2003-11-19 Drawing Graphs in Two Layers. 361-374 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#EadesW94 2003-11-19 The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. 23-37 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#EadesW96 http://dx.doi.org/10.1016/S0304-3975(97)84223-5 2003-11-19 Vacillatory and BC learning on noisy data. 115-141 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#CaseJS00 http://dx.doi.org/10.1016/S0304-3975(99)00268-6 2003-11-19 Synthesizing noise-tolerant language learners. 31-56 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#CaseJS01 http://dx.doi.org/10.1016/S0304-3975(00)00132-8 2003-11-19 Control structures in hypothesis spaces: the influence on learning. 287-308 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#CaseJS02 http://dx.doi.org/10.1016/S0304-3975(00)00385-6 2003-11-19 Reversible Simulation of One-Dimensional Irreversible Cellular Automata. 157-163 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Morita95 http://dx.doi.org/10.1016/0304-3975(95)00038-X 2003-11-19 Universality of a Reversible Two-Counter Machine. 303-320 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Morita96 http://dx.doi.org/10.1016/S0304-3975(96)00081-3 2003-11-19 Anomalous Learning Helps Succinctness. 13-28 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#CaseJS96 http://dx.doi.org/10.1016/0304-3975(95)00154-9 2003-11-19 A combinatorial problem on Trapezoidal words. 11-33 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#DAlessandro02 http://dx.doi.org/10.1016/S0304-3975(00)00431-X 2003-11-19 Topological Characterizations of Infinite Tree Languages. 165-171 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Moriya87 2003-11-19 A Grammatical Characterization of Alternating Pushdown Automata. 75-85 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Moriya89 2003-11-19 On Unambiguous Reductions of Monoids of Unambiguous Relations. 215-220 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Capri87 2003-11-19 Traps Characterize Home States in Free Choice Systems. 161-176 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#BestDE92 2003-11-19 A Sound and Complete Axiomatization of Embedded Cross Dependencies. 343-350 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#BancilhonR84 2003-11-19 Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices. 183-204 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Jacob77 2003-11-19 Hierarchies of Weak Automata and Weak Monadic Formulas. 323-335 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Mostowski91 2003-11-19 A Note on Schnorr's Separatedness. 235 1977 4 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Lehmann77a 2003-11-19 Epis need not be Dense. 151-161 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#LehmannP82 2003-11-19 Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete. 305-326 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Huynh84 2003-11-19 Nonuniform Complexity and the Randomness of Certain Complete Languages. 305-324 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Huynh92 2003-11-19 Non-Uniform Random Spanning Trees on Weighted Graphs. 263-271 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#MosbahS99 http://dx.doi.org/10.1016/S0304-3975(98)00325-9 2003-11-19 Quasiperiodicity and String Covering. 205-216 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#IliopoulosM99 http://dx.doi.org/10.1016/S0304-3975(98)00260-6 2003-11-19 A Work-Time Optimal Algorithm for Computing All String Covers. 299-310 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#IliopoulosP96 http://dx.doi.org/10.1016/0304-3975(96)00047-3 2003-11-19 Structural measures for games and process control in the branch learning model. 135-165 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#OttS00 http://dx.doi.org/10.1016/S0304-3975(98)00339-9 2003-11-19 Avoiding coding tricks by hyperrobust learning. 161-180 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#OttS02 http://dx.doi.org/10.1016/S0304-3975(01)00086-X 2005-11-15 Optimal Algorithms for Computing the canonical form of a circular string. 87-105 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#IliopoulosS92 2003-11-19 Une Application de la Representation Matricielle des Transductions. 271-293 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#PinS85 2003-11-19 Families of locally testable languages. 361-376 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Caron00a http://dx.doi.org/10.1016/S0304-3975(98)00332-6 2003-11-19 Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. 249-260 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Otto84 2005-07-21 On quasi-open bisimulation. 96-126 2005 338 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2004.10.041 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#Fu05 2003-11-19 The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. 225-232 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Otto86 2003-11-19 On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity. 19-35 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Otto89 2003-11-19 Some Undecidability Results Concerning the Property of Preserving Regularity. 43-72 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Otto98 http://dx.doi.org/10.1016/S0304-3975(98)00055-3 2003-11-19 Bisimulation-invariant PTIME and higher-dimensional µ-calculus. 237-265 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Otto99 http://dx.doi.org/10.1016/S0304-3975(98)00314-4 2003-11-19 CSP, partial automata, and coalgebras. 3-34 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#Wolter02 http://dx.doi.org/10.1016/S0304-3975(01)00019-6 2003-11-19 Decidability of Reachability for Disjoint Union of Term Rewriting Systems. 31-52 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#CaronC94 2003-11-19 Comparison of Identification Criteria for Machine Inductive Inference. 193-220 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#CaseS83 2003-11-19 Algebraic Structures for Transitive Closure. 59-76 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Lehmann77 2003-11-19 A Universal Machine without Change of State. 291-348 1987 55 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Lehmann87 2003-11-19 Probabilistic Hyperedge Replacement Grammars. 81-102 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Mosbah96 http://dx.doi.org/10.1016/0304-3975(95)00202-2 2003-11-19 Characterization of Glushkov automata. 75-90 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#CaronZ00 http://dx.doi.org/10.1016/S0304-3975(97)00296-X 2003-11-19 LANGAGE: A Maple Package for Automaton Characterization of Regular Languages. 5-15 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Caron00 http://dx.doi.org/10.1016/S0304-3975(99)00013-4 2003-11-19 Multidimensional Unrepetitive Configurations. 233-241 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Carpi88 2003-11-19 Overlap-Free Words and Finite Automata. 243-260 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Carpi93 2003-11-19 On Abelian Squares and Substitutions. 61-81 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Carpi99 http://dx.doi.org/10.1016/S0304-3975(98)00250-3 2003-11-19 On Synchronizing Unambiguous Automata. 285-296 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#Carpi88a 2003-11-19 Words and special factors. 145-182 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#CarpiL01 http://dx.doi.org/10.1016/S0304-3975(99)00334-5 2003-11-19 Semiperiodic words and root-conjugacy. 111-130 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#CarpiL03 2003-11-19 Non-Repetitive Words Relative to a Rewriting System. 39-53 1990 72 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#CarpiL90 2003-11-19 Efficient Scheduling of Tasks without Full Use of Processor Resources. 1-17 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Jaffe80 2003-11-19 Universal coalgebra: a theory of systems. 3-80 2000 249 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Rutten00 http://dx.doi.org/10.1016/S0304-3975(00)00056-6 2003-11-19 Behavioural differential equations: a coinductive calculus of streams, automata, and power series. 1-53 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00895-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#Rutten03 2003-11-19 Elements of Generalized Ultrametric Domain Theory. 349-381 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Rutten96 http://dx.doi.org/10.1016/S0304-3975(96)80711-0 2003-11-19 Combination of constraint systems II: Rational amalgamation. 113-157 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#SchulzK01 http://dx.doi.org/10.1016/S0304-3975(00)00164-X 2003-11-19 Geometric Sets of Low Information Content. 193-219 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#AgrawalA96 http://dx.doi.org/10.1016/0304-3975(95)00073-9 2003-11-19 Clocks in Dataflow Languages. 125-140 1992 94 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Caspi92 2003-11-19 Recurrence and periodicity in infinite words from local periods. 269-284 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#DuvalMR01 http://dx.doi.org/10.1016/S0304-3975(00)00204-8 2003-11-19 Fourier Analysis of Genetic Algorithms. 143-175 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#KostersKF99 http://dx.doi.org/10.1016/S0304-3975(99)00092-4 2003-11-19 Coherence Spaces are Untopological. 353-357 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Bethke91 2003-11-19 Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms. 273-298 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Fernandez-CamachoS90 2003-11-19 Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators. 231-276 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#Yoshida02 http://dx.doi.org/10.1016/S0304-3975(00)00310-8 2003-11-19 A Maude specification of an object-oriented model for telecommunication networks. 407-439 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#PitaM02 http://dx.doi.org/10.1016/S0304-3975(01)00364-4 2003-11-19 Discrete Parabolas and Circles on 2D Cellular Automata. 347-417 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#DelormeMT99 http://dx.doi.org/10.1016/S0304-3975(98)00330-2 2003-11-19 On Devising Boolean Routing Schemes. 171-198 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#FlamminiG97 http://dx.doi.org/10.1016/S0304-3975(97)86543-7 2003-11-19 Late and Early Semantics Coincide for Testing. 341-349 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#Ingolfsdottir95 http://dx.doi.org/10.1016/0304-3975(94)00304-2 2003-11-19 On the Average Number of Rebalancing Operations in Weight-Balanced Trees. 303-320 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#BlumM80 2003-11-19 No-Longer-Foreign: Teaching an ML compiler to speak C "natively". 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#Blume01 2003-11-19 Techniques for Parallel Manipulation of Sparse Matrices. 135-157 1989 64 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#KruskalRS89 2003-11-19 A Complexity Theory of Efficient Parallel Algorithms. 95-132 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#KruskalRS90 2003-11-19 Local Model Checking in the Modal mu-Calculus. 161-177 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#StirlingW91 2003-11-19 Institutions for Logic Programming. 485-511 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#OrejasPE97 http://dx.doi.org/10.1016/S0304-3975(96)00164-8 2003-11-19 Linear Logic, Coherence, and Dinaturality. 3-41 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Blute93 2003-11-19 On Well Quasi Orders of Free Monoids. 131-152 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#IlieS98 http://dx.doi.org/10.1016/S0304-3975(98)00036-X 2003-11-19 Reducing NFAs by invariant equivalences. 373-390 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00311-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#IlieY03 2003-11-19 Kolmogorov complexity and non-determinism. 151-180 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#GrigorieffM02 http://dx.doi.org/10.1016/S0304-3975(01)00038-X 2003-11-19 Mind change complexity of learning logic programs. 143-160 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#JainS02 http://dx.doi.org/10.1016/S0304-3975(01)00084-6 2003-11-19 On LLP(k) Grammars and Languages. 149-175 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Pittl81 2003-11-19 Program Size Restrictions in Computational Learning. 351-386 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#JainS94 2003-11-19 On Aggregating Teams of Learning Machines. 85-108 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#JainS95 http://dx.doi.org/10.1016/0304-3975(94)00162-C 2003-11-19 A co-Induction Principle for Recursively Defined Domains. 195-219 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Pitts94 2003-11-19 Paging More than One Page. 75-90 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Feuerstein97 http://dx.doi.org/10.1016/S0304-3975(97)89513-8 2003-11-19 Characterization and Closure Properties of Linear Omega-Languages. 79-95 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Mihoubi98 http://dx.doi.org/10.1016/S0304-3975(97)00316-2 2003-11-19 Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories. 239-264 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#TarleckiBG91 2003-11-19 Chain Automata. 191-203 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Carton96 http://dx.doi.org/10.1016/0304-3975(95)00103-4 2003-11-19 The Directed Subgraph Homeomorphism Problem. 111-121 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#FortuneHW80 2003-11-19 A space lower bound for st-connectivity on node-named JAGs. 327-345 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Poon00 http://dx.doi.org/10.1016/S0304-3975(00)00019-0 2003-11-19 Dynamic orthogonal range queries in OLAP. 487-510 2003 3 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00741-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Poon03 2003-11-19 Type Inference, Abstract Interpretation and Strictness Analysis. 113-143 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#CoppoF93 2003-11-19 Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. 243-260 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#KarpinskiR98 http://dx.doi.org/10.1016/S0304-3975(97)00252-1 2003-11-19 On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields. 259-266 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#KarpinskiS96 http://dx.doi.org/10.1016/0304-3975(95)00162-X 2003-11-19 On Randomized versus Deterministic Computation. 23-39 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#KarpinskiV96 http://dx.doi.org/10.1016/0304-3975(95)00127-1 2003-11-19 A computation-universal two-dimensional 8-state triangular reversible cellular automaton. 181-191 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#ImaiM00 http://dx.doi.org/10.1016/S0304-3975(99)00099-7 2003-11-19 Firing Squad Synchronization Problem in Reversible Cellular Automata. 475-482 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#ImaiM96 http://dx.doi.org/10.1016/0304-3975(96)00016-3 2003-11-19 On a Conjecture Concerning Dot-Depth Two Languages. 161-183 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#StraubingW92 2003-11-19 The Variance of the height of binary search trees. 913-919 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Drmota02 http://dx.doi.org/10.1016/S0304-3975(01)00006-8 2003-11-19 Logical foundations of CafeOBJ. 289-318 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#DiaconescuF02 http://dx.doi.org/10.1016/S0304-3975(01)00361-9 2003-11-19 Abstract Specification of Structures and Methods in Symbolic Mathematical Computation. 89-107 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#LimongelliT92 2003-11-19 Quasi-Linear Truth-Table Reductions to p-Selective Sets. 361-370 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#AgrawalA96a http://dx.doi.org/10.1016/0304-3975(95)00167-0 2003-11-19 Deterministic Top-Down Tree Transducers with Iterated Lookahead. 285-308 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#SlutzkiV95 http://dx.doi.org/10.1016/0304-3975(94)00111-U 2003-11-19 Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen. 21-25 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Strassen75 2003-11-19 Semantics of Finite Delay. 205-234 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Hartonas97 http://dx.doi.org/10.1016/S0304-3975(96)00095-3 2003-11-19 A Fixpoint Approach to Finite Delay and Fairness. 131-158 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Hartonas98 http://dx.doi.org/10.1016/S0304-3975(97)00076-5 2003-11-19 An Algebraic Characterization of Frontier Testable Tree Languages. 85-106 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#Wilke96 http://dx.doi.org/10.1016/0304-3975(95)00131-X 2003-11-19 A Polynomial Algorithm for Solving Systems of Two Linear Diophantine Equations. 329-340 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Romeuf90 2003-11-19 Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. 119-156 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#ErlebachRSSZ01 http://dx.doi.org/10.1016/S0304-3975(00)00136-5 2003-11-19 The Finiteness of Finitely Presented Monoids. 169-182 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#McNaughton98 http://dx.doi.org/10.1016/S0304-3975(98)00038-3 2003-11-19 Deque Automata and a Subfamily of Context-Sensitive Languages which Contains all Semilinear Bounded Languages. 163-174 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Ayers85 2003-11-19 Applications quasi affines: pavages par images réciproques. 1-38 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Nehlig96 http://dx.doi.org/10.1016/0304-3975(95)00040-2 2003-11-19 Graded Hypothesis Theories. 247-280 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#ChatalicFS97 http://dx.doi.org/10.1016/S0304-3975(96)00131-4 2003-11-19 On final coalgebras of continuous functors. 3-29 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Adamek03 2003-11-19 Colonies with limited activation of components. 289-298 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#KelemenKMM00 http://dx.doi.org/10.1016/S0304-3975(00)00206-1 2003-11-19 Pseudo-Minimal Transducer. 129-139 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Maurel00 http://dx.doi.org/10.1016/S0304-3975(99)00022-5 2003-11-19 Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height. 85-100 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Hashiguchi91a 2003-11-19 Extended Regular Expressions of Star Degree at Most Two. 273-284 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#HashiguchiY90 2003-11-19 Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids. 77-86 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#HashiguchiY92 2003-11-19 Symmetric Space-Bounded Computation. 161-187 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#LewisP82 2003-11-19 Exact Complexity Bounds for Ordinal Addition. 247-273 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Maurin96 http://dx.doi.org/10.1016/0304-3975(95)00221-9 2003-11-19 Refuting learning revisited. 145-177 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00422-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#MerkleS03 2006-10-26 Using MAPLE for the Analysis of Bifurcation Phenomena in Gas Combustion. 249-262 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#HamidiG97 http://dx.doi.org/10.1016/S0304-3975(97)00068-6 2003-11-19 Succinctness of Descriptions of SBTA-Languages. 251-271 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#GruskaMNP97 http://dx.doi.org/10.1016/S0304-3975(96)00133-8 2003-11-19 On canonical number systems. 921-933 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#AkiyamaP02 http://dx.doi.org/10.1016/S0304-3975(01)00103-7 2003-11-19 A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. 57-68 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#BorodinFHUW88 2003-11-19 Some classes of prolog programs inferable from positive data. 211-234 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#Rao00a http://dx.doi.org/10.1016/S0304-3975(99)00271-6 2003-11-19 Modular Proofs for Completeness of Hierarchical Term Rewriting Systems. 487-512 1995 151 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Rao95a http://dx.doi.org/10.1016/0304-3975(95)00075-8 2003-11-19 Polynomial-time learnability of logic programs with local variables from entailment. 179-198 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#RaoS01 http://dx.doi.org/10.1016/S0304-3975(00)00270-X 2003-11-19 Domains for Logic Programming. 63-99 1992 94 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#FilippenkoM92 2003-11-19 Regularity-Preserving Relations. 147-154 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#SeiferasM76 2003-11-19 Units of Special Church-Rosser Monoids. 13-22 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Squier87 2003-11-19 On the Power of Multi-Prover Interactive Protocols. 545-557 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#FortnowRS94 2003-11-19 A Lower Bound on the Number of Additions in Monotone Computations. 305-315 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Schnorr76a 2003-11-19 Mixed Searching and Proper-Path-Width. 253-268 1995 137 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#TakahashiUK95 http://dx.doi.org/10.1016/0304-3975(94)00160-K 2003-11-19 The Context-Freeness of the Languages Associated with Vector Addition Systems is Decidable. 199-247 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Schwer92a 2003-11-19 Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. 267-302 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#MossMG92 2003-11-19 On the Additive Complexity of Polynomials. 1-18 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#SchnorrW80 2003-11-19 Dependable computing: an overview. 1115-1126 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#MotetG03 2003-11-19 Asynchronous process calculi: the first- and higher-order paradigms. 311-350 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#Sangiorgi01 http://dx.doi.org/10.1016/S0304-3975(00)00097-9 2003-11-19 Locality and Interleaving Semantics in Calculi for Mobile Processes. 39-83 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Sangiorgi96 http://dx.doi.org/10.1016/0304-3975(95)00020-8 2003-11-19 The Name Discipline of Uniform Receptiveness. 457-493 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#Sangiorgi99 http://dx.doi.org/10.1016/S0304-3975(99)00040-7 2003-11-19 Minimal Complete Sets of Words. 325-332 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#BoeLR80 2003-11-19 On-line bin-stretching. 17-41 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#AzarR01 http://dx.doi.org/10.1016/S0304-3975(00)00258-9 2003-11-19 Reconstruction of domino tiling from its two orthogonal projections. 437-447 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Picouleau01 http://dx.doi.org/10.1016/S0304-3975(99)00312-6 2003-11-19 Complexity of the Hamiltonian Cycle in Regular Graph Problem. 463-473 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Picouleau94 2003-11-19 Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. 59-72 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Picouleau96 http://dx.doi.org/10.1016/0304-3975(95)00184-0 2003-11-19 Annotations for Portable Intermediate Languages. 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#Reig01 2003-11-19 A Specification Structure for Deadlock-Freedom of Synchronous Processes. 1-53 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#AbramskyGN99 http://dx.doi.org/10.1016/S0304-3975(98)00189-3 2003-11-19 Random Allocation of Jobs with Weights and Precedence. 341-349 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Chakrabarti96 http://dx.doi.org/10.1016/0304-3975(96)00036-9 2003-11-19 Quantales, finite observations and strong bisimulation. 95-149 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Resende01 http://dx.doi.org/10.1016/S0304-3975(99)00123-1 2003-11-19 Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. 263-278 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00408-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#KralKV03 2003-11-19 Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. 271-290 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#BiranMZ95 http://dx.doi.org/10.1016/0304-3975(94)00157-E 2003-11-19 Approximating the Number of Linear Extensions. 271-282 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#EwachaRZ97 http://dx.doi.org/10.1016/S0304-3975(96)00203-4 2003-11-19 Polynomial ideals for sandpiles and their Gröbner bases. 1-15 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#CoriRS02 http://dx.doi.org/10.1016/S0304-3975(00)00397-2 2003-11-19 Fixed Points in Free Process Algebras, Part II. 179-192 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#TiurynB90 2003-11-19 Some Relationships Between Logics of Programs and Complexity Theory. 83-108 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#TiurynU88 2003-11-19 On Graph Rewritings. 1-24 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Raoult84 2003-11-19 Query Evaluation in Probabilistic Relational Databases. 179-219 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#Zimanyi97 http://dx.doi.org/10.1016/S0304-3975(96)00129-6 2003-11-19 On infinite transition graphs having a decidable monadic theory. 79-115 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Caucal03 2003-11-19 On the Regular Structure of Prefix Rewriting. 61-86 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Caucal92 2003-11-19 On Nondeterminism in Parallel Computation. 111-120 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Dymond86 2003-11-19 (1+epsilon)-Approximation of sorting by reversals and transpositions. 517-529 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Eriksen02 2003-11-19 Closure operations for digital topology. 457-471 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00708-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Slapal03 2003-11-19 Generalization of automatic sequences for numeration systems on a regular language. 271-281 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Rigo00 http://dx.doi.org/10.1016/S0304-3975(00)00163-8 2003-11-19 Numeration systems on a regular language: arithmetic operations, recognizability and formal power series. 469-498 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Rigo01 http://dx.doi.org/10.1016/S0304-3975(01)00184-0 2003-11-19 Factorizations of Free Monoids and Unaviodable Regularities. 81-89 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Varricchio90 2003-11-19 Rational Series with Coefficients in a Commutative Ring. 41-50 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Varricchio92 2003-11-19 A Unified Approach for Studying the Properties of Transition Systems. 227-258 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Sifakis82 2003-11-19 Almost Every Set in Exponential Time is P-bi-Immune. 487-506 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Mayordomo94 2003-11-19 On Branching and Looping, Part II. 273-295 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Havel80a 2003-11-19 On Coordinated Selective Substitutions: Towards a Unified Theory of Grammars and Machines. 31-50 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Rozenberg85 2003-11-19 The Solutions of Two Star-Height Problems for Regular Trees. 205-239 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#BraquelaireC84 2003-11-19 Nine test tubes generate any RE language. 171-180 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#FerrettiMZ00 http://dx.doi.org/10.1016/S0304-3975(99)00098-5 2003-11-19 Automatic Synthesis of Typed Lambda-Programs on Term Algebras. 135-154 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#BohmB85 2003-11-19 An Analysis of Loop Checking Mechanisms for Logic Programs. 35-79 1991 86 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#BolAK91 2003-11-19 Cylindric structures and dependencies in relational databases. 451-468 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#DuntschM01 http://dx.doi.org/10.1016/S0304-3975(01)00016-0 2003-11-19 Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-Free Covers. 105-122 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Lakshmanan88 2003-11-19 Preface. 1-2 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#Lakshmanan97 http://dx.doi.org/10.1016/S0304-3975(96)00122-3 2003-11-19 A Faithful Computational Model of the Real Numbers. 277-294 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Sunderhauf95 http://dx.doi.org/10.1016/0304-3975(95)00054-Z 2003-11-19 A classification of wait-free loop agreement tasks. 55-77 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#HerlihyR03 2003-11-19 On the equivalence of the cube-product and the general product of automata. 103-113 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#Imreh00 http://dx.doi.org/10.1016/S0304-3975(99)00276-5 2003-11-19 On Square-Free Factorization of Multivariate Polynomials over a Finite Field. 105-116 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Bernardin97 http://dx.doi.org/10.1016/S0304-3975(97)00059-5 2003-11-19 Performance measure sensitive congruences for Markovian process algebras. 117-160 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BernardoB03 2003-11-19 Corrigendum to ``A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time'' - [TCS 202 (1998) 1-54]. 691-694 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#BernardoG01 http://dx.doi.org/10.1016/S0304-3975(00)00256-5 2003-11-19 A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time. 1-54 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#BernardoG98 http://dx.doi.org/10.1016/S0304-3975(97)00127-8 2003-11-19 A Simple Proof for the Completeness of Floyd's Method. 345-348 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Sain85 2003-11-19 Total Correctness in Nonstandard Logics of Programs. 285-321 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#Sain87 2003-11-19 Temporal Logics Need Their Clocks. 75-95 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Sain92 2003-11-19 The Equational Theory of Pomsets. 199-224 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Gischer88 2003-11-19 Lyndon Trees. 373-383 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#SubramanianSM92 2003-11-19 Combining word problems through rewriting in categories with products. 103-149 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#FiorentiniG03 2003-11-19 Theory of Symbolic Expressions, I. 19-55 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Sato83 2003-11-19 E-CCC: Between CCC and Topos. 55-66 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Sato89 2003-11-19 Equivalence-Preserving First-Order Unfold/Fold Transformation Systems. 57-84 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#Sato92 2003-11-19 Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules. 75-92 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Sato97 http://dx.doi.org/10.1016/S0304-3975(96)00170-3 2003-11-19 <i>Z</i>_<i>m</i>. 135-144 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Sato98 http://dx.doi.org/10.1016/S0304-3975(97)00071-6 2003-11-19 The First-Order Theory of Linear One-Step Rewriting is Undecidable. 179-190 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#Treinen98 http://dx.doi.org/10.1016/S0304-3975(98)00083-8 2003-11-19 Structure of some sand piles model. 525-556 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#LatapyMMP01 http://dx.doi.org/10.1016/S0304-3975(00)00363-7 2003-11-19 Online request server matching. 145-160 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Riedel01 http://dx.doi.org/10.1016/S0304-3975(00)00265-6 2003-11-19 Functional-Logic Integration via Minimal Reciprocal Extensions. 77-99 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#Boley99 http://dx.doi.org/10.1016/S0304-3975(98)00136-4 2003-11-19 On the Kleijn-Rozenberg k-Adjacent Languages. 23-68 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Carrere96 http://dx.doi.org/10.1016/0304-3975(95)00084-4 2003-11-19 A fully abstract denotational model for observational precongruence. 35-61 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#IngolfsdottirS01 http://dx.doi.org/10.1016/S0304-3975(99)00117-6 2003-11-19 On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. 329-337 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#GibbonsR86 2003-11-19 Optimally Edge-Colouring Outerplanar Graphs is in NC. 401-411 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#GibbonsR90 2003-11-19 Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. 103-111 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#SalomaaWY00 http://dx.doi.org/10.1016/S0304-3975(99)00020-1 2003-11-19 Structural Equivalence and ET0L Grammars. 123-140 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#SalomaaWY96 http://dx.doi.org/10.1016/0304-3975(95)00187-5 2003-11-19 The firing squad synchronization problem on Cayley graphs. 243-256 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Roka00 http://dx.doi.org/10.1016/S0304-3975(00)00160-2 2003-11-19 One-Way Cellular Automata on Cayley Graphs. 259-290 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Roka94 2003-11-19 Simulations between Cellular Automata on Cayley Graphs. 81-111 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#Roka99 http://dx.doi.org/10.1016/S0304-3975(97)00213-2 2003-11-19 Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. 303-308 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Rote97 http://dx.doi.org/10.1016/S0304-3975(96)00185-5 2003-11-19 Equational axiomatizability for coalgebra. 229-247 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Rosu01 http://dx.doi.org/10.1016/S0304-3975(00)00129-8 2003-11-19 NP-completeness for calculating power indices of weighted majority games. 305-310 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#MatsuiM01 http://dx.doi.org/10.1016/S0304-3975(00)00251-6 2003-11-19 Unfold/Fold Transformations of Stratified Programs. 107-139 1991 86 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#Seki91 2003-11-19 Structural inclusion in the pi-calculus with replication. 131-168 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#EngelfrietG01 http://dx.doi.org/10.1016/S0304-3975(99)00330-8 2003-11-19 Multisets and Structural Congruence of the pi-Calculus with Replication. 311-337 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#EngelfrietG99 http://dx.doi.org/10.1016/S0304-3975(97)00179-5 2003-11-19 X-Automata on omega-Words. 1-51 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#EngelfrietH93 2003-11-19 Nonterminal Bounded NLC Graph Grammars. 309-315 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#EngelfrietL88 2003-11-19 Matching for the lambda Calculus of Objects. 101-140 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#BonoB99 http://dx.doi.org/10.1016/S0304-3975(98)00137-6 2003-11-19 Pushdown Machines for the Macro Tree Transducer. 251-368 1986 42 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs42.html#EngelfrietV86 2003-11-19 Modular Tree Transducers. 267-303 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#EngelfrietV91 2003-11-19 More on randomized on-line algorithms for caching. 1997-2008 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ChrobakKN03 2003-11-19 The Structure of Generalized Complexity Cores. 103-119 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#BookD88 2003-11-19 Testing for the Church-Rosser Property. 223-229 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#BookO81 2003-11-19 On the Security of Name-Stamp Protocols. 319-325 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#BookO85 2003-11-19 Attack on RSA-Type Cryptosystems Based on Singular Cubic Curves over Z/nZ. 19-27 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#ChuaLL99 http://dx.doi.org/10.1016/S0304-3975(99)00062-6 2003-11-19 Bounded Query Machines: On NP( ) and NPQERY( ). 41-50 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#BookW81 2003-11-19 Asymptotic behavior in a heap model with two pieces. 525-560 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#MairesseV02 http://dx.doi.org/10.1016/S0304-3975(01)00004-4 2003-11-19 Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. 69-105 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#RosierY86 2003-11-19 On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs. 263-324 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#RosierY88 2003-11-19 Synchronization Languages. 99-121 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#ClerboutRR99 http://dx.doi.org/10.1016/S0304-3975(97)00134-5 2005-11-09 The Algebra of Communicating Processes With Empty Process. 287-328 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Vrancken97 http://dx.doi.org/10.1016/S0304-3975(96)00250-2 2003-11-19 Knowledge, Belief and Time. 155-174 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#KrausL88 2003-11-19 Algorithms of distributed task allocation for cooperative agents. 1-27 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#KrausP00 http://dx.doi.org/10.1016/S0304-3975(98)00175-3 2003-11-19 Invited Talk: Towards a Principled Multi-Language Infrastructure. 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#Shao01 2003-11-19 Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. 99-117 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Krause96 http://dx.doi.org/10.1016/0304-3975(95)00005-4 2003-11-19 Faster exact solutions for some NP-hard problems. 473-499 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#DroriP02 2003-11-19 Optimal Algorithms for Generalized Searching in Sorted Matrices. 221-230 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Shen97 http://dx.doi.org/10.1016/S0304-3975(97)00027-3 2003-11-19 CGOOD, a Categorical Graph-Oriented Object Data Model. 217-239 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#TuijnG96 http://dx.doi.org/10.1016/0304-3975(95)00089-5 2003-11-19 Mining for empty spaces in large data sets. 435-452 2003 3 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00738-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#EdmondsGLM03 2003-11-19 Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology. 319-341 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#SambinVV96 http://dx.doi.org/10.1016/0304-3975(95)00169-7 2003-11-19 Preface: Orders, Algorithms and Applications. 223 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#BouchitteHM97 http://dx.doi.org/10.1016/S0304-3975(96)00199-5 2003-11-19 The Word Problem for Inverse Monoids Presented by One Idempotent Relator. 273-289 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#BirgetMM94 2003-11-19 Symbolic Representation of Piecewise Linear Functions on the Unit Interval and Application to Discrepancy. 61-87 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Borel94 2006-06-13 On Total Regulators Generated by Derivation Relations. 131-148 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#BucherEH85 2003-11-19 Event Structures and Domains. 37-47 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Droste89 2003-11-19 On Stable Domains. 89-101 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#Droste93 2003-11-19 Recognizable Languages in Concurrency Monoids. 77-109 1995 150 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs150.html#Droste95 http://dx.doi.org/10.1016/0304-3975(94)00266-L 2006-06-13 Context-Free Complexity of Finite Languages. 277-285 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#BucherMC84 2003-11-19 Le Schéma de carte et ses applications. 151-194 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#ArquesB00 http://dx.doi.org/10.1016/S0304-3975(99)00077-8 2003-11-19 Counting rooted maps on a surface. 255-272 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#ArquesG00 http://dx.doi.org/10.1016/S0304-3975(98)00230-8 2003-11-19 A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested Objects in 2.5D Digital Pictures. 211-248 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#ArquesG95 http://dx.doi.org/10.1016/0304-3975(94)00137-8 2003-11-19 Classification des cartes pointées de genre 1 et relation fonctionelle associée. 45-65 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#ArquesJ93 2003-11-19 Integer Summing Algorithms on Reconfigurable Meshes. 57-77 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#NakanoW98 http://dx.doi.org/10.1016/S0304-3975(97)00007-8 2003-11-19 A generalization of the language of ukasiewicz coding rooted planar hypermaps. 221-239 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00217-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#ArquesM03 2003-11-19 Phrase Parsers from Multi-Axiom Grammars. 199-229 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#RusJ98 http://dx.doi.org/10.1016/S0304-3975(97)00273-9 2003-11-19 MGS: a Rule-Based Programming Language for Complex Objects and Collections. 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#GiavittoM01 2003-11-19 Labelled Domains and Automata with Concurrency. 289-318 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#BrachoD94 2003-11-19 Results related to threshold phenomena research in satisfiability: lower bounds. 147-157 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Franco01 http://dx.doi.org/10.1016/S0304-3975(01)00158-X 2003-11-19 Some Decisional Problems on Rational Relations. 1-15 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#MadoniaV97 http://dx.doi.org/10.1016/S0304-3975(96)00098-9 2003-11-19 A theoretical and empirical investigation of search in imperfect information games. 217-256 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#FrankB01 http://dx.doi.org/10.1016/S0304-3975(00)00083-9 2003-11-19 A Contribution to the Theory of Program Testing. 151-181 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Bouge85 2003-11-19 Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP. 145-169 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Bouge87 2003-11-19 On Multiplication in Algebraic Extension Fields. 359-377 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Winograd79 2003-11-19 Peirce's Rule in Natural Deduction. 561-574 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Zimmermann02 http://dx.doi.org/10.1016/S0304-3975(01)00296-1 2003-11-19 On Finite Automaton Public-Key Cryptosystem. 143-172 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#TaoC99 http://dx.doi.org/10.1016/S0304-3975(99)00070-5 2003-11-19 Correctness Proofs of CSP Programs. 131-141 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Soundararajan83 2003-11-19 Denotational Semantics of CSP. 279-304 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Soundararajan84 2003-11-19 Distributed processes and location failures. 693-735 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#RielyH01 http://dx.doi.org/10.1016/S0304-3975(00)00326-1 2003-11-19 Chain Properties in P omega. 153-172 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Tang79 2003-11-19 Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints. 201-220 1996 169 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#CosmoK96 http://dx.doi.org/10.1016/S0304-3975(96)00121-1 2003-11-19 Erratum to "Reducibility classes of P-selective sets". 323 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#HemaspaandraHO00 http://dx.doi.org/10.1016/S0304-3975(99)00298-4 2003-11-19 Reducibility Classes of P-Selective Sets. 447-457 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#HemaspaandraHO96 http://dx.doi.org/10.1016/0304-3975(96)00094-1 2003-11-19 Least adaptive optimal search with unreliable tests. 877-893 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#CicaleseMV02 http://dx.doi.org/10.1016/S0304-3975(01)00116-5 2003-11-19 Algorithms for Plane Representations of Acyclic Digraphs. 175-198 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#BattistaT88 2003-11-19 Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays. 119-127 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#MunierH97 http://dx.doi.org/10.1016/S0304-3975(97)88194-7 2003-11-19 Characterizing the existence of one-way permutations. 257-261 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#HemaspaandraR00a http://dx.doi.org/10.1016/S0304-3975(00)00014-1 2003-11-19 Comparisons between Linear Functions can Help. 321-330 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Snir82 2003-11-19 Lower Bounds on Probabilistic Linear Decision Trees. 69-82 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Snir85 2003-11-19 Size-depth Trade-Offs for Monotone Arithmetic Circuits. 85-93 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Snir91 2003-11-19 On the complexity of multi-dimensional interval routing schemes. 255-280 2000 245 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#RuzickaS00 http://dx.doi.org/10.1016/S0304-3975(99)00284-4 2003-11-19 Sparse and limited wavelength conversion in all-optical tree networks. 887-934 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#AulettaCGKP01 http://dx.doi.org/10.1016/S0304-3975(00)00401-1 2003-11-19 A Calculational Approach to Mathematical Induction. 103-135 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#DoornbosBW97 http://dx.doi.org/10.1016/S0304-3975(96)00154-5 2003-11-19 Counting with range concatenation grammars. 391-416 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Boullier03 2003-11-19 The Smallest Automaton Recognizing the Subwords of a Text. 31-55 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#BlumerBHECS85 2003-11-19 Embedding a Demonic Semilattice in a Relational Algebra. 333-360 1995 149 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#DesharnaisBSTJMZ95 http://dx.doi.org/10.1016/0304-3975(94)00271-J 2003-11-19 Consistent Subsequences and Supersequences. 233-246 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Fraser96 http://dx.doi.org/10.1016/0304-3975(95)00138-7 2003-11-19 Independent Sets Versus Perfect Matchings. 381-390 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Teng95 http://dx.doi.org/10.1016/0304-3975(94)00289-U 2003-11-19 The Multiplicative Complexity of Quadratic Boolean Forms. 307-328 1992 102 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#MirwaldS92 2003-11-19 Encoding Generic Judgments: Preliminary results. 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/tcs58.html#Miller01 2003-11-19 Forum: A Multiple-Conclusion Specification Logic. 201-232 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Miller96 http://dx.doi.org/10.1016/0304-3975(96)00045-X 2003-11-19 Relationships Between the Dynamical Systems Associated to the Rauzy Substitutions. 41-57 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Sirvent96 http://dx.doi.org/10.1016/0304-3975(95)00170-0 2003-11-19 On Some Dynamical Subsets of the Rauzy Fractal. 363-370 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#Sirvent97 http://dx.doi.org/10.1016/S0304-3975(96)00331-3 2003-11-19 Analytic Models and Ambiguity of Context-Free Languages. 283-309 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Flajolet87 2003-11-19 Singularity Analysis and Asymptotics of Bernoulli Sums. 371-381 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Flajolet99 http://dx.doi.org/10.1016/S0304-3975(98)00220-5 2003-11-19 Implementing First-Order Rewriting with Constructor Systems. 83-92 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Thatte88 2003-11-19 Full Abstraction and Limiting Completeness in Equational Languages. 85-119 1989 65 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Thatte89 2003-11-19 Type Inference with Partial Types. 127-148 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Thatte94 2003-11-19 Basic process algebra with deadlocking states. 605-630 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Srba01 http://dx.doi.org/10.1016/S0304-3975(00)00290-5 2003-11-19 A p×p bit fraction model of binary floating point division and extremal rounding cases. 159-182 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#MatulaM03 2003-11-19 A Linear Time Solution to the Single Function Coarsest Partition Problem. 67-84 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#PaigeTB85 2003-11-19 Sur une involution sur les chemins de Dyck. 203-215 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Lalanne93 2003-11-19 Measure and probability for concurrency theorists. 287-309 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#Panangaden01 http://dx.doi.org/10.1016/S0304-3975(00)00096-7 2003-11-19 Observation Equivalence as a Testing Equivalence. 225-241 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Abramsky87 2003-11-19 Computational Interpretations of Linear Logic. 3-57 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#Abramsky93 2003-11-19 Proofs as Processes. 5-9 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#Abramsky94 2003-11-19 Specification of Abstract Dynamic-Data Types: A Temporal Logic Approach. 513-554 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#CostaR97 http://dx.doi.org/10.1016/S0304-3975(96)00165-X 2005-07-22 From Antonio's former students. 186-187 2005 340 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/j.tcs.2005.03.023 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#X05 2003-11-19 <i>lambda</i>-Calculi. 1-22 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Milner77 2003-11-19 Calculi for Synchrony and Asynchrony. 267-310 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Milner83 2003-11-19 Interpreting one Concurrent Calculus in Another. 3-13 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#Milner90 2003-11-19 Programming in Three-valued Logic. 189-216 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#DelahayeT91 2003-11-19 A Complete Axiom System for Rational Sets with Multiplicity. 79-92 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#MorisakiS80 2003-11-19 Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems. 67-100 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#Branicky95 http://dx.doi.org/10.1016/0304-3975(94)00147-B 2003-11-19 On the Approximability of Some Maximum Spanning Tree Problems. 107-118 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#GalbiatiMM97 http://dx.doi.org/10.1016/S0304-3975(96)00265-4 2003-11-19 The Complexity of PDL with Interleaving. 109-122 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#MayerS96 http://dx.doi.org/10.1016/0304-3975(95)00095-X 2003-11-19 Constructions des bases standard des K<A>-modules à droite. 255-272 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Melancon93 2003-11-19 Lyndon Words and Singular Factors of Sturmian Words. 41-59 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Melancon99 http://dx.doi.org/10.1016/S0304-3975(98)00249-7 2006-10-27 Some Decision Problems Related to the Reachability Problem for Petri Nets. 85-104 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#ArakiK76 2003-11-19 Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. 99-119 1977 4 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#ArakiK77 2003-11-19 An axiomatic semantics for Esterel. 231-282 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Tini01 http://dx.doi.org/10.1016/S0304-3975(00)00420-5 2003-11-19 On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. 161-174 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Cerny97 http://dx.doi.org/10.1016/S0304-3975(96)00294-0 2003-11-19 Accumulators: New Logic Variable Abstractions for Functional Languages. 201-221 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#PingaliE91 2003-11-19 The Congruence of two Programming Language Definitons. 151-174 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Stoy81 2003-11-19 A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. 551-573 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#NagayamaO03 2003-11-19 The Expressiveness of a Family of Finite Set Languages. 111-140 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#ImmermanPS96 http://dx.doi.org/10.1016/0304-3975(94)00287-8 2003-11-19 Dynamic location problems with limited look-ahead . 213-226 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#ChungG01 http://dx.doi.org/10.1016/S0304-3975(00)00140-7 2003-11-19 Automaticity II: Descriptional Complexity in the Unary Case. 181-201 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#PomeranceRS97 http://dx.doi.org/10.1016/S0304-3975(96)00189-2 2003-11-19 Model Checking and Boolean Graphs. 3-30 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Andersen94 2003-11-19 A Semi-Algorithm for Algebraic Implementation Proofs. 53-87 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Hennicker92 2003-11-19 On the learnability of recursively enumerable languages from good examples. 3-29 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#JainLN01 http://dx.doi.org/10.1016/S0304-3975(00)00131-6 2003-11-19 Further Results on Digital Search Trees. 143-154 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#KirschenhoferP88 2003-11-19 The intersection of retracts of A*. 439-445 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Anderson00 http://dx.doi.org/10.1016/S0304-3975(99)00323-0 2003-11-19 Semiretracts of a Free Monoid. 3-11 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Anderson94 2003-11-19 Queries with Arithmetical Constraints. 151-181 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#GrumbachS97 http://dx.doi.org/10.1016/S0304-3975(96)00194-6 2003-11-19 On the Expressive Power of Counting. 67-99 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#GrumbachT95 http://dx.doi.org/10.1016/0304-3975(95)00026-S 2003-11-19 Constructing a Realtime Deterministic Pushdown Automaton from a Grammar. 57-69 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#PittlY83 2003-11-19 Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. 263-295 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#GoguenB84a 2003-11-19 Revisiting the PAXOS algorithm. 35-91 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#PriscoLL00 http://dx.doi.org/10.1016/S0304-3975(00)00042-6 2003-11-19 A Universal Formalism to Express Decompositions, Functional Dependencies and Other Constraints in a Relational Database. 143-160 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Paredaens82 2003-11-19 Testing and Reconfiguration of VLSI Linear Arrays. 171-188 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#PriscoMP98 http://dx.doi.org/10.1016/S0304-3975(97)00238-7 2003-11-19 Process Calculus Based Upon Evaluation to Committed Form. 155-182 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#PittsR98 http://dx.doi.org/10.1016/S0304-3975(97)00218-1 2003-11-19 On-line single-server dial-a-ride problems. 91-105 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#FeuersteinS01 http://dx.doi.org/10.1016/S0304-3975(00)00261-9 2003-11-19 Minimal Path Length of Trees with Known Fringe. 175-188 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#PriscoPP95 http://dx.doi.org/10.1016/0304-3975(95)80033-6 2003-11-19 On Infinite Words Obtained by Selective Substitution Grammars. 281-295 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#SiromoneyD85 2003-11-19 On covering radii and coset weight distributions of extremal binary self-dual codes of length 40. 283-308 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Ozeki00 http://dx.doi.org/10.1016/S0304-3975(99)00200-5 2003-11-19 On the covering radius problem for ternary self-dual codes. 311-332 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Ozeki01 http://dx.doi.org/10.1016/S0304-3975(00)00252-8 2003-11-19 Graph colourings and partitions. 59-74 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Yegnanarayanan01 http://dx.doi.org/10.1016/S0304-3975(00)00231-0 2003-11-19 On Greibach Normal Form Construction. 315-317 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Urbanek85 2003-11-19 On Greibach Normal Form Construction. 229-236 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Urbanek86 2003-11-19 A Note on the Existence of Continuous Functionals. 231-235 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#CarterF81 2003-11-19 Abstract Language Design. 5-26 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Bradley90 2003-11-19 ILX: Extending the .NET Common IL for Functional Language Interoperability. 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#Syme01 2003-11-19 A Pragmatic Approach to Reuse in Tactical Theorem Proving. 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#SchairerAH01 2003-11-19 Positive Relativizations for Log Space Computability. 221-235 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Toda90 2003-11-19 Restricted Relativizations of Probablistic Polynomial Time. 265-277 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Toda92 2003-11-19 Probabilistic Termination Versus Fair Termination. 333-340 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Tiomkin89 2006-06-13 On Form-Equivalence of Deterministic pure Grammar Forms. 69-87 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Hagauer82 2003-11-19 Strip tiling and regular grammars. 109-124 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#MerliniSV00 http://dx.doi.org/10.1016/S0304-3975(98)00204-7 2003-11-19 A strip-like tiling algorithm. 337-352 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#MerliniSV02 http://dx.doi.org/10.1016/S0304-3975(01)00074-3 2003-11-19 Discrete-Time Control for Rectangular Hybrid Automata. 369-392 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#HenzingerK99 http://dx.doi.org/10.1016/S0304-3975(99)00038-9 2003-11-19 Basic analytic combinatorics of directed lattice paths. 37-80 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#BanderierF02 http://dx.doi.org/10.1016/S0304-3975(02)00007-5 2003-11-19 A Classification of omega-Regular Languages. 217-229 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Kaminski85 2003-11-19 Linearity Analysis of Concurrent 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#Ueda99 2003-11-19 Petri Nets and Bisimulation. 211-244 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#NielsenW96 http://dx.doi.org/10.1016/0304-3975(95)00122-0 2003-11-19 Approximate Testing and Its Relationship to Learning. 79-99 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Romanik97 http://dx.doi.org/10.1016/S0304-3975(96)00241-1 2003-11-19 Some Natural Properties of Strong-Identification in Inductive Inference. 345-360 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Minicozzi76 2003-11-19 On Direct Products of Automaton Decidable Theories. 331-335 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Hodgson82 2003-11-19 Abstract Interpretation based Verification of Logic Programs. 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#CominiGLV99 2003-11-19 An Algorithm for Generating Shift-Register Cycles. 209-224 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Etzion86 2003-11-19 A Brief History of Timed CSP. 243-271 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#DaviesS95 http://dx.doi.org/10.1016/0304-3975(94)00169-J 2003-11-19 An approach to strategies in concurrent systems. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#DaviesW00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 The Structure of Logarithmic Advice Complexity Classes. 217-244 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#BalcazarH98 http://dx.doi.org/10.1016/S0304-3975(98)00066-8 2003-11-19 Approximate Inference of Functional Dependencies from Relations. 129-149 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#KivinenM95 http://dx.doi.org/10.1016/0304-3975(95)00028-U 2003-11-19 Logarithmic Advice Classes. 279-290 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#BalcazarS92 2003-11-19 Models for Concurrency: Towards a Classification. 297-348 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#SassoneNW96 http://dx.doi.org/10.1016/S0304-3975(96)80710-9 2003-11-19 Computation, on Macsyma, of the Minimal Differential Representation of Noncommutative Polynomials. 195-207 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Oussous91 2003-11-19 Complexity of Normal Form Grammars. 299-314 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Kelemenova84 2003-11-19 Parallel communicating limited and uniformly limited 0L systems. 163-191 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Watjen01 http://dx.doi.org/10.1016/S0304-3975(99)00162-0 2003-11-19 Function-dependent teams in eco-grammar systems. 39-53 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00208-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Watjen03 2003-11-19 Divergence in testing and readiness semantics. 237-248 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#BorealeNP01 http://dx.doi.org/10.1016/S0304-3975(00)00170-5 2003-11-19 Towards a Proof Theory of Rewriting: The Simply Typed 2lambda-Calculus. 407-444 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Hilken96 http://dx.doi.org/10.1016/S0304-3975(96)80713-4 2003-11-19 Transformations of CLP Modules. 101-146 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#EtalleG96 http://dx.doi.org/10.1016/0304-3975(95)00148-4 2003-11-19 Preface - Workshop on Verification of Logic Programs. 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#EtalleS99 2003-11-19 Concerning the Semantic Consequence Relation in First-Order Temporal Logic. 329-334 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Szalas86 2003-11-19 A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. 199-214 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Szalas87 2003-11-19 On Strictly Arithmetical Completeness in Logics of Programs. 341-355 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Szalas91 2003-11-19 Functorial semantics for Petri nets under the individual token philosophy. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#BruniMMS99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Dynamic Dictionary Matching with Failure Functions. 295-310 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#IduryS94 2003-11-19 Multiple Matching of Parametrized Patterns. 203-224 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#IduryS96 http://dx.doi.org/10.1016/0304-3975(94)00270-3 2003-11-19 Reachability and the Power of Local Ordering. 261-279 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#EtessamiI95 http://dx.doi.org/10.1016/0304-3975(95)00034-T 2003-11-19 Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly. 411-419 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Slobodova92 2003-11-19 Determining presentations of sofic shifts. 199-216 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Trow01 http://dx.doi.org/10.1016/S0304-3975(99)00336-9 2003-11-19 Generalized Semigroup Semirings Which Are Zero-Divisor-Free Or Multiplicatively Left-Cancellative. 269-289 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#HebischW92 2003-11-19 Group Presentations, Formal Languages and Characterizations of One-Counter Groups. 187-213 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#HerbstT93 2003-11-19 Optimal three-dimensional layout of interconnection networks. 263-279 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#CalamoneriM01 http://dx.doi.org/10.1016/S0304-3975(99)00287-X 2003-11-19 Nonterminal complexity of programmed grammars. 225-251 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00656-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Fernau03a 2003-11-19 On the degree of scattered context-sensitivity. 2121-2124 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#FernauM03 2003-11-19 Sequential grammars and automata with valences. 377-405 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#FernauS02 http://dx.doi.org/10.1016/S0304-3975(01)00282-1 2003-11-19 Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. 35-55 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#FernauW98 http://dx.doi.org/10.1016/S0304-3975(96)00329-5 2003-11-19 Can large fanin circuits perform reliable computations in the presence of faults? 319-335 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#Reischuk00 http://dx.doi.org/10.1016/S0304-3975(99)00237-6 2003-11-19 A Fast Implementation of a Multidimensional Storage Into a Tree Storage. 253-266 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Reischuk82 2003-11-19 The Kolmogorov complexity of real numbers. 455-466 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Staiger02 http://dx.doi.org/10.1016/S0304-3975(01)00102-5 2003-11-19 Projection Lemmas for omega-Languages. 331-337 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Staiger84 2003-11-19 Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). 279-282 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Staiger88 2003-11-19 On the Centers of a Language. 21-34 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#LucaRS83 2003-11-19 Fast Algorithms for the Characteristic Polynomial. 309-317 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Keller-Gehrig85 2003-11-19 Combinatorial constructions associated to the dynamics of one-sided cellular automata. 485-497 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00290-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#DartnellMS03 2003-11-19 Varieties of Finite Monoids and Buchi-McNaughton Theorem. 321-337 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#VanH92 2003-11-19 Infinite Behaviour of Petri Nets. 311-341 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Valk83 2003-11-19 A Finiteness Condition for Rewriting Systems. 271-294 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#SquierOK94 2003-11-19 Finite nondeterministic automata: Simulation and minimality. 219-235 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#CaludeCK00 http://dx.doi.org/10.1016/S0304-3975(98)00221-7 2003-11-19 Unambiguous Büchi automata. 37-81 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00618-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#CartonM03 2003-11-19 Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs. 85-128 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#GabbrielliL92 2003-11-19 Jeux de Mots dans les Algèbres de Lie Libres: Quelques Bases et Formules. 241-256 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Koseleff91 2003-11-19 Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable. 343-347 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Nemeti82 2003-11-19 Relaxed models for rewriting logic. 265-289 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Lucanu03 2003-11-19 On the Desirability of gamma-Acyclic BCNF Database Schemes. 67-104 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#ChanH88 2003-11-19 On the Finite-Valuedness Problem for Sequential Machines. 95-101 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#ChanI83 2003-11-19 Two-Level Semantics and Code Generation. 59-133 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#NielsonN88 2003-11-19 Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic. 99-126 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#NielsonN90 2003-11-19 From CML to its Process Algebra. 179-219 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#NielsonN96 http://dx.doi.org/10.1016/0304-3975(95)00017-8 2003-11-19 Two Linear Time Union-Find Strategies for Image Processing. 165-181 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#FiorioG96 http://dx.doi.org/10.1016/0304-3975(94)00262-2 2003-11-19 Truly concurrent constraint programming. 223-255 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#GuptaJS02 http://dx.doi.org/10.1016/S0304-3975(00)00337-6 2003-11-19 A Parsing Automata Approach to LR Theory. 117-157 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Heilbrunner81 2003-11-19 A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages. 49-68 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Heilbrunner83 2003-11-19 On Weakly Confluent Monadic String-Rewriting Systems. 119-165 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#MadlenerNOZ93 2003-11-19 Quasi-Deterministic 0L Systems and Their Representation. 87-116 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#Nishida95 http://dx.doi.org/10.1016/0304-3975(94)00250-M 2003-11-19 Algorithms, nymphs, and shepherds. 223-229 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Luccio02 http://dx.doi.org/10.1016/S0304-3975(01)00053-6 2003-11-19 Random 2-SAT: results and problems. 131-146 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Vega01 http://dx.doi.org/10.1016/S0304-3975(01)00156-6 2003-11-19 A new regular grammar pattern matching algorithm. 509-521 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00532-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Watson03 2003-11-19 Abduction from Logic Programs: Semantics and Complexity. 129-177 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#EiterGL97 http://dx.doi.org/10.1016/S0304-3975(96)00179-X 2003-11-19 Decision lists and related Boolean functions. 493-524 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#EiterIM02 http://dx.doi.org/10.1016/S0304-3975(01)00003-2 2003-11-19 Classification of Finite Monoids: The Language Approach. 195-208 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Therien81 2003-11-19 Programs over Aperiodic Monoids. 271-280 1989 64 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Therien89 2003-11-19 Unification of Infinite Sets of Terms Schematized by Primal Grammars. 111-158 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#HermannG97 http://dx.doi.org/10.1016/S0304-3975(96)00052-7 2003-11-19 Iterative Algebras. 67-94 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Nelson83 2003-11-19 Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. 181-218 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#EiterLS98 http://dx.doi.org/10.1016/S0304-3975(97)00129-1 2003-11-19 On Mixed Connectivity Certificates. 253-269 1998 203 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#EvenIR98 http://dx.doi.org/10.1016/S0304-3975(98)00023-1 2003-11-19 Logical optimality of groundness analysis. 149-184 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#Scozzari02 http://dx.doi.org/10.1016/S0304-3975(00)00316-9 2003-11-19 Concerning Bounded-Right-Context Grammars. 273-282 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Szymanski76 2003-11-19 On the Complexity of Algorithms on Recursive Trees. 355-361 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Szymanski90 2003-11-19 On the Structure of Free Finite State Machines. 167-180 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Beynon80 2003-11-19 Comparison of Two Graph-Rewrite Systems. 67-81 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Broek88 2003-11-19 A Minimal Code List. 345-348 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#FischerF99 http://dx.doi.org/10.1016/S0304-3975(98)00183-2 2003-11-19 Interpreting Abstract Interpretations in Membership Equational Logic. 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#FischerR01 2003-11-19 On a Family of L Languages Resulting from Systolic Tree Automata. 231-242 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#CulikGS83 2003-11-19 A selected tour of the theory of identification matrices. 299-318 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#Chen00a http://dx.doi.org/10.1016/S0304-3975(99)00236-4 2003-11-19 A fixpoint theory for non-monotonic parallelism. 367-392 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00893-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#Chen03a 2003-11-19 Improved fault-tolerant sorting algorithm in hypercubes. 649-658 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ChenC01 http://dx.doi.org/10.1016/S0304-3975(00)00390-X 2003-11-19 Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures. 667-677 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#ChenC03 2003-11-19 Relational Graph Rewritings. 311-328 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#MizoguchiK95 http://dx.doi.org/10.1016/0304-3975(94)00076-U 2003-11-19 Learning Counting Functions with Queries. 155-168 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#ChenH97 http://dx.doi.org/10.1016/S0304-3975(96)00144-2 2003-11-19 The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. 95-121 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#ChenL94 2003-11-19 Algebraic characterizations of trace and decorated trace equivalences over tree-like structures. 337-361 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#ChenN01 http://dx.doi.org/10.1016/S0304-3975(99)00300-X 2003-11-19 An Optimistic Ternary Simulation of Gate Races. 49-66 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#SegerB88 2003-11-19 Disproving a conjecture on planar visibility graphs. 659-665 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ChenW01 http://dx.doi.org/10.1016/S0304-3975(00)00391-1 2003-11-19 A PTAS for weight constrained Steiner trees in series-parallel graphs. 237-247 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00088-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#ChenX03 2003-11-19 The Steiner tree problem for terminals on the boundary of a rectilinear polygon. 213-238 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Cheng00 http://dx.doi.org/10.1016/S0304-3975(98)00171-6 2003-11-19 Petri Nets, Traces, and Local Model Checking. 229-251 1997 183 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Cheng97 http://dx.doi.org/10.1016/S0304-3975(96)00326-X 2003-11-19 Two-Dimensional Pattern Matching by Two-Dimensional on-Line Tessellation Acceptors. 179-194 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#TodaIT83 2003-11-19 On Two-Symbol Complete E0L Forms. 69-92 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#CulikMO78 2003-11-19 On the Pre-AFL of [log n] Space and Related Families of Languages. 295-304 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Springsteel76 2003-11-19 Two Finite Specifications of a Queue. 487-507 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#BezemP97 http://dx.doi.org/10.1016/S0304-3975(96)00257-5 2003-11-19 Diagonalizations over Polynomial Time Computable Sets. 177-204 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Ambos-SpiesFH87 2003-11-19 Secure distributed storage and retrieval. 363-389 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#GarayGJR00 http://dx.doi.org/10.1016/S0304-3975(98)00263-1 2003-11-19 An Efficient Null-Free Procedure for Deciding Regular Language Membership. 89-101 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Ponty00 http://dx.doi.org/10.1016/S0304-3975(99)00019-5 2003-11-19 The algebra of stream processing functions. 99-129 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#BroyS01 http://dx.doi.org/10.1016/S0304-3975(99)00322-9 2003-11-19 Applications of standard Sturmian words to elementary number theory. 5-9 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Brown02 http://dx.doi.org/10.1016/S0304-3975(00)00430-8 2003-11-19 The Shortest Common Nonsubsequence Problem is NP-Complete. 365-369 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Middendorf93 2003-11-19 Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. 47-103 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#Cousot02 http://dx.doi.org/10.1016/S0304-3975(00)00313-3 2003-11-19 More on the Complexity of Common Superstring and Supersequence Problems. 205-228 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Middendorf94 2003-11-19 On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet. 317-327 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Middendorf95 http://dx.doi.org/10.1016/0304-3975(95)00014-N 2003-11-19 Two-Dimensional Partitioning Problems. 73-106 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Middendorf96 http://dx.doi.org/10.1016/0304-3975(95)00185-9 2003-11-19 Shortest Common Superstrings and Scheduling with Coordinated Starting Times. 205-214 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Middendorf98 http://dx.doi.org/10.1016/S0304-3975(97)00133-3 2003-11-19 Minimal Pairs and Complete Problems. 229-241 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Ambos-SpiesHS94 2003-11-19 Genericity and Measure for Exponential Time. 3-19 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Ambos-SpiesNT96 http://dx.doi.org/10.1016/0304-3975(96)89424-2 2003-11-19 Comparator networks for binary heap construction. 235-245 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#BrodalP01 http://dx.doi.org/10.1016/S0304-3975(99)00137-1 2003-11-19 Parallel Turing Machines with One-Head Control Units and Cellular Automata. 3-30 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Worsch99 http://dx.doi.org/10.1016/S0304-3975(98)00148-0 2003-11-19 Resource Bounded Randomness and Weakly Complete Problems. 195-207 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Ambos-SpiesTZ97 http://dx.doi.org/10.1016/S0304-3975(95)00260-X 2003-11-19 The approximate period problem for DNA alphabet. 443-447 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00211-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Popov03 2003-11-19 Recognizable Picture Languages and Domino Tiling. 275-283 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#LatteuxS97 http://dx.doi.org/10.1016/S0304-3975(96)00283-6 2003-11-19 Two Characterizations of Rational Adherences. 101-106 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#LatteuxT86 2003-11-19 Mellin Transforms and Asymptotics: Digital Sums. 291-314 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#FlajoletGKPT94 2003-11-19 Exact Performance Equivalence: An Equivalence Relation for Stochastic Automata. 263-287 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Buchholz99 http://dx.doi.org/10.1016/S0304-3975(98)00169-8 2003-11-19 Equational rules for rewriting logic. 487-517 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Viry02 http://dx.doi.org/10.1016/S0304-3975(01)00366-8 2003-11-19 Broadcast authentication for group communication. 1-21 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Safavi-NainiW01 http://dx.doi.org/10.1016/S0304-3975(00)00184-5 2003-11-19 Metric semantics for true concurrent real time. 501-542 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#KatoenBL01 http://dx.doi.org/10.1016/S0304-3975(99)00342-4 2003-11-19 Data Representation and Computational Complexity. 99-116 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#VerbeekW78 2003-11-19 Strictness, totality, and non-standard-type inference. 69-112 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#CoppoDG02 http://dx.doi.org/10.1016/S0304-3975(00)00348-0 2003-11-19 Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. 135-183 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#Zielonka98 http://dx.doi.org/10.1016/S0304-3975(98)00009-7 2003-11-19 Hierarchies of probabilistic and team FIN-learning. 91-117 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#AmbainisAFS01 http://dx.doi.org/10.1016/S0304-3975(00)00135-3 2003-11-19 Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs. 193-201 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Wan98a http://dx.doi.org/10.1016/S0304-3975(98)00064-4 2003-11-19 Algorithms for computing lengths of chains in integral partition lattices. 783-800 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#WanW02 2003-11-19 Fixed-Point Constructions in Order-Enriched Categories. 13-30 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Wand79 2003-11-19 Specifications, Models, and Implementations of Data Abstractions. 3-32 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#Wand82 2003-11-19 Resource bounded randomness and computational complexity. 33-55 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Wang00 http://dx.doi.org/10.1016/S0304-3975(98)00119-4 2003-11-19 A comparison of two approaches to pseudorandomness. 449-459 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Wang02 http://dx.doi.org/10.1016/S0304-3975(01)00311-5 2003-11-19 Preface. 1-2 2003 296 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Wang03 2003-11-19 On p-Creative Sets and p-Completely Creative Sets. 1-31 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Wang91 2003-11-19 On Characterizing Boundedness of Database Schemes with Bounded Dependencies. 347-364 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Wang92 2003-11-19 A Temporal Logic for Real-Time Partial Ordering with Named Transactions. 195-225 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Wang97 http://dx.doi.org/10.1016/S0304-3975(96)00270-8 2003-11-19 Finite Derivation Type for Semi-Direct Products of Monoids. 219-228 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Wang98 http://dx.doi.org/10.1016/S0304-3975(97)00164-3 2003-11-19 A representation of stably compact spaces, and patch topology. 77-84 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00695-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#CoquandZ03 2003-11-19 Symbolic model checking for µ-calculus requires exponential time. 467-475 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Rabinovich00a http://dx.doi.org/10.1016/S0304-3975(00)00033-5 2003-11-19 Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions. 199-219 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Fischlin01 http://dx.doi.org/10.1016/S0304-3975(00)00271-1 2003-11-19 Learning Deterministic even Linear Languages From Positive Examples. 63-79 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#KoshibaMT97 http://dx.doi.org/10.1016/S0304-3975(97)00016-9 2003-11-19 Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra. 203-216 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#DemelDK85 2003-11-19 Noninterference for concurrent programs and thread systems. 109-130 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#BoudolC02 http://dx.doi.org/10.1016/S0304-3975(02)00010-5 2003-11-19 Concurrency and Atomicity. 25-84 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#BoudolC88 2003-11-19 Recursion Induction Principle Revisited. 135-173 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#BoudolK83 2003-11-19 Graphical Versus Logical Specifications. 3-20 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#BoudolL92 2003-11-19 Remarks on an Example of Jantzen. 277-284 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Potts84 2003-11-19 Towards the Mathematics Software Bus. 221-230 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#CalmetH97 http://dx.doi.org/10.1016/S0304-3975(97)00066-2 2003-11-19 Completeness, minimal logic and programs extraction. 259-271 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Raffalli01 http://dx.doi.org/10.1016/S0304-3975(99)00141-3 2003-11-19 Topological properties of real number representations. 241-257 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#BrattkaH02 http://dx.doi.org/10.1016/S0304-3975(01)00066-4 2003-11-19 Computability on subsets of metric spaces. 43-76 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00693-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#BrattkaP03 2003-11-19 Decomposable multi-parameter matroid optimization problems. 183-198 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00638-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Fernandez-Baca03 2003-11-19 Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. 65-93 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#BrattkaW99 http://dx.doi.org/10.1016/S0304-3975(98)00284-9 2003-11-19 On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication. 127-148 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Groote78a 2003-11-19 On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. III. Optimal Algorithms for the Computation of xy and xy where x, y in M2(K). 239-249 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Groote78b 2003-11-19 Correctness of Constructing Optimal Alphabetic Trees Revisited. 309-324 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#KarpinskiLR97 http://dx.doi.org/10.1016/S0304-3975(96)00296-4 2003-11-19 Confluence for Process Verification. 47-81 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#GrooteS96 http://dx.doi.org/10.1016/S0304-3975(96)80702-X 2003-11-19 The parallel composition of uniform processes with data. 631-652 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#GrooteW01 http://dx.doi.org/10.1016/S0304-3975(00)00324-8 2003-11-19 A typed context calculus. 249-272 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#HashimotoO01 http://dx.doi.org/10.1016/S0304-3975(00)00174-2 2003-11-19 Zero testing of p-adic and modular polynomials. 309-317 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#KarpinskiPS00 http://dx.doi.org/10.1016/S0304-3975(99)00133-4 2003-11-19 Premonoidal categories as categories with algebraic structure. 303-321 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Power02 http://dx.doi.org/10.1016/S0304-3975(00)00340-6 2003-11-19 Random Heuristic Search. 103-142 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#Vose99 http://dx.doi.org/10.1016/S0304-3975(99)00120-6 2003-11-19 Enumeration of Polyominoes Using Macsyma. 209-226 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Delest91 2003-11-19 Higher-dimensional syntax. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Wehr99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Inverse Monoids of Dot-Depth Two. 233-245 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Weil89 2003-11-19 Products of Languages with Counter. 251-260 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Weil90 2003-11-19 A Geometric Hierarchy Beyond Context-Free Languages. 235-261 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Weir92 2003-11-19 Probability theory for the Brier game. 57-79 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Vovk01 http://dx.doi.org/10.1016/S0304-3975(00)00133-X 2003-11-19 Some Studies on the (p, q)-Type Sequences. 373-393 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#WenW92 2003-11-19 Using Theory Interpretation to Mechanise the Reals in a Theorem Prover. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#ShieldHC01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. 161-197 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#JacquetS95 http://dx.doi.org/10.1016/0304-3975(94)00298-W 2003-11-19 Analytical Depoissonization and its Applications. 1-62 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#JacquetS98 http://dx.doi.org/10.1016/S0304-3975(97)00167-9 2003-11-19 Enumeration of Generalized Young Tableaux With Bounded Height. 137-151 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#ChoiG93 2003-11-19 One-Step Recurrent Terms in lambda-beta-Calculus. 223-231 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#SekimotoH88 2005-04-12 Classifying Molecular Sequences Using a Linkage Graph With Their Pairwise Similarities. 305-325 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#MatsudaIH99 http://dx.doi.org/10.1016/S0304-3975(98)00091-7 2003-11-19 Sorting Twice Through a Stack. 303-313 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#West93 2003-11-19 A Probabilistic View of Datalog Parallelization. 211-239 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#LifschitzV98 http://dx.doi.org/10.1016/S0304-3975(97)00091-1 2003-11-19 An Introduction to Pseudo-Linear Algebra. 3-33 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#BronsteinP96 http://dx.doi.org/10.1016/0304-3975(95)00173-5 2003-11-19 A Relation Algebraic Model of Robust Correctness. 245-270 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#GritznerB96 http://dx.doi.org/10.1016/0304-3975(96)88664-6 2006-01-24 Formal Specification of Parallel SIMD Execution. 39-65 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#FarrellK96 http://dx.doi.org/10.1016/S0304-3975(96)00113-2 2003-11-19 Discrete time generative-reactive probabilistic processes with different advancing speeds. 355-406 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BravettiA03 2003-11-19 The theory of interactive generalized semi-Markov processes. 5-32 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#BravettiG02 http://dx.doi.org/10.1016/S0304-3975(01)00043-3 2003-11-19 Snakes in Domineering Games. 323-329 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Wolfe93 2003-11-19 On Finding Primitive Roots in Finite Fields. 273-275 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Shparlinski96 http://dx.doi.org/10.1016/0304-3975(95)00164-6 2003-11-19 On-line scheduling of parallel jobs with runtime restrictions. 67-90 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#BischofM01 http://dx.doi.org/10.1016/S0304-3975(00)00260-7 2003-11-19 Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. 67-99 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#DrmotaS95 http://dx.doi.org/10.1016/0304-3975(94)00294-S 2003-11-19 Lattice Boltzmann Computations and Applications to Physics. 115-130 1999 217 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#ChopardL99 http://dx.doi.org/10.1016/S0304-3975(98)00153-4 2003-11-19 A Unified Theory of Interconnection Network Structure. 75-94 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#KruskalS86 2003-11-19 Context-Specific Synchronization for Atomic Data Types in Object-Based Databases. 179-199 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#WongA95 http://dx.doi.org/10.1016/0304-3975(95)00030-Z 2003-11-19 Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression. 99-102 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Karpinski82 2003-11-19 Idempotent and co-idempotent stack filters and min-max operators. 603-631 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00540-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Wild03 2003-11-19 Récents développements et problèmes dans le domaine de la génération aléatoire. 5-13 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Wilf96 http://dx.doi.org/10.1016/0304-3975(95)00197-2 2003-11-19 Determinism and Non-determinism in PDL. 189-202 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Wilm91 2003-11-19 Object-Oriented Style Overloading for Haskell. 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#ShieldsJ01 2003-11-19 A Strong Pumping Lemma for Context-Free Languages. 359-369 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Wise76 2003-11-19 Semantics of Infinite Tree Logic Programming. 141-158 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#JaffarS86 2003-11-19 A Logic for Rough Sets. 427-436 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#Duntsch97 http://dx.doi.org/10.1016/S0304-3975(96)00334-9 2003-11-19 Formal Languages Defined by Uniform Substitutions. 243-258 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#BirgetS94 2003-11-19 Unbordered Factors of Characteristic Sequences of Irrational Numbers. 337-344 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Chuan98 http://dx.doi.org/10.1016/S0304-3975(98)00104-2 2003-11-19 Sturmian Morphisms and alpha-Words. 129-148 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#Chuan99 http://dx.doi.org/10.1016/S0304-3975(97)00239-9 2003-11-19 On temporal logic versus datalog. 103-133 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00447-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#GuessarianFAA03 2003-11-19 An Improved Algorithm for Solving the Banded Cyclic String-to-String Correction Problem. 275-279 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Chung98 http://dx.doi.org/10.1016/S0304-3975(97)00280-6 2003-11-19 Normal forms for algebras of connection. 247-292 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#BruniGM02 2003-11-19 Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. 175-209 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#GoguenB84 2003-11-19 A hidden agenda. 55-101 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#GoguenM00 http://dx.doi.org/10.1016/S0304-3975(99)00275-3 2003-11-19 Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. 217-273 1992 105 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#GoguenM92 2003-11-19 Fast stabbing of boxes in high dimensions. 53-72 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Nielsen00 http://dx.doi.org/10.1016/S0304-3975(98)00336-3 2003-11-19 On point covers of c-oriented polygons. 17-29 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Nielsen01 http://dx.doi.org/10.1016/S0304-3975(00)00227-9 2003-11-19 Some Congruence Properties for Pi-Calculus Bisimilarities. 159-176 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#BorealeS98 http://dx.doi.org/10.1016/S0304-3975(97)00125-4 2003-11-19 A complexity analysis of bisimilarity for value-passing processes. 313-345 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#BorealeT00 http://dx.doi.org/10.1016/S0304-3975(98)00177-7 2003-11-19 On Total Functions, Existence Theorems and Computational Complexity. 317-324 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#MegiddoP91 2006-04-18 An analysis of the LPT algorithm for the max-min and the min-ratio partition problems. 407-419 2005 349 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/j.tcs.2005.08.032 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Wu05 2003-11-19 On Finding a Minimum Dominating Set in a Tournament. 307-316 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#MegiddoV88 2003-11-19 Two-Level Semantics and Abstract Interpretation. 117-242 1989 69 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#Nielson89 2003-11-19 G-Networks with Multiple Classes of Negative and Positive Customers. 141-156 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#FourneauGS96 http://dx.doi.org/10.1016/0304-3975(95)00018-6 2003-11-19 Unique existence, approximate solutions, and countable choice. 433-455 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00707-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Schuster03 2003-11-19 The Interchange or Pump (Di)Lemmas for Context-Free Languages. 321-338 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#BoonyavatanaS88 2003-11-19 Quantum communication and complexity. 337-353 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Wolf02 2003-11-19 Nondeterministic Circuits, Space Complexity and Quasigroups. 295-313 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Wolf94 2003-11-19 Optimal Path Cover Problem on Block Graphs. 163-169 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#Wong99 http://dx.doi.org/10.1016/S0304-3975(98)00180-7 2003-11-19 Optimal three-dimensional orthogonal graph drawing in the general position model. 151-178 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00044-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Wood03 2003-11-19 Convexity and global optimization: a theoretical link. 191-204 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Quilliot01 http://dx.doi.org/10.1016/S0304-3975(00)00241-3 2003-11-19 Modal Resolution in Clausal Form. 1-33 1989 65 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#EnjalbertC89 2003-11-19 Probabilistic Communicating Processes. 219-249 1995 152 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#Seidel95 http://dx.doi.org/10.1016/0304-3975(94)00286-0 2003-11-19 Preemptive multiprocessor scheduling with rejection. 437-458 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Seiden01 http://dx.doi.org/10.1016/S0304-3975(00)00288-7 2003-11-19 A manifesto for the computational method. 381-395 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Seiden02 http://dx.doi.org/10.1016/S0304-3975(01)00078-0 2003-11-19 ₂n + O(1) Steps on Average: A Simple Analysis. 245-248 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#BeigelGLZ98 http://dx.doi.org/10.1016/S0304-3975(97)00181-3 2003-11-19 On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals. 323-330 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Jiang90 2003-11-19 Cook's versus Valiant's hypothesis. 71-88 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Burgisser00 http://dx.doi.org/10.1016/S0304-3975(99)00183-8 2003-11-19 NP is as Easy as Detecting Unique Solutions. 85-93 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#ValiantV86 2003-11-19 Chu spaces as a semantic bridge between linear logic and mathematics. 439-471 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Pratt03 2003-11-19 Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". 997-998 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Spreen01a http://dx.doi.org/10.1016/S0304-3975(01)00160-8 2003-11-19 Unification in Free Distributive Lattices. 237-257 1994 126 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#GerhardP94 2003-11-19 On the Complexity of Partially Observed Markov Decision Processes. 161-183 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#BuragoRS96 http://dx.doi.org/10.1016/0304-3975(95)00158-1 2003-11-19 Recognizing Median Graphs in Subquadratic Time. 123-136 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#HagauerIK99 http://dx.doi.org/10.1016/S0304-3975(97)00136-9 2003-11-19 On the Space Complexity of Some Algorithms for Sequence Comparison. 231-244 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#RabaniG92 2003-11-19 What are weak arithmetics? 17-29 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Richard01 http://dx.doi.org/10.1016/S0304-3975(00)00107-9 2003-11-19 Composition and Behaviors of Probabilistic I/O Automata. 1-38 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#WuSS97 http://dx.doi.org/10.1016/S0304-3975(97)00056-X 2003-11-19 Real Functions and Numbers Defined by Turing Machines. 287-304 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Freund83 2003-11-19 Deterministic summation modulo B_n, the Semigroup of Binary Relations on {0, 1, ..., n-1}. 135-174 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Handley97 http://dx.doi.org/10.1016/S0304-3975(95)00245-6 2003-11-19 The Absence and the Presence of Fixed Point Combinators. 221-228 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#McCuneW91 2003-11-19 A General Theory of Sharing Graphs. 99-151 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Guerrini99 http://dx.doi.org/10.1016/S0304-3975(99)00050-X 2003-11-19 NP != co-NP and Models of Arithmetic. 55-67 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#Sureson95 http://dx.doi.org/10.1016/0304-3975(94)00234-A 2003-11-19 P, NP, Co-NP and Weak Systems of Arithmetic. 145-163 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#Sureson96 http://dx.doi.org/10.1016/0304-3975(95)00099-2 2003-11-19 Direct and indirect algorithms for on-line learning of disjunctions. 109-142 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#HelmboldPW02 http://dx.doi.org/10.1016/S0304-3975(01)00081-0 2003-11-19 Semantics for Logic Programs Without Occur Check. 155-174 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Weijland90 2003-11-19 McNaughton families of languages. 1581-1628 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BeaudryHNO03 2003-11-19 An O(mn) Algorithm for Regular Set-Covering Problems. 237-247 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#BertolazziS87 2003-11-19 Termination and Completion Modulo Associativity, Commutativity and Identity. 29-51 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#JouannaudM92 2003-11-19 Abstract Data Type Systems. 349-391 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#JouannaudO97 http://dx.doi.org/10.1016/S0304-3975(96)00161-2 2003-11-19 Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering. 33-58 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#JouannaudR98 http://dx.doi.org/10.1016/S0304-3975(98)00078-4 2005-07-20 Bireflectivity. 49-76 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#Freyd99a http://dx.doi.org/10.1016/S0304-3975(98)00354-5 2003-11-19 Generative power of three-nonterminal scattered context grammars. 279-284 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Meduna00a http://dx.doi.org/10.1016/S0304-3975(00)00153-5 2003-11-19 Forbidding ET0L grammars. 449-469 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00322-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#MedunaS03 2006-06-13 A Note on a Problem in the Theory of Grammatical Complexity. 337-344 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Bucher81 2003-11-19 Modal Logics for Mobile Processes. 149-171 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#MilnerPW93 2005-11-02 Right and left locally testable languages. 253-264 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#GarciaR00 http://dx.doi.org/10.1016/S0304-3975(99)00108-5 2003-11-19 Algorithme Explicite pour la Recherche du P.G.C.D. dans certains Anneaux Principaux d'Entiers de Corps de Nombres. 207-220 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Bougaut80 2003-11-19 Dynamic Reachability in Planar Digraphs with One Source and One Sink. 331-343 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#TamassiaT93 2003-11-19 Random lattices, threshold phenomena and efficient reduction algorithms. 359-385 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Akhavi02 2003-11-19 The optimal LLL algorithm is still polynomial in fixed dimension. 3-23 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00616-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Akhavi03 2003-11-19 Splicing in abstract families of languages. 135-166 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#Pixton00 http://dx.doi.org/10.1016/S0304-3975(98)00046-2 2003-11-19 Program Synthesis Using Realizability. 309-353 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Tatsuta91 2003-11-19 Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams. 119-136 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#Tatsuta94 2003-11-19 Nonprimitive recursive complexity and undecidability for Petri net equivalences. 23-30 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#Jancar01 http://dx.doi.org/10.1016/S0304-3975(00)00100-6 2003-11-19 Decidability of a Temporal Logic Problem for Petri Nets. 71-93 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Jancar90 2003-11-19 Undecidability of Bisimilarity for Petri Nets and Some Related Problems. 281-301 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Jancar95 http://dx.doi.org/10.1016/0304-3975(95)00037-W 2003-11-19 Switching Functions Whose Monotone Complexity is Nearly Quadratic. 83-97 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Wegener79 2003-11-19 Boolean Functions whose Monotone Complexity is of Size n2/log n. 213-224 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Wegener82 2003-11-19 On the Complexity of Slice Functions. 55-68 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Wegener85 2003-11-19 More on the Complexity of Slice Functions. 201-211 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Wegener86 2003-11-19 The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. 155-170 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Wegener91 2003-11-19 BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). 81-98 1993 118 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Wegener93 2003-11-19 Testing Approximate Symmetry in the Plane is NP-Hard. 227-262 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Iwanowski91 2003-11-19 Discrete Decision Theory: Manipulations. 215-236 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Cockett87 2003-11-19 An equational notion of lifting monad. 31-60 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#BucaloFS03 2003-11-19 Equational Lifting Monads. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#BucaloFS99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Graph Grammars with Neighbourhood-Controlled Embedding. 55-74 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#JanssensR82 2003-11-19 Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. 503-516 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#FleischnerKS02 2003-11-19 Trade-off results for connection management. 1-57 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#MavronicolasP03 2003-11-19 Linearizable Read/Write Objects. 267-319 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#MavronicolasR99 http://dx.doi.org/10.1016/S0304-3975(98)90244-4 2003-11-19 Topological Invariants of Classification Problems. 3-26 1990 72 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Budach90 2003-11-19 Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. 3-8 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#YehC01 http://dx.doi.org/10.1016/S0304-3975(00)00225-5 2003-11-19 A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing. 449-481 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#JinLC01 http://dx.doi.org/10.1016/S0304-3975(99)00313-8 2003-11-19 Frontier between decidability and undecidability: a survey. 217-251 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Margenstern00 http://dx.doi.org/10.1016/S0304-3975(99)00102-4 2003-11-19 On quasi-unilateral universal Turing machines. 153-166 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Margenstern01 http://dx.doi.org/10.1016/S0304-3975(00)00114-6 2003-11-19 Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. 419-424 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Margenstern94 2003-11-19 Foreword: Universal Machines and Computations. 213-214 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Margenstern96 2003-11-19 An Algebra of Mixed Computation. 81-93 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Itkin91 2003-11-19 On the Complexity of Learning Strings and Sequences. 363-371 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#JiangL93 2003-11-19 Approximating Shortest Superstrings with Constraints. 473-491 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#JiangL94 2003-11-19 Shortest Consistent Superstrings Computable in Polynomial Time. 113-122 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#JiangT95 http://dx.doi.org/10.1016/0304-3975(95)80027-7 2003-11-19 Pinwheel Scheduling with Two Distinct Numbers. 105-135 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#HolteRTV92 2003-11-19 Logical Analysis of Demonic Nondeterministic Programs. 173-202 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#DemriO96 http://dx.doi.org/10.1016/0304-3975(95)00190-5 2003-11-19 Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation. 273-287 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#ItoIT89 2003-11-19 The passport control problem or how to keep a dynamic service system load balanced? 303-318 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#ItaiRS02 http://dx.doi.org/10.1016/S0304-3975(01)00072-X 2003-11-19 Shuffle and scattered deletion closure of languages. 115-133 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#ItoKT00 http://dx.doi.org/10.1016/S0304-3975(99)00277-7 2003-11-19 Insertion and Deletion Closure of Languages. 3-19 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#ItoKT97 http://dx.doi.org/10.1016/S0304-3975(96)00307-6 2003-11-19 Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions. 175-194 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#ItoTK83 2003-11-19 Nesting of prime substructures in k-ary relations. 341-357 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#BonizzoniM01 http://dx.doi.org/10.1016/S0304-3975(00)00017-7 2003-11-19 On Automata on Infinite Trees. 227-244 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#BonizzoniM92 2003-11-19 The complexity of multiple sequence alignment with SP-score that is a metric. 63-79 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#BonizzoniV01 http://dx.doi.org/10.1016/S0304-3975(99)00324-2 2003-11-19 On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. 225-237 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#Fraigniaud98 http://dx.doi.org/10.1016/S0304-3975(97)00189-8 2003-11-19 Duality for Modal mu-Logics. 193-222 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#Hartonas98a http://dx.doi.org/10.1016/S0304-3975(97)00233-8 2003-11-19 An asymptotic study for path reversal. 585-602 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00537-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Giorgetti03 2003-11-19 Is there an Axiomatic Semantics for Standard Pure Prolog. 373-388 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#DenisD91 2003-11-19 Génération aléatoire uniforme de mots de langages rationnels. 43-63 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Denise96 http://dx.doi.org/10.1016/0304-3975(95)00200-6 2003-11-19 Editorial. 1 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#DuboisMSZ01 http://dx.doi.org/10.1016/S0304-3975(01)00133-5 2003-11-19 Three-player impartial games. 263-278 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#Propp00 http://dx.doi.org/10.1016/S0304-3975(99)00128-0 2003-11-19 Generalized domino-shuffling. 267-301 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00815-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Propp03 2003-11-19 Weak confluence and tau-inertness. 465-475 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Ying00 http://dx.doi.org/10.1016/S0304-3975(99)00084-5 2003-11-19 Bisimulation indexes and their applications. 1-68 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Ying02 http://dx.doi.org/10.1016/S0304-3975(01)00124-4 2003-11-19 When is the Ideal Completion of Abstract Basis Algebraic. 355-356 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Ying96 http://dx.doi.org/10.1016/0304-3975(95)00183-2 2003-11-19 A Shorter Proof to Uniqueness of Solutions of Equations. 395-397 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#Ying99 http://dx.doi.org/10.1016/S0304-3975(98)00187-X 2003-11-19 Approximation of boolean functions by combinatorial rectangles. 45-78 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00568-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Sauerhoff03 2005-01-07 Functorial Polymorphism. 35-64 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#BainbridgeFSS90 2003-11-19 Automatizing Termination Proofs of Recursively Defined Functions. 319-343 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#ManouryS94 2003-11-19 Constructible functions in cellular automata and their applications to hierarchy results. 797-809 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#IwamotoHMI02 http://dx.doi.org/10.1016/S0304-3975(01)00112-8 2003-11-19 A bijection between directed column-convex polyominoes and ordered trees of height at most three. 319-325 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00222-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#DeutschP03 2003-11-19 Expired data collection in shared dataspaces. 529-556 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00867-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#BusiZ03 2003-11-19 Preface. 1-2 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#RozenbergEK02 2003-11-19 Constructing a Third-Order Linear Differential Equation. 3-6 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#GeiselmanU97 http://dx.doi.org/10.1016/S0304-3975(97)00053-4 2003-11-19 Matching a Set of Strings with Variable Length don't Cares. 129-154 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#KucherovR97 http://dx.doi.org/10.1016/S0304-3975(97)88195-9 2003-11-19 A Uniform Approach to Inductive Posets and Inductive Closure. 57-77 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#WrightWT78 2003-11-19 Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices. 111-138 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#SarkarB98 http://dx.doi.org/10.1016/S0304-3975(97)00160-6 2003-11-19 Bibliography of L Systems. 339-354 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#RozenbergPS77 2003-11-19 Resolution Proofs of Generalized Pigeonhole Principles. 311-317 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#BussT88 2003-11-19 Metric Temporal Logic with Durations. 169-199 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#LakhnecheH95 http://dx.doi.org/10.1016/0304-3975(94)00151-8 2003-11-19 Subset Languages of Petri Nets Part II: Closure Properties. 85-108 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#RozenbergV83a 2003-11-19 Lexicographic Generation of Ordered Trees. 63-82 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Zaks80 2003-11-19 Modal Logics for Knowledge Representation Systems. 433-456 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Vakarelov91 2003-11-19 Computing farthest neighbors on a convex polytope. 47-58 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00431-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#CheongSV03 2003-11-19 A Specification-Oriented Semantics for the Refinement of Real-Time Systems. 219-241 1994 131 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#ScholefieldZJ94 2003-11-19 Time Lower Bounds do not Exist for CRCW PRAMs. 411-424 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#IwamaIM96 http://dx.doi.org/10.1016/0304-3975(94)00299-1 2003-11-19 Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. 485-494 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#IwamaKT00 http://dx.doi.org/10.1016/S0304-3975(00)00029-3 2003-11-19 A family of NFAs which need 2n- deterministic states. 451-462 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00891-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#IwamaMP03 2003-11-19 A Safe Approach to Parallel Combinator Reduction. 17-36 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#HankinBJ88 2003-11-19 Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. 33-50 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#CalinescuW02 http://dx.doi.org/10.1016/S0304-3975(01)00101-3 2003-11-19 Refining Multiset Tranformers. 233-258 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#HankinMS98 http://dx.doi.org/10.1016/S0304-3975(97)00151-5 2003-11-19 Algèbre de Processus et Synchronisation. 91-131 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#AustryB84 2003-11-19 A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. 405-418 1993 110 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Forster93 2003-11-19 Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). 351-363 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#YooH91 2003-11-19 Extended Regular Expressions of Arbitrary Star Degrees. 217-231 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#YooH92 2003-11-19 How to normalize the Jay. 677-681 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#ProbstS01 http://dx.doi.org/10.1016/S0304-3975(00)00379-0 2003-11-19 Efficient algorithms for chemical threshold testing problems. 493-511 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#BonisGV01 http://dx.doi.org/10.1016/S0304-3975(00)00037-2 2003-11-19 Permutability of Proofs in Intuitionistic Sequent Calculi. 141-155 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#DyckhoffP99 http://dx.doi.org/10.1016/S0304-3975(98)00138-8 2003-11-19 A physicist's approach to number partitioning. 79-108 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Mertens01 http://dx.doi.org/10.1016/S0304-3975(01)00153-0 2003-11-19 Reducing the Mean Latency of Floating-Point Addition. 201-214 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#ObermanF98 http://dx.doi.org/10.1016/S0304-3975(97)00201-6 2003-11-19 Congruence Lattices 101. 279-289 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Gratzer99 http://dx.doi.org/10.1016/S0304-3975(98)00275-8 2003-11-19 Closed Action Calculi. 77-103 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#Gardner99 http://dx.doi.org/10.1016/S0304-3975(98)00355-7 2003-11-19 <i>k</i>-Chain Subgraph Cover Problem. 85-98 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#YuCM98 http://dx.doi.org/10.1016/S0304-3975(97)00036-4 2003-11-19 Robust learning with infinite additional information. 427-454 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#KaufmannS01 http://dx.doi.org/10.1016/S0304-3975(00)00023-2 2003-11-19 Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. 179-209 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#TakimotoMV01 http://dx.doi.org/10.1016/S0304-3975(00)00138-9 2003-11-19 The Definition of Extended ML: A Gentle Introduction. 445-484 1997 173 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#KahrsST97 http://dx.doi.org/10.1016/S0304-3975(96)00163-6 2003-11-19 Algebraic Calculi of Processes and Net Expressions. 329-337 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Gonthier85 2003-11-19 The learnability of exclusive-or expansions based on monotone DNF formulas. 37-50 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#TakimotoSM00 http://dx.doi.org/10.1016/S0304-3975(99)00265-0 2003-11-19 A Theory of Even Functionals and Their Algorithmic Applications. 41-56 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#JaromczykS96 http://dx.doi.org/10.1016/0304-3975(95)00128-X 2003-11-19 The Reduced Relative Power Operation on Abstract Domains. 159-211 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#GiacobazziR99 http://dx.doi.org/10.1016/S0304-3975(98)00194-7 2003-11-19 Approximate strong separation with application in fractional graph coloring and preemptive scheduling. 239-256 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00829-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Jansen03 2003-11-19 Processor Optimization for Flow Graphs. 285-298 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Jansen92 2003-11-19 Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. 13-23 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#McNaughton98a http://dx.doi.org/10.1016/S0304-3975(98)00053-X 2003-11-19 The State Complexities of Some Basic Operations on Regular Languages. 315-328 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#YuZS94 2003-11-19 An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. 353-374 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00497-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Thiant03 2003-11-19 Grzegorczyk's hierarchy of computable analysis. 449-466 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Zhou00 http://dx.doi.org/10.1016/S0304-3975(00)00070-0 2003-11-19 Preface: Mechanised Reasoning about Languages with Variable Binding 2001. 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#AmblerCM01 2003-11-19 Congruential complements of ground term rewrite systems. 247-274 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Vagvolgyi00 http://dx.doi.org/10.1016/S0304-3975(98)00174-1 2003-11-19 On ground tree transformations and congruences induced by tree automata. 449-459 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00279-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Vagvolgyi03 2003-11-19 Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. 43-74 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Vagvolgyi92 2003-11-19 A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. 391-399 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Vagvolgyi93 2003-11-19 Theory of Evolutionary Algorithms: A Bird's Eye View. 3-9 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#EibenR99 http://dx.doi.org/10.1016/S0304-3975(99)00089-4 2003-11-19 Duality and the Completeness of the Modal mu-Calculus. 3-27 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#AmblerKM95 http://dx.doi.org/10.1016/0304-3975(95)00045-X 2003-11-19 Integrité des Algèbres de Séries Formelles sur un Alphabet Partiellement Commutatif. 109-112 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Thibon85 2004-11-22 Weak Arithmetics. 1-15 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Ressayre01 http://dx.doi.org/10.1016/S0304-3975(00)00106-7 2003-11-19 Solving the generalized mask constraint for test generation of binary floating point add operation. 183-201 2003 291 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#ZivF03 2003-11-19 One complexity theorist's view of quantum computing. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Fortnow00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 One complexity theorist's view of quantum computing. 597-610 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Fortnow03 2003-11-19 Small maximal matchings in random graphs. 487-507 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00653-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Zito03 2003-11-19 Towards compatible triangulations. 3-13 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00428-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#AichholzerAHK03 2003-11-19 Completeness of a relational calculus for program schemes. 543-556 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#FriasM01 http://dx.doi.org/10.1016/S0304-3975(99)00343-6 2003-11-19 A Process-Calculus-Based Abstraction for Coordinating Multi-Agent Groups. 287-314 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#MukherjiK98 http://dx.doi.org/10.1016/S0304-3975(97)00153-9 2003-11-19 Concurrent Systems and Inevitability. 281-304 1989 64 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#MazurkiewiczOP89 2003-11-19 WORDS '99 - Preface. 1-3 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Neraud02 http://dx.doi.org/10.1016/S0304-3975(00)00429-1 2003-11-19 On the Rank of the Subsets of a Free Monoid. 231-241 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Neraud92 2003-11-19 Deciding Whether a Finite Set of Words has Rank at Most Two. 311-337 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Neraud93 2003-11-19 Connectedness and Synchronization. 171-184 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#MazurkiewiczRT91 2003-11-19 Context-Free Like Restrictions on Selective Rewriting. 237-269 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#KleijnR81 2003-11-19 An algorithm to generate exactly once every tiling with lozenges of a domain. 375-408 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00498-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Desreux03 2003-11-19 Rotating-Table Games and Derivatives of Words. 311-329 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Bar-YehudaEM93 2003-11-19 Complexity of Monotone Networks for Boolean Matrix Product. 13-20 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Paterson75 2003-11-19 David Michael Ritchie Park (1935-1990) in Memoriam. 187-200 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Paterson94 2003-11-19 A New Approach to Recursion Removal. 91-113 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#HarrisonK92 2003-11-19 The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. 295-314 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#GurariI81 2003-11-19 Some Simplified Undecidable and NP-Hard Problems for Simple Programs. 55-73 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#GurariI82 2003-11-19 Towards a unified view of bisimulation: a comparative study. 81-130 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#RoggenbachM00 http://dx.doi.org/10.1016/S0304-3975(99)00303-5 2003-11-19 Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. 317-335 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Oyamaguchi84 2003-11-19 On the Data Type Extension Problem for Algebraic Specifications. 329-336 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Oyamaguchi85 2003-11-19 The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable. 43-79 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Oyamaguchi87 2003-11-19 A descriptive complexity approach to the linear hierarchy. 421-429 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00133-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Hachaichi03 2003-11-19 Shuffle Product of Generating Series. 257-261 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Rotella91 2003-11-19 Modulo-Counting Quantifiers Over Finite Trees. 97-112 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Potthoff94 2003-11-19 Algebraic and Fixed Point Equations over Inverse Limits of Algebras. 1-24 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Stoltenberg-HansenT91 2003-11-19 Concrete Models of Computation for Topological Algebras. 347-378 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Stoltenberg-HansenT99 http://dx.doi.org/10.1016/S0304-3975(98)00296-5 2003-11-19 Scattered Deletion and Commutativity. 361-371 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Mateescu94 2003-11-19 On the Inference of Optimal Descriptions. 301-319 1977 4 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Daley77 2003-11-19 On the Error Correcting Power of Pluralism in BC-Type Inductive Inference. 95-104 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Daley83 2003-11-19 Stationary Deterministic Flows: II. The Single-Server Queue. 269-280 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#GelenbeF87 2003-11-19 Virus Tests to Maximize Availability of Software Systems. 131-147 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#GelenbeH94 2003-11-19 Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. 247-282 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#EngelfrietHPR96 http://dx.doi.org/10.1016/0304-3975(94)00272-X 2003-11-19 Separating Complexity Classes Related to Omega-Decision Trees. 351-360 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#DammM92 2003-11-19 A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. 95-103 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Schoning82 2003-11-19 Minimal pairs for P 41-48 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Schoning84 2003-11-19 Robust Algorithms: A Different Approach to Oracles. 57-66 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Schoning85 2003-11-19 Learning Semilinear Sets from Examples and via Queries. 207-233 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Takada92 2003-11-19 Interval Logics and Their Decision Procedures, Part I: An Interval Logic. 1-47 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#RamakrishnaMMDK96 http://dx.doi.org/10.1016/0304-3975(95)00254-5 2003-11-19 First-Order Approximation of Algorithmic Theories. 257-272 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Danko86 2003-11-19 A practical algorithm to find the best subsequence patterns. 465-479 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#HiraoHSTA03 2003-11-19 A Gentzen-style sequent calculus of constructions with expansion rules. 199-215 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Seldin00 http://dx.doi.org/10.1016/S0304-3975(98)00195-9 2003-11-19 Re-describing an algorithm by Hopcroft. 333-363 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Knuutila01 http://dx.doi.org/10.1016/S0304-3975(99)00150-4 2003-11-19 Nest Sets and Relativized Closure Properties. 253-264 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Takahashi83 2003-11-19 The Greatest Fixed-Points and Rational Omega-Tree Languages. 259-274 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Takahashi86 2003-11-19 Brzozowski Hierarchy of omega-Languages. 1-12 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Takahashi87 2003-11-19 A Unified Constructive Network Model for Problem-Solving. 217-261 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Takahashi96 http://dx.doi.org/10.1016/0304-3975(95)00134-4 2003-11-19 On the Finite Containment Problem for Petri Nets. 99-105 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Clote86 2003-11-19 Various Hierarchies of omega-regular Sets. 259-268 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Takahashi97 http://dx.doi.org/10.1016/S0304-3975(96)00245-9 2003-11-19 Monotone term decision lists. 549-575 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#GuijarroLR01 http://dx.doi.org/10.1016/S0304-3975(00)00043-8 2003-11-19 A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. 1-63 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#CazanescuS92 2003-11-19 On the Greatest Fixed Point of a Set Functor. 57-75 1995 150 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs150.html#AdamekK95 http://dx.doi.org/10.1016/0304-3975(95)00011-K 2003-11-19 Separately Continuous Algebras. 225-231 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#AdamekN83 2003-11-19 Nondeterministic Stack Register Machines. 37-76 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#Clote97 http://dx.doi.org/10.1016/S0304-3975(96)00051-5 2003-11-19 A formal approach to object-oriented software engineering. 519-560 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#WirsingK02 http://dx.doi.org/10.1016/S0304-3975(01)00367-X 2003-11-19 CoverPpreserving Embeddings of Bipartite Orders Into Boolean Lattices. 337-347 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#MitasR97 http://dx.doi.org/10.1016/S0304-3975(96)00207-1 2003-11-19 Sur la distribution des anti-excédances dans le groupe symétrique et dans ses sous-groupes. 243-253 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Mantaci93 2003-11-19 Extensional Models for Polymorphism. 85-114 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#TannenC88 2003-11-19 Polymorphic Rewriting Conserves Algebraic Strong Normalization. 3-28 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#TannenG91 2003-11-19 Finite Failures and Partial Computations in Concurrent Logic Languages. 45-66 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#FalaschiL90 2003-11-19 Equational Completion in Order-Sorted Algebras. 169-202 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#GnaedigKK90 2003-11-19 Foundations of Aggregation Constraints. 149-179 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#RossSSS98 http://dx.doi.org/10.1016/S0304-3975(97)00011-X 2003-11-19 Some Decision Problems for Parallel Communicating Grammar Systems. 365-385 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#TipleaEIP94 2003-11-19 Natural Termination. 179-207 1995 142 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#DershowitzH95 http://dx.doi.org/10.1016/0304-3975(94)00275-4 2003-11-19 A Rationale for Conditional Equational Programming. 111-138 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#DershowitzO90 2003-11-19 Functional labels and syntactic entropy on DNA strings and proteins. 35-51 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00443-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#CarboneG03 2003-11-19 Subword Topology. 159-168 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#DareS86 2003-11-19 Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets. 183-263 1987 55 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Brandenburg87a 2003-11-19 An Analysis of Fixed-Point Queries on Binary Trees. 75-95 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Lindell91 2003-11-19 Defining Concurrent Processes Constructively. 137-164 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#Takayama94 2003-11-19 Coupling Coefficients of a Distributed Execution. 341-376 1993 110 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Charron-Bost93 2003-11-19 A Fast Numerical Algorithm for the Composition of Power Series with Complex Coefficients. 1-16 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Ritzmann86 2003-11-19 Complete Problems for Deterministic Polynomial Time. 105-117 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#JonesL76 2003-11-19 The syntactic prediction with token automata: application to HandiAS system. 121-129 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#MaurelP01 http://dx.doi.org/10.1016/S0304-3975(00)00299-1 2003-11-19 Integer partitions and the Sperner property. 515-529 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00235-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Canfield03 2003-11-19 Inherent Complexity Trade-Offs for Range Query Problems. 279-290 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#BurkhardFK81 2003-11-19 Sturmian words and words with a critical exponent. 283-300 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Vandeth00 http://dx.doi.org/10.1016/S0304-3975(98)00227-8 2003-11-19 The bounded eight-vertex model. 539-552 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00505-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Eloranta03 2003-11-19 Homotopy in Two-Dimensional Digital Images. 221-233 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Malgouyres00 http://dx.doi.org/10.1016/S0304-3975(98)00347-8 2003-11-19 Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle - Parametrization of Discretized Curves. 189-249 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Malgouyres95 http://dx.doi.org/10.1016/0304-3975(94)00134-5 2003-11-19 There is no Local Characterization of Separating and Thin Objects in Z³. 303-308 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Malgouyres96 http://dx.doi.org/10.1016/0304-3975(96)00021-7 2003-11-19 A Definition of Surfaces of Z: A new 3D Discrete Jordan Theorem. 1-41 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#Malgouyres97 http://dx.doi.org/10.1016/S0304-3975(96)00213-7 2003-11-19 Concrete Domains. 187-277 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#KahnP93 2003-11-19 On the asymptotic behaviour of primitive recursive algorithms. 159-193 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#David01 http://dx.doi.org/10.1016/S0304-3975(00)00165-1 2005-07-25 Decidability results for primitive recursive algorithms. 477-504 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00732-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#David03 2003-11-19 The Inf Function in the System F. 423-431 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#David94 2003-11-19 Merit Factors and Morse Sequences. 377-387 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#DownarowiczL98 http://dx.doi.org/10.1016/S0304-3975(98)00121-2 2003-11-19 Reductions on NP and P-Selective Sets. 287-304 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Selman82 2003-11-19 Regular binoid expressions and regular binoid languages. 291-313 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00137-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#HashiguchiWJ03 2003-11-19 Parsing MELL proof nets. 317-335 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#GuerriniM01 http://dx.doi.org/10.1016/S0304-3975(99)00299-6 2003-11-19 Some Simplified NP-Complete Graph Problems. 237-267 1976 1 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#GareyJS76 2003-11-19 Non-approximability of weighted multiple sequence alignment. 179-192 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00439-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Manthey03 2003-11-19 <i>lambda</i>-Calculus. 225-242 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Barendregt76 2003-11-19 Constructive Proofs of the Range Property in lambda-Calculus. 59-69 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Barendregt93 2003-11-19 Continuity Spaces: Reconciling Domains and Metric Spaces. 111-138 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#FlaggK97 http://dx.doi.org/10.1016/S0304-3975(97)00236-3 2003-11-19 Hyper-polynomial hierarchies and the polynomial jump. 241-256 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#FennerHPS01 http://dx.doi.org/10.1016/S0304-3975(00)00193-6 2003-11-19 The essence of ideal completion in quantitative form. 141-158 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#FlaggS02 http://dx.doi.org/10.1016/S0304-3975(00)00334-0 2003-11-19 Tilings as a programming exercise. 207-217 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Cousineau02 http://dx.doi.org/10.1016/S0304-3975(02)00013-0 2003-11-19 An Algebraic Definition for Control Structures. 175-192 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Cousineau80 2003-11-19 Direct constructions of universal extended H systems. 269-293 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00658-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Frisco03 2003-11-19 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. 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#GramlichL01 2003-11-19 SC-hyperdecidability of R. 569-591 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#AlmeidaS01 http://dx.doi.org/10.1016/S0304-3975(99)00329-1 2003-11-19 Learning Context-Free Grammars from Structural Data in Polynomial Time. 223-242 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Sakakibara90 2003-11-19 Recent Advances of Grammatical Inference. 15-45 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Sakakibara97 http://dx.doi.org/10.1016/S0304-3975(97)00014-5 2003-11-19 On a modular domination game. 291-303 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00285-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#GravierMT03 2003-11-19 Decidability and complexity of simultaneous rigid E-unification with one variable and related results. 167-184 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#DegtyarevGNVV00 http://dx.doi.org/10.1016/S0304-3975(98)00185-6 2003-11-19 In Memoriam Calvin C. Elgot. 1-4 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Shepherdson81 2003-11-19 Graph Theoretic Characterization of G-Schemes and TL-Schemes. 217-228 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Shepherdson82 2003-11-19 A Sound and Complete Semantics for a Version of Negation as Failure. 343-371 1989 65 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Shepherdson89 2003-11-19 The Role of Standardising Apart in Logic Programming. 143-142 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Shepherdson94 2003-11-19 A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. 109-128 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Stickel92 2003-12-05 Image compression for fast wavelet-based subregion retrieval. 447-469 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#PoulakidasSEIY00 http://dx.doi.org/10.1016/S0304-3975(99)00242-X 2003-11-19 A Static Analysis Method for a Classical Linear Logic Programming Language. 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#KangT99 2003-11-19 Automatic semigroups. 365-391 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#CampbellRRT01 http://dx.doi.org/10.1016/S0304-3975(99)00151-6 2003-11-19 On the Computational Complexity of Satisfiability in Propositional Logics of Programs. 179-212 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Chlebus82 2003-11-19 A Hierarchy of Propositional Horn Formulas. 113-119 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Chlebus89 2003-11-19 Sequential Simulation of Parallel Iterations and Applications. 135-144 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Tchuente86 2003-11-19 Diffusion without false rumors: on propagating updates in a Byzantine environment. 289-306 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00325-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#MalkhiMR03 2003-11-19 On a Special Monoid with a Single Defining Relation. 61-73 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Jantzen81a 2003-11-19 Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems. 13-43 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#JantzenK84 2003-11-19 Cancellation in Context-Free Languages: Enrichment by Reduction. 149-170 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#JantzenP94 2003-11-19 Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. 175-193 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#KantH97 http://dx.doi.org/10.1016/S0304-3975(95)00257-X 2003-11-19 Partial Specifications and Compositional Verification. 15-32 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#LarsenT91 2003-11-19 Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants". 895-911 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#FlakeB02 http://dx.doi.org/10.1016/S0304-3975(01)00173-6 2003-11-19 The Complexity of Pursuit on a Graph. 93-112 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#GoldsteinR95 http://dx.doi.org/10.1016/0304-3975(95)80026-6 2003-11-19 The Inclusion Problem for Some Subclasses of Context-Free Languages. 247-256 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#AsveldN00 http://dx.doi.org/10.1016/S0304-3975(99)00113-9 2003-11-19 A Sheaf-Theoretic Approach to Pattern Matching and Related Problems. 53-97 1993 112 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Srinivas93 2003-11-19 Generalized Galois Theory and its Application to Complexity. 271-293 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Engeler81 2003-11-19 Combinatory Differential Fields. 119-131 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Engeler90 2003-11-19 Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets. 215-252 1992 102 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Bruschi92 2003-11-19 Alphabetic and synchronized tree transducers. 377-399 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Rahonis01 http://dx.doi.org/10.1016/S0304-3975(99)00296-0 2003-11-19 Observing Localities. 31-61 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#BoudolCHK93 2003-11-19 Optimal Parallel Algorithms for Forest and Term Matching. 245-264 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#KedemP92 2003-11-19 Hardness results for neural network approximation problems. 53-66 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#BartlettB02 http://dx.doi.org/10.1016/S0304-3975(01)00057-3 2003-11-19 On Language Equations with Invertible Operations. 129-150 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Kari94a 2003-11-19 The Trace Invariant and Matrix Inversion. 277-286 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Kalorkoti88 2003-11-19 Independent minimum length programs to translate between given strings. 131-143 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#VereshchaginV02 http://dx.doi.org/10.1016/S0304-3975(01)00036-6 2004-06-28 Some bijective results about the area of Schröder paths. 327-335 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00223-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#FerrariGPR03 2003-11-19 Alternation and omega-Type Turing Acceptors. 107-115 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Lindsay86 2003-11-19 An Algebraic Semantics Approach to the Effective Resolution of Type Equations. 293-351 1986 45 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Ait-Kaci86 2003-11-19 Foreword. 1 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#BongiovanniGP02 http://dx.doi.org/10.1016/S0304-3975(01)00286-9 2003-11-19 Type inference for set theory. 951-974 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Turner01 http://dx.doi.org/10.1016/S0304-3975(01)00123-2 2003-11-19 Residue polynomial systems. 29-49 2002 279 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#Turner02 http://dx.doi.org/10.1016/S0304-3975(00)00425-4 2003-11-19 On Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems. 95-138 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#MokkedemM95 http://dx.doi.org/10.1016/0304-3975(94)00206-X 2003-11-19 Foreword. 175-177 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#WiehagenZ01 http://dx.doi.org/10.1016/S0304-3975(00)00269-3 2003-11-19 A First Step Towards Implementing Dynamic Algebraic Dependences. 115-149 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#BidoitA98 http://dx.doi.org/10.1016/S0304-3975(97)00088-1 2003-11-19 Negation by Default and Unstratifiable Logic Programs. 86-112 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#BidoitF91 2003-11-19 Behavioural Theories and the Proof of Behavioural Properties. 3-55 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#BidoitH96 http://dx.doi.org/10.1016/0304-3975(96)00039-4 2003-11-19 System Modelling with High-Level Petri Nets. 109-136 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#GenrichL81 2003-11-19 A Theory of Bipolar Synchronization Schemes. 241-318 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#GenrichT84 2003-11-19 Interleaving Set Temporal Logic. 263-287 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#KatzP90 2003-11-19 Complexity of perceptron recognition for a class of geometric patterns. 65-79 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(01)00266-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#AracenaC03 2003-11-19 On computing the entropy of cellular automata. 1629-1646 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DamicoMM03 2003-11-19 A Three-Word Code Which is Not Prefix-Suffix Composed. 145-160 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Derencourt96 http://dx.doi.org/10.1016/0304-3975(95)00139-5 2003-11-19 Foreword. 153 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#Palamidessi01 http://dx.doi.org/10.1016/S0304-3975(00)00092-X 2003-11-19 Defining Conditional Independence Using Collapses. 337-359 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#KatzP92 2003-11-19 pi-calculus in (Co)inductive-type theory. 239-285 2001 253 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#HonsellMS01 http://dx.doi.org/10.1016/S0304-3975(00)00095-5 2003-11-19 P != NP over the Nonstandard Reals Implies P != NP over R. 95-104 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Michaux94 2003-11-19 Finite Automata and Unary Languages. 149-158 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Chrobak86 2003-11-19 An Improved Zero-One Law for Algorithmically Random Sequences. 185-192 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Kautz98 http://dx.doi.org/10.1016/S0304-3975(97)00116-3 2003-11-19 Towards the animation of proofs - testing proofs by examples. 177-195 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#HayashiSS02 http://dx.doi.org/10.1016/S0304-3975(00)00350-9 2003-11-19 Effects of domain characteristics on instance-based learning algorithms. 207-233 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00424-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#OkamotoY03 2003-11-19 The Comparison of the Expressive Power of First-Order Dynamic Logics. 197-209 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#StolboushkinT83 2003-11-19 Random Walks, Gaussian Processes and List Structures. 99-124 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Louchard87 2003-11-19 Probabilistic Analysis of Some (Un)Directed Animals. 65-79 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Louchard96 http://dx.doi.org/10.1016/0304-3975(95)00201-4 2003-11-19 Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms. 249-262 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Louchard99 http://dx.doi.org/10.1016/S0304-3975(98)00324-7 2003-11-19 Delay-insensitivity and ternary simulation. 3-25 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#Brzozowski00 http://dx.doi.org/10.1016/S0304-3975(99)00273-X 2003-11-19 Evolutionary computation and Wright's equation. 145-165 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#MuhlenbeinM02 2003-11-19 Non-Interleaving Semantics for Mobile Processes. 237-270 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#DeganoP99 http://dx.doi.org/10.1016/S0304-3975(99)80003-6 2003-11-19 Computation on Graph-Like Expressions. 171-185 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Staples80 2003-11-19 Delaying Unification Algorithms for Lambda Calculi. 277-288 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Staples88 2003-11-19 Probabilistic Analysis of Bucket Recursive Trees. 221-249 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#MahmoudS95 http://dx.doi.org/10.1016/0304-3975(94)00308-6 2003-11-19 Finitary PCF is not decidable. 341-364 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Loader01 http://dx.doi.org/10.1016/S0304-3975(00)00194-8 2003-11-19 Unary PCF is Decidable. 317-329 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Loader98 http://dx.doi.org/10.1016/S0304-3975(98)00048-6 2003-11-19 On a Sequence of Rational Functions. 123-130 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Allouche89 2003-11-19 Note on the Cyclic Towers of Hanoi. 3-7 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Allouche94 2003-11-19 Transcendence of Formal Power Series with Rational Coefficients. 143-160 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Allouche99 http://dx.doi.org/10.1016/S0304-3975(98)00256-4 2003-11-19 Prescribing Behaviors. 119-125 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Turski91 2003-11-19 Learning algebraic structures from text. 221-273 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#StephanV01 http://dx.doi.org/10.1016/S0304-3975(00)00272-3 2003-11-19 Learning classes of approximations to non-recursive function. 309-341 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#StephanZ02 2003-11-19 Complexity of Logical Theories Involving Coprimality. 221-241 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Michel92a 2003-11-19 On the Walk. 179-202 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#AmrheinGK97 http://dx.doi.org/10.1016/S0304-3975(97)00064-9 2003-11-19 Helios: A Modeling Language for Global Optimization and its Implementation in Newton. 3-48 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#MichelH97 http://dx.doi.org/10.1016/S0304-3975(96)00190-9 2003-11-19 Sign Determination in Residue Number Systems. 173-197 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#BronnimannEPP99 http://dx.doi.org/10.1016/S0304-3975(98)00101-7 2003-11-19 Parallel Reduction in Type Free lambda/mu-Calculus. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#BabaHF01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 List of Publications of Marcel-Paul Schützenberger. 3-9 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Anonymous98 http://dx.doi.org/10.1016/S0304-3975(98)00027-9 2003-11-19 A Very Hard log-Space Counting Class. 3-30 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#AlvarezJ93 2003-11-19 On Adaptive DLOGTIME and POLYLOGTIME Reductions. 183-205 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#AlvarezJ95 http://dx.doi.org/10.1016/0304-3975(95)00033-S 2003-11-19 Integer Programs for Logic Constraint Satisfaction. 105-130 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Monfroglio92 2003-11-19 beta-Expansions and Symbolic Dynamics. 131-141 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Blanchard89 2003-11-19 A loopless algorithm for generating the permutations of a multiset. 415-431 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00228-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Vajnovszki03 2003-11-19 Determinism and Looping in Combinatory PDL. 259-277 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#GargovP88 2003-11-19 A Combinatory Logic Approach to Higher-Order E-Unification. 207-242 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#DoughertyJ95 http://dx.doi.org/10.1016/0304-3975(94)00210-A 2003-11-19 Real functions computable by finite automata using affine representations. 373-396 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Konecny02 http://dx.doi.org/10.1016/S0304-3975(01)00095-0 2003-11-19 A Meta-Language for Typed Object-Oriented Languages. 297-352 1995 151 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Castagna95 http://dx.doi.org/10.1016/0304-3975(95)00071-4 2003-11-19 ^{}. 337-345 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Castagna97 http://dx.doi.org/10.1016/S0304-3975(97)81497-1 2003-11-19 An algebraic characterization of the set of succession rules. 351-367 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#FerrariPPR02 http://dx.doi.org/10.1016/S0304-3975(02)00020-8 2003-11-19 Alternation for sublogarithmic space-bounded alternating pushdown automata. 475-492 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#XuYIWI01 http://dx.doi.org/10.1016/S0304-3975(00)00035-9 2003-11-19 Combining Data Type and Recursive Process Specifications Using Projection Algebras. 347-380 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#EhrigPBRDG90 2003-11-19 Sorting the Sums (xi+yj) in O(n2) Comparisons. 137-141 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Lambert92a 2003-11-19 Characterization of omega-Regular Languages by Monadic Second-Order Formulas. 91-99 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#YamasakiTK86 2003-11-19 Testing for Grammatical Coverings. 323-341 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#RosenkrantzH85 2003-11-19 Clans and Regions in 2-Structures. 207-262 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#DeutzER94a 2003-11-19 Statistical mechanics methods and phase transitions in optimization problems. 3-67 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#MartinMZ01 http://dx.doi.org/10.1016/S0304-3975(01)00149-9 2003-11-19 A Fixpoint Semantics of Horn Sentences Based on Substitution Sets. 309-324 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#YamasakiYD87 2003-11-19 On Minimal Graphs. 103-110 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Fellner82 2003-11-19 Learning power and language expressiveness. 365-383 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00814-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#MartinSS03 2005-02-21 <i>A</i><i>B</i><i>C</i>. 383-386 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Gorbunov98 http://dx.doi.org/10.1016/S0304-3975(98)00074-7 2003-11-19 Reflection in conditional rewriting logic. 245-288 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#ClavelM02 http://dx.doi.org/10.1016/S0304-3975(01)00360-7 2003-11-19 The Finite Power Property for Context-Free Languages. 111-114 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#HughesS81 2003-11-19 Operational equivalence for interaction nets. 157-181 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00637-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#FernandezM03 2003-11-19 Interaction Nets and Term-Rewriting Systems. 3-39 1998 190 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#FernandezM98 http://dx.doi.org/10.1016/S0304-3975(97)00082-0 2003-11-19 D-Continuous Causal Nets: A Model of Non-Sequential Processes. 171-196 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#FernandezT84 2003-11-19 <i>log log n</i><i>log n</i>. 115-119 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Szepietowski90 2003-11-19 Neighborhood unions and regularity in graphs. 247-254 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#FavaronR01 http://dx.doi.org/10.1016/S0304-3975(00)00246-2 2003-11-19 Experiments in Linear Natural Deduction. 159-173 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#MartiniM97 http://dx.doi.org/10.1016/S0304-3975(96)00055-2 2003-11-19 Testing timed automata. 225-257 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#SpringintveldVD01 http://dx.doi.org/10.1016/S0304-3975(99)00134-6 2003-11-19 Power Properties of NLC Graph Grammars with a Polynomial Membership Problem. 189-231 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Flasinski98 http://dx.doi.org/10.1016/S0304-3975(97)00212-0 2004-12-02 Some linear recurrences and their combinatorial interpretation by means of regular languages. 679-686 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#BarcucciR01 http://dx.doi.org/10.1016/S0304-3975(00)00398-4 2003-11-19 Fast Generalized Fourier Transforms. 55-63 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Clausen89 2003-11-19 Reachability in Cyclic Extended Free-Choice Systems. 93-118 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#DeselE93 2003-11-19 Complete Axiomatizations of Some Quotient Term Algebras. 167-191 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Comon93 2003-11-19 An Average-Case Analysis of MAT and Inverted File. 251-266 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#RaoIK88 2003-11-19 A fully abstract denotational semantics for the calculus of higher-order communicating systems. 557-589 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#ThomsenA01 http://dx.doi.org/10.1016/S0304-3975(00)00281-4 2003-11-19 Characterization of real time iterative array by alternating device. 2075-2084 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Terrier03 2003-11-19 On Real Time One-Way Cellular Array. 331-335 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#Terrier95 http://dx.doi.org/10.1016/0304-3975(94)00212-2 2003-11-19 Language not Recognizable in Real Time by One-Way Cellular Automata. 281-287 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Terrier96 http://dx.doi.org/10.1016/0304-3975(95)00111-5 2003-11-19 Two-Dimensional Cellular Automata Recognizer. 325-346 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Terrier99 http://dx.doi.org/10.1016/S0304-3975(98)00329-6 2003-11-19 An Overview of Transaction Logic. 205-265 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#BonnerK94 2003-11-19 A Competitive Analysis of the List Update Problem with Lookahead. 95-109 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#Albers98 http://dx.doi.org/10.1016/S0304-3975(97)00026-1 2003-11-19 Gene assembly through cyclic graph decomposition. 325-349 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#EhrenfeuchtHR02 http://dx.doi.org/10.1016/S0304-3975(02)00019-1 2003-11-19 On Regularity of Context-Free Languages. 311-332 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#EhrenfeuchtHR83 2003-11-19 On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. 201-228 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#EhrenfeuchtHR86 2003-11-19 Algebraic Feedback Shift Registers. 61-92 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#KlapperX99 http://dx.doi.org/10.1016/S0304-3975(99)00066-3 2003-11-19 A Foundation for Modular Reasoning About Safety and Progress Properties of State-Based Concurrent Programs. 253-279 1997 183 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#ColletteK97 http://dx.doi.org/10.1016/S0304-3975(96)00327-1 2003-11-19 The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. 119-144 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#EhrenfeuchtKR82 2003-11-19 Adding Global Forbidding Context to Context-Free Grammars. 337-360 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#EhrenfeuchtKR85 2003-11-19 Reaching a Goal with Directional Uncertainty. 301-317 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#BergGHOSST95 http://dx.doi.org/10.1016/0304-3975(94)00237-D 2003-11-19 Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. 59-75 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#EhrenfeuchtLR75 2003-11-19 Real Numbers - Foreword. 1-2 2002 279 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#ChesneauxFM02 http://dx.doi.org/10.1016/S0304-3975(00)00423-0 2003-11-19 Restrictions on NLC Graph Grammars. 211-223 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#EhrenfeuchtMR84 2003-11-19 Foreword. 1-2 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#FreivaldsHPU01 http://dx.doi.org/10.1016/S0304-3975(00)00210-3 2003-11-19 On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. 155-173 1989 68 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#LingasP89 2003-11-19 Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem. 169-183 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#EhrenfeuchtR78a 2003-11-19 On Ambiguity in E0L Systems. 127-134 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#EhrenfeuchtR80a 2003-11-19 On a Bound for the D0L Sequence Equivalence Problem. 339-342 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#EhrenfeuchtR80b 2003-11-19 Theory of 2-Structures, Part II: Representation Through Labeled Tree Families. 305-342 1990 70 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#EhrenfeuchtR90a 2003-11-19 Primitivity is Hereditary for 2-Structures. 343-358 1990 70 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#EhrenfeuchtR90b 2003-11-19 Properties of Grammatical Codes of Trees. 259-293 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#EhrenfeuchtPR94 2003-11-19 A Note on Binary Grammatical Codes of Trees. 425-438 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#EhrenfeuchtPR96 http://dx.doi.org/10.1016/0304-3975(95)00093-3 2003-11-19 On Representing Recursively Enumerable Languages by Internal Contextual Languages. 61-83 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#EhrenfeuchtPR98 http://dx.doi.org/10.1016/S0304-3975(97)00035-2 2003-11-19 A Relationship between ET0L and EDT0L Languages. 325-330 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#EhrenfeuchtRS76 2003-11-19 On Inherently Ambiguous E0L Languages. 197-214 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#EhrenfeuchtRV84 2003-11-19 Quantitative Domains and Infinitary Algebras. 37-62 1992 94 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Lamarche92 2003-11-19 Stable Domains are Generalized Topological Spaces. 103-123 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#Lamarche93 2003-11-19 On the submodular matrix representation of a digraph. 563-570 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#GaillardGHP02 2003-11-19 Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. 239-250 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#FaginKPS85 2003-11-19 Contributions to the Stable Model Semantics of Logic Programs with Negation. 231-255 1995 149 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#Costantini95 http://dx.doi.org/10.1016/0304-3975(94)00259-L 2003-11-19 A Superposition Oriented Theorem Prover. 129-164 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Fribourg85 2003-11-19 Completeness of Type Assignment in Continuous Lambda Models. 309-324 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Coppo84 2003-11-19 A Generalization of the Schützenberger Product of Finite Monoids. 137-150 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Straubing81 2003-11-19 Semigroups and Languages of Dot-Depth Two. 361-378 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Straubing88 2003-11-19 CASL: the Common Algebraic Specification Language. 153-196 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#AstesianoBKKMST02 2003-11-19 Exponential-Time and Subexponential-Time Sets. 371-381 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#TangFL93 2003-11-19 Capturing Strong Reduction in Director String Calculus. 333-347 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#SreedharT93 2003-11-19 On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet. 147-153 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#CoriF91 2003-11-19 Construction of Maps with Prescribed Automorphism Group. 91-98 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#CoriM82 2003-11-19 Recognizable Subsets of Some Partially Abelian Monoids. 179-189 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#CoriM85 2003-11-19 Counting Non-Isomorphic Chord Diagrams. 55-73 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#CoriM98 http://dx.doi.org/10.1016/S0304-3975(98)00031-0 2003-11-19 Description trees and Tutte formulas. 165-183 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#CoriS03 2003-11-19 A Unified Approach to Type Theory Through a Refined lambda-Calculus. 183-216 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#KamareddineN94 2003-11-19 A Useful lambda-Notation. 85-109 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#KamareddineN96 http://dx.doi.org/10.1016/0304-3975(95)00101-8 2006-06-13 It is Decidable Whether a Regular Language is Pure Context-Free. 233-241 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#BucherH83 2003-11-19 Approximate Algorithms for Some Generalized Knapsack Problems. 293-304 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#ChandraHW76 2003-11-19 P-immune sets with holes lack self-reducibility properties. 457-466 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00576-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#HemaspaandraH03 2003-11-19 Quasi-injective Reductions. 407-413 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#HemaspaandraH94 2003-11-19 P-Selectivity: Intersections and Indices. 371-380 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#HemaspaandraJ95 http://dx.doi.org/10.1016/0304-3975(94)00290-Y 2006-04-21 On Machines, Universal by Extensions. 257-266 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Pavlotskaya96 http://dx.doi.org/10.1016/S0304-3975(96)00079-5 2003-11-19 Types for access control. 215-254 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#NicolaFPV00 http://dx.doi.org/10.1016/S0304-3975(99)00232-7 2003-11-19 A second step towards complexity-theoretic analogs of Rice's Theorem. 205-217 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#HemaspaandraR00 http://dx.doi.org/10.1016/S0304-3975(98)00344-2 2003-11-19 Phase semantics for light linear logic. 525-549 2003 294 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#KanovichOS03 2003-11-19 Optimal Advice. 367-377 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#HemaspaandraT96 http://dx.doi.org/10.1016/0304-3975(95)00076-3 2003-11-19 Biinfinite words with maximal recurrent unbordered factors. 2053-2061 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Costa03 2003-11-19 Two Time-Space Tradeoffs for Element Distinctness. 237-246 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Karchmer86 2003-11-19 Program logic and equivalence in the presence of garbage collection. 557-581 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00868-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#CalcagnoOB03 2003-11-19 The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. 19-30 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#GasieniecPR95 http://dx.doi.org/10.1016/0304-3975(94)00249-I 2003-11-19 On the intuitionistic force of classical search. 299-333 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#RitterPW00 http://dx.doi.org/10.1016/S0304-3975(99)00178-4 2003-11-19 Completeness of a First-Order Temporal Logic with Time-Gaps. 241-270 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#BaazLZ96 http://dx.doi.org/10.1016/0304-3975(95)00107-7 2003-11-19 Efficient collective communication in optical networks. 165-189 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#BermondGPRV00 http://dx.doi.org/10.1016/S0304-3975(98)00018-8 2005-11-02 Bilateral locally testable languages. 775-783 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00778-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#GarciaRP03 2003-11-19 Algèbres associatives et calcul formel (Associative algebras and computer algebra). 123-145 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Makhlouf97 http://dx.doi.org/10.1016/S0304-3975(97)00061-3 2003-11-19 Chaitin Omega numbers, Solovay machines, and Gödel incompleteness. 269-277 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Calude02a http://dx.doi.org/10.1016/S0304-3975(01)00068-8 2003-11-19 The Behavior-Realization Adjunction and Generalized Homomorphic Relations. 183-216 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#LeavensP97 http://dx.doi.org/10.1016/S0304-3975(97)87172-1 2003-11-19 Automatic Inductive Theorem Proving Using Prolog. 3-28 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#HsiangS87 2003-11-19 Note on the Topological Structure of Random Strings. 383-390 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#CaludeC93 2003-11-19 Determining and Stationary Sets for Some Classes of Partial Recursive Functions. 151-155 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#CaludeI91 2003-11-19 A Note on Representations of a Certain Monoid. 229-231 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#SquierW82 2003-11-19 On the Stability of some Biological Schemes with Cellular Interactions. 115-130 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#HermanW76 2003-11-19 Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity. 3-27 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#HornofN00 http://dx.doi.org/10.1016/S0304-3975(00)00048-7 2003-11-19 Query automata over finite trees. 633-674 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#NevenS02 http://dx.doi.org/10.1016/S0304-3975(01)00301-2 2003-11-19 Effective Category and Measure in Abstract Complexity Theory. 307-327 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#CaludeZ96 http://dx.doi.org/10.1016/0304-3975(95)00066-6 2003-11-19 On Flowchart Theories: Part II. The Nondeterministic Case. 307-340 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Stefanescu87 2003-11-19 Foreword. 1-2 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#Metayer00 http://dx.doi.org/10.1016/S0304-3975(99)00225-X 2003-11-19 _<i>a</i>₀. 221-229 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Metayer99 http://dx.doi.org/10.1016/S0304-3975(99)00053-5 2003-11-19 Extending a partial evaluator which supports separate compilation. 99-145 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#HeldalH00 http://dx.doi.org/10.1016/S0304-3975(00)00050-5 2003-11-19 On the Operational Semantics of Nondeterminism and Divergence. 271-317 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#ErdogmusJF96 http://dx.doi.org/10.1016/0304-3975(95)00166-2 2003-11-19 Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems. 361-374 1995 149 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#Schmidt-SchaussMP95 http://dx.doi.org/10.1016/0304-3975(95)00080-G 2003-11-19 The accepting power of unary string logic programs. 59-79 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#MatsushitaR01 http://dx.doi.org/10.1016/S0304-3975(00)00011-6 2003-11-19 Parametrisation of solutions of parametric equation in free monoid. 403-475 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#MakaninM00 http://dx.doi.org/10.1016/S0304-3975(00)00004-9 2003-11-19 Non-Clairvoyant Scheduling. 17-47 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#MotwaniPT94 2003-11-19 On the Tiling of a Torus with Two Bars. 415-426 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Remila94a 2003-11-19 Recognition of Graphs by Automata. 291-332 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Remila94b 2003-11-19 Compilation of the ELECTRE Reactive Language into Finite Transition Systems. 109-143 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#CassezR95 http://dx.doi.org/10.1016/0304-3975(94)00136-7 2003-11-19 Semantics of Horn and Disjunctive Logic Programs. 93-106 1991 86 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#LoboRM91 2003-11-19 Perfect (0, ±1)-matrices and perfect bidirected graphs. 339-356 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Tamura00 http://dx.doi.org/10.1016/S0304-3975(99)00203-0 2003-11-19 The Impact of the Number of Cooperating Grammars on the Generative Power. 249-262 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#SanteanK92 2003-11-19 Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos. 157-170 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#FavatiLM97 http://dx.doi.org/10.1016/S0304-3975(95)00022-4 2005-12-12 An Example of an Indexed Language of Intermediate Growth. 325-327 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#GrigorchukM99 http://dx.doi.org/10.1016/S0304-3975(98)00161-3 2003-11-19 Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay. 151-181 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Hildebrandt03 2005-07-25 A polynomial space construction of tree-like models for logics with local chains of modal connectives. 235-258 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00082-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#Demri03 2004-01-14 A Fully abstract presheaf semantics for SCCS with finite delay. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Hildebrandt99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 A Class of Decidable Information Logics. 33-60 1998 195 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#Demri98 http://dx.doi.org/10.1016/S0304-3975(97)00157-6 2003-11-19 Searching and Pebbling. 205-218 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#KirousisP86 2003-11-19 Scheduling in the dark. 109-141 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Edmonds00 http://dx.doi.org/10.1016/S0304-3975(99)00186-3 2003-11-19 Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. 1-41 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Edmonds97 http://dx.doi.org/10.1016/S0304-3975(96)00020-5 2003-11-19 Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. 295-317 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00848-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#DomosiNR03 2003-11-19 Hierarchically Specified Unit Disk Graphs. 23-65 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#MaratheRHR97 http://dx.doi.org/10.1016/S0304-3975(96)00008-4 2003-11-19 Deterministic Turing machines in the range between real-time and linear-time. 253-275 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#KleinK02 2003-11-19 Fast one-way cellular automata. 233-250 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00406-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#KleinK03 2003-11-19 Verified bytecode verifiers. 583-626 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00869-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#KleinN03 2003-11-19 A Tight Upper Bound for the Path Length of AVL Trees. 251-264 1990 72 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#KleinW90 2003-11-19 Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking. 203-219 1989 64 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#AkyildizB89 2003-11-19 Exact Solutions for Networks of Queues with Blocking-After-Service. 111-130 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#AkyildizB94 2003-11-19 Computing with Infinite Objects. 133-155 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Wiedmer80 2003-11-19 Communication in the two-way listen-in vertex-disjoint paths mode. 65-90 2001 264 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Bockenhauer01 http://dx.doi.org/10.1016/S0304-3975(00)00214-0 2003-11-19 Uniformly Growing k-TH Power-Free Homomorphisms. 69-82 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Brandenburg83 2003-11-19 A Note on: `Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'. 341-342 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Brandenburg87 2003-11-19 On the Intersection of Stacks and Queues. 69-80 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Brandenburg88 2003-11-19 The Ancestor Width of Grammars and Languages. 25-41 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Brandenburg98 http://dx.doi.org/10.1016/S0304-3975(98)00054-1 2003-11-19 Static Semantics, Types, and Binding Time Analysis. 95-118 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Jones91 2003-11-19 LOGSPACE and PTIME Characterized by Programming Languages. 151-174 1999 228 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#Jones99 http://dx.doi.org/10.1016/S0304-3975(98)00357-0 2003-11-19 Head Linear Reduction and Pure Proof Net Extraction. 111-137 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#MascariP94 2003-11-19 Least and greatest fixed points in intuitionistic natural deduction. 315-339 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#UustaluV02 http://dx.doi.org/10.1016/S0304-3975(00)00355-8 2003-11-19 While-Programs with Nondeterministic Assignments and the Logic Alna. 211-235 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#MascariZ85 2003-11-19 Event Structures and Trace Monoids. 285-313 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#RozoyT91 2003-11-19 On interreduction of semi-complete term rewriting systems. 435-451 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#Gramlich01 http://dx.doi.org/10.1016/S0304-3975(00)00030-X 2003-11-19 On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. 97-131 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#Gramlich96 http://dx.doi.org/10.1016/0304-3975(96)00042-4 2003-11-19 Fast pattern matching in indexed texts. 239-262 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Senellart00 http://dx.doi.org/10.1016/S0304-3975(98)00173-X 2003-11-19 Semantical Analysis of Perpetual Strategies in lambda-Calculus. 183-209 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#HonsellL99 http://dx.doi.org/10.1016/S0304-3975(98)00140-6 2003-11-19 A Structure to Decide Reachability in Petri Nets. 79-104 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Lambert92 2003-11-19 Monadic second-order logic on tree-like structures. 311-346 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Walukiewicz02 http://dx.doi.org/10.1016/S0304-3975(01)00185-2 2003-11-19 Gentzen-Type Axiomatization for PAL. 67-79 1993 118 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Walukiewicz93 2003-11-19 Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. 2109-2120 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CharonHL03 2003-11-19 Ensembles Presque Periodiques k-Reconnaissables. 141-145 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Christol79 2003-11-19 Analyse und Synthese von Asynchronen ND-Automaten. 261-266 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Starke76 2003-11-19 Critical Classes for the alpha_0-Product. 17-24 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#DomosiE88 2003-11-19 On complete systems of automata. 27-54 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#DomosiN00 http://dx.doi.org/10.1016/S0304-3975(99)00274-1 2003-11-19 Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. 355-362 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Weiermann95 http://dx.doi.org/10.1016/0304-3975(94)00135-6 2003-11-19 Semiretracts--a counterexample and some results. 117-127 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00096-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#ForysKA03 2003-11-19 Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. 1-51 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#BonsangueBR98 http://dx.doi.org/10.1016/S0304-3975(97)00042-X 2004-01-16 Approximability results for stable marriage problems with ties. 431-447 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00321-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#HalldorssonIIMMMS03 2003-11-19 A note on the strong and weak generative powers of formal systems. 243-259 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Joshi03 2003-11-19 Query complexity of membership comparable sets. 467-474 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(03)00082-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Tantau03 2003-11-19 Duality Beyond Sober Spaces: Topological Spaces and Observation Frames. 79-124 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#BonsangueJK95 http://dx.doi.org/10.1016/0304-3975(95)00048-2 2003-11-19 Functorial Theory of Parameterized Specifications in a General Specification Framework. 221-266 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#EhrigG94 2003-11-19 Compatibility of Parameter Passing and Implementation of Parameterized Data Types. 255-286 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#EhrigK83 2003-11-19 The ESPRIT Basic Research Working Group COMPUGRAPH "Computing by Graph Transformation": A Survey. 3-6 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#EhrigL93 2003-11-19 Parallelism and Concurrency of Graph Manipulations. 247-275 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#EhrigR80 2003-11-19 Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. 201-225 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#LouchardRS92 2003-11-19 Completion for Unification. 231-251 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#DoggazK91 2003-11-19 Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. 71-87 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Metivier85 2003-11-19 On Recognizable Subsets of Free Partially Commutative Monoids. 201-208 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Metivier88 2003-11-19 On the Interpretability of Arithmetic in Temporal Logic. 47-60 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Kroger90 2003-11-19 Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. 173-189 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#HarbaneH01 http://dx.doi.org/10.1016/S0304-3975(00)00240-1 2003-11-19 pi-Calculus, Internal Mobility, and Agent-Passing Calculi. 235-274 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#Sangiorgi96a http://dx.doi.org/10.1016/0304-3975(96)00075-8 2003-11-19 Lorentz gas cellular automata on graphs. 195-221 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00278-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#BunimovichK03 2003-11-19 On testing urgency through laziness over processes with durational actions. 393-407 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#CorradiniC01 http://dx.doi.org/10.1016/S0304-3975(00)00026-8 2003-11-19 A functorial semantics for multi-algebras and partial algebras, with applications to syntax. 293-322 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#CorradiniG02 2003-11-19 An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs. 51-106 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#CorradiniM92 2003-11-19 Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Programming. 7-48 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#CorradiniR93 2003-11-19 Ninth International Conference on Concurrency Theory 1998 - Editorial. 1 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#SangiorgiS02 http://dx.doi.org/10.1016/S0304-3975(00)00303-0 2003-11-19 Semantic Analysis of Inductive Reasoning. 81-89 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Orlowska86 2003-11-19 Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. 307-338 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Joung00 http://dx.doi.org/10.1016/S0304-3975(98)00224-2 2003-11-19 Formulas, Regular Languages and Boolean Circuits. 133-141 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Peladeau92a 2003-11-19 On the Algorithmic Complexity of Associative Algebras. 201-211 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#AlderS81 2003-11-19 Glueing and orthogonality for models of linear logic. 183-231 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#HylandS03 2003-11-19 Abstract Games for Linear Logic. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#HylandS99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Deciding Hypergraph 2-Colourability by H-Resolution. 343-347 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#LinialT85 2003-11-19 Parallel Algorithms for Certain Matrix Computations. 287-308 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#CodenottiDDL97 http://dx.doi.org/10.1016/S0304-3975(97)83810-8 2003-11-19 The Fourth Moment in Luby's Distribution. 133-140 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#DubhashiPSZ95 http://dx.doi.org/10.1016/0304-3975(95)00056-3 2003-11-19 Using Knowledge to Optimally Achieve Coordination in Distributed Systems. 31-65 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#NeigerB99 http://dx.doi.org/10.1016/S0304-3975(98)00236-9 2003-11-19 Abstract Interpretation: A Kind of Magic. 125-139 1995 142 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#Nilsson95 http://dx.doi.org/10.1016/0304-3975(94)00223-6 2003-11-19 On the design of efficient ATM routing schemes. 341-359 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#BecchettiBGG02 http://dx.doi.org/10.1016/S0304-3975(00)00396-0 2003-11-19 On Reversal Bounded Alternating Turing Machines. 331-339 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#LiskiewiczLP87 2003-11-19 The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. 129-156 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00080-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#LiskiewiczOT03 2003-11-19 Two-Way Deterministic Multi-Weak-Counter Machines. 27-37 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Miyano82 2003-11-19 Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems. 33-57 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Miyano91 2003-11-19 Foreword: Genome Informatics. 225-226 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Miyano99 http://dx.doi.org/10.1016/S0304-3975(98)00086-3 2003-11-19 A Resolution Rule for Well-Formed Formulae. 223-235 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#BhattaK91 2003-11-19 Automata and Concurrency. 221-265 1983 25 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#Priese83 2003-11-19 On a Fast Decomposition Method in Some Models of Concurrent Computations. 107-121 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Priese85 2003-11-19 How to decide continuity of rational functions on infinite words. 71-82 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Prieur01 http://dx.doi.org/10.1016/S0304-3975(99)00115-2 2003-11-19 How to decide continuity of rational functions on infinite words. 445-447 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Prieur02 http://dx.doi.org/10.1016/S0304-3975(01)00307-3 2003-11-19 Double Dipping: the Case of the Missing Binomial Coefficient Identities. 351-375 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Bennett94 2003-11-19 On the entropy of regular languages. 93-102 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00094-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Ceccherini-SilbersteinMS03 2003-11-19 Computations with a deck of cards. 671-678 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Stiglic01 http://dx.doi.org/10.1016/S0304-3975(00)00409-6 2003-11-19 On axioms for commutative regular equations without addition. 531-551 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#CrvenkovicD02 2005-02-09 On Kleene Algebras. 17-24 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#CrvenkovicM93 2003-11-19 On Dynamic Algebras. 79-86 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#CrvenkovicM94 2003-11-19 An Arithmetical Characterization of NP. 255-267 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#KentH82 2003-11-19 A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars. 129-154 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Tomita83 2003-11-19 An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata. 87-120 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Tomita84 2003-11-19 Parallel and serial hypercoherences. 39-81 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#Ehrhard00 http://dx.doi.org/10.1016/S0304-3975(00)00173-0 2003-11-19 On the Parallel Recognition of Unambiguous Context-Free Languages. 311-316 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#ChytilCMR91 2003-11-19 Parallel Product of Event Structures. 203-215 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#CastellaniZ97 http://dx.doi.org/10.1016/S0304-3975(96)00104-1 2004-02-19 Refinement of Actions in Event Structures and Causal Trees. 21-48 1993 118 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#DorondeauD93 2003-11-19 FUN with Algorithms - Foreword. 221-222 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#LodiPS02 http://dx.doi.org/10.1016/S0304-3975(01)00052-4 2003-11-19 Innocent game models of untyped lambda-calculus. 247-292 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#KerNO02 http://dx.doi.org/10.1016/S0304-3975(00)00353-4 2003-11-19 Adapting innocent game models for the Böhm treelambda -theory. 333-366 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00849-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#KerNO03 2003-11-19 Reducing space for index implementation. 185-197 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Crochemore03 2003-11-19 Sharp Characterizations of Squarefree Morphisms. 221-226 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Crochemore82 2003-11-19 Transducers and Repetitions. 63-86 1986 45 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Crochemore86 2003-11-19 String-Matching on Ordered Alphabets. 33-47 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Crochemore92 2003-11-19 On the Effects of Noise and Speed on Computations. 279-291 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#DelyonM94 2003-11-19 On the Necessity of Occam Algorithms. 157-184 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#BoardP92 2003-11-19 Approximations for Steiner trees with minimum number of Steiner points. 83-99 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#ChenDHLWX01 http://dx.doi.org/10.1016/S0304-3975(00)00182-1 2003-11-19 Decidability of the halting problem for Matiyasevich deterministic machines. 241-251 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Teytaud01 http://dx.doi.org/10.1016/S0304-3975(00)00117-1 2003-11-19 A Uniform Approach to Semi-Dynamic Problems on Digraphs. 69-90 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#CiceroneFNP98 http://dx.doi.org/10.1016/S0304-3975(97)00288-0 2003-11-19 Constructive Mathematics: A Foundation for Computable Analysis. 95-109 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Bridges99 http://dx.doi.org/10.1016/S0304-3975(98)00285-0 2003-11-19 The zero-one law holds for BPP. 283-288 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Melkebeek00 http://dx.doi.org/10.1016/S0304-3975(00)00191-2 2003-11-19 Applications of the representation of finite fields by matrices. 263-265 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#KernM00 http://dx.doi.org/10.1016/S0304-3975(00)00150-X 2003-11-19 Partial words and a theorem of Fine and Wilf revisited. 401-419 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Blanchet-SadriH02 http://dx.doi.org/10.1016/S0304-3975(00)00407-2 2003-11-19 Conjugacy on partial words. 297-312 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Blanchet-SadriL02 2003-11-19 Structure Theory of Equal Conflict Systems. 271-300 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#TeruelS96 http://dx.doi.org/10.1016/0304-3975(95)00124-7 2003-11-19 Computing with Graph Rewriting Systems with Priorities. 191-224 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#LitovskyM93 2003-11-19 Finite Acceptance of Infinite Words. 1-21 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#LitovskyS97 http://dx.doi.org/10.1016/S0304-3975(96)00006-0 2003-11-19 On Generators of Rational omega-Power Languages. 187-200 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#LitovskyT87 2003-11-19 The Three Subfamilies of Rational omega-Languages Closed under omega-Transduction. 243-250 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Timmerman90 2003-11-19 On Termination of One Rule Rewrite Systems. 395-401 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Lescanne94 2003-11-19 On the construction of stable models of untyped lambda-calculus. 23-46 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Kerth01 http://dx.doi.org/10.1016/S0304-3975(00)00371-6 2003-11-19 The Linear Abstract Machine. 157-180 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Lafont88 2003-11-19 On Recursive Path Ordering. 323-328 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#KrishnamoorthyN85 2004-02-17 Criteria to disprove context freeness of collage languages. 1445-1458 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DrewesKL03 2003-11-19 An Introduction to the Regular Theory of Fairness. 139-163 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#PrieseRW87 2003-11-19 Channel graphs of bit permutation networks. 139-143 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#TongHC01 http://dx.doi.org/10.1016/S0304-3975(00)00237-1 2003-11-19 On the algebraic models of lambda calculus. 197-240 2000 249 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Salibra00 http://dx.doi.org/10.1016/S0304-3975(00)00059-1 2003-11-19 Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. 319-336 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#EdelsbrunnerGPPSS92 2003-11-19 A Combinatorial Property of Codes Having Finite Synchronization Delay. 95-101 1975 1 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Restivo75 2003-11-19 Rational Languages and the Burnside Problem. 13-30 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Restivo85 2003-11-19 Finitely Generated Sofic Systems. 265-270 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Restivo89 2003-11-19 Codes and Local Constraints. 55-64 1990 72 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Restivo90 2003-11-19 A Note on Renewal Systems. 367-371 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Restivo92 2003-11-19 Analysis of Speciation and Niching in the Multi-Niche Crowding GA. 177-197 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#CedenoV99 http://dx.doi.org/10.1016/S0304-3975(99)00093-6 2003-11-19 A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. 147-150 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Wegener79a 2003-11-19 On the Complexity of Specification Morphisms. 239-248 1997 189 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#CiceroneP97 http://dx.doi.org/10.1016/S0304-3975(97)00106-0 2003-11-19 Semantique Asynchrone et Comportements Infinis en CSP. 277-298 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Fauconnier87 2003-11-19 Non-cryptographic primitive for pseudorandom permutation. 139-154 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00245-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#IwataYK03 2003-11-19 Computations of (alpha, k)-Machines. 247-265 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#StoklosaZ81 2003-11-19 Loop checking in SLD-derivations by well-quasi-ordering of goals. 221-246 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#PaciniS00 http://dx.doi.org/10.1016/S0304-3975(98)00167-4 2003-11-19 On the Notion of Expressiveness and the Rule of Adaption. 337-347 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Olderog83 2003-11-19 Correctnes of Programs with Pascal-Like Procedures without Global Variables. 49-90 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#Olderog84 2003-11-19 Correctness of Concurrent Processes. 263-288 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Olderog91 2003-11-19 On-Line Load Balancing. 73-84 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#AzarBK94 2003-11-19 The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines. 105-117 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Watanabe83 2003-11-19 On One-One Polynomial Time Equivalence Relations. 157-165 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Watanabe85 2003-11-19 A Comparison of Polynomial Time Completeness Notions. 249-265 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Watanabe87 2003-11-19 On the p-Isomorphism Conjecture. 337-343 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Watanabe91 2003-11-19 Moving a Food Trolley Around a Corner. 193-203 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#ErikssonEE98 http://dx.doi.org/10.1016/S0304-3975(97)00121-7 2003-11-19 Complete Sets and the Polynomial-Time Hierarchy. 23-33 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Wrathall76 2003-11-19 Searching Subsequences. 363-376 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Baeza-Yates91 2003-11-19 Bounded Disorder: The Effect of the Index. 21-38 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Baeza-Yates96 http://dx.doi.org/10.1016/S0304-3975(96)00061-8 2003-11-19 Intuitionistic Propositional Logic is Polynomial-Space Complete. 67-72 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Statman79 2003-11-19 On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. 329-338 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Statman81 2003-11-19 Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. 95-100 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Statman86 2003-11-19 On Sets of Solutions to Combinator Equations. 99-104 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Statman89 2003-11-19 Some Examples of Non-Existent Combinators. 441-448 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Statman93 2003-11-19 New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. 237-256 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Bodlaender91 2003-11-19 Complexity of Path-Forming Games. 215-245 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Bodlaender93 2003-11-19 <i>k</i>-Arboretum of Graphs with Bounded Treewidth. 1-45 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Bodlaender98 http://dx.doi.org/10.1016/S0304-3975(97)00228-4 2003-11-19 On Polynomial-Time Turing and Many-One Completeness in PSPACE. 199-215 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#WatanbeT92 2003-11-19 On the Complexity of Intersection and Conjugacy Problems in Free Groups. 279-295 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#AvenhausM84a 2003-11-19 Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. 211-250 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#BouajjaniH99 http://dx.doi.org/10.1016/S0304-3975(99)00033-X 2003-11-19 Proofs as computations in linear logic. 269-297 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#DelzannoM01 http://dx.doi.org/10.1016/S0304-3975(00)00024-4 2003-11-19 Computational Adequacy of the FIX-Logic. 217-242 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Crole94 2003-11-19 A Timed Model for Communicating Sequential Processes. 249-261 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#ReedR88 2003-11-19 The Timed Failures-Stability Model for CSP. 85-127 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#ReedR99 http://dx.doi.org/10.1016/S0304-3975(98)00214-X 2003-11-19 Uniform and nonuniform recognizability. 299-316 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Thomas03 2003-11-19 Remark on the Star-Height-Problem. 231-237 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Thomas81 2003-11-19 Infinite Trees and Automation-Definable Relations over omega-Words. 143-159 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Thomas92 2003-11-19 The Problem of Defining the Singular Points of Quasi-Linear Differential-Algebraic Systems. 49-79 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Thomas97 http://dx.doi.org/10.1016/S0304-3975(97)81843-9 2003-11-19 Some APX-completeness results for cubic graphs. 123-134 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#AlimontiK00 http://dx.doi.org/10.1016/S0304-3975(98)00158-3 2003-11-19 The Modal µ-Calculus Alternation Hierarchy is Strict. 133-153 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#Bradfield98 http://dx.doi.org/10.1016/S0304-3975(97)00217-X 2003-11-19 On viewing block codes as finite automata. 1775-1797 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ShankarDDR03 2003-11-19 <i>D = R</i>as Syntactic Monoids of Prefix Codes. 35-49 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Lallement76 2003-11-19 Algebraic Domain Equations. 167-196 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#EhrichL83 2003-11-19 Restriction categories I: categories of partial maps. 223-259 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#CockettL02 http://dx.doi.org/10.1016/S0304-3975(00)00382-0 2003-11-19 Restriction categories II: partial map classification. 61-102 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#CockettL03 2003-11-19 Strong Categorical Datatypes II: A Term Logic for Categorical Programming. 69-113 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#CockettS95 http://dx.doi.org/10.1016/0304-3975(94)00099-5 2003-11-19 Constructing Process Categories. 73-109 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#CockettS97 http://dx.doi.org/10.1016/S0304-3975(97)87171-X 2003-11-19 On Sets Polynomially Enumerable by Iteration. 203-225 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#HemachandraHSY91 2003-11-19 Subtyping Can Have a Simple Semantics. 81-96 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#BalstersF91 2003-11-19 Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. 181-203 1989 66 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#LevcopoulosLS89 2003-11-19 Index Sets and Presentations of Complexity Classes. 263-287 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Regan96 http://dx.doi.org/10.1016/0304-3975(95)00146-8 2003-11-19 The Rational Index of the Dyck Language D'*-1. 335-343 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#DeleageP86 2003-11-19 Parallel and Distributed Derivations in the Single-Pushout Approach. 123-143 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#EhrigL93a 2003-11-19 Fractional powers in Sturmian words. 363-376 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#JustinP01 http://dx.doi.org/10.1016/S0304-3975(99)90294-3 2003-11-19 Episturmian words and episturmian morphisms. 281-313 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#JustinP02 http://dx.doi.org/10.1016/S0304-3975(01)00207-9 2003-11-19 On a Question About Factorization Forests. 351-355 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#JustinP95 http://dx.doi.org/10.1016/0304-3975(94)00209-2 2003-11-19 On a Combinatorial Property of Sturmian Words. 387-394 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#JustinP96 http://dx.doi.org/10.1016/0304-3975(95)00077-1 2003-11-19 On the Status of Proving Program Properties in Effective Interpretations. 69-81 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Grabowski93 2003-11-19 Equational theories of tropical semirings. 417-469 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00864-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#AcetoEI03 2003-11-19 Translating a Linear Logic Programming Language into Java. 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#BanbaraT99 2003-11-19 On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based. 163-178 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#AcetoFI98 http://dx.doi.org/10.1016/S0304-3975(97)00104-7 2003-11-19 A Bound for the Degree of Nonholonomy in the Plane. 129-136 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Risler96 http://dx.doi.org/10.1016/0304-3975(95)00180-8 2003-11-19 On Gabbay's Temporal Fixed Point Operator. 1-25 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Hodkinson95 http://dx.doi.org/10.1016/0304-3975(94)00084-V 2003-11-19 Distributivity of categories of coalgebras. 131-143 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00582-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#GummHS03 2003-11-19 An Incremental Concept Formation Approach for Learning from Databases. 387-419 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#GodinM94 2003-11-19 On the Equivalence Problem for Regular Thue Systems. 237-245 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Narendran86 2003-11-19 Multihead One-Way Finite Automata. 135-153 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Kutylowski91 2003-11-19 Stack versus Sensitivity for One-Way Automata. 233-245 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Kutylowski93 2003-11-19 A Symbolic Reachability Graph for Coloured Petri Nets. 39-65 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#ChiolaDFH97 http://dx.doi.org/10.1016/S0304-3975(96)00010-2 2003-11-19 A fully dynamic algorithm for distributed shortest paths. 83-102 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00619-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#CiceroneSFN03 2003-11-19 Divergence of F< Type Checking. 131-162 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Ghelli95 http://dx.doi.org/10.1016/0304-3975(94)00037-J 2003-11-19 Entropie Topologique des Systemes Specifies. 121-128 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Petuaud89 2003-11-19 A declarative framework for object-oriented programming with genetic inheritance. 363-417 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Mateos-LagoR01 http://dx.doi.org/10.1016/S0304-3975(01)00013-5 2003-11-19 Langages Infinitaires et Produit de Mixage. 83-100 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Simone84a 2003-11-19 A pumping lemma for random permitting context languages. 959-967 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#EwertW02 http://dx.doi.org/10.1016/S0304-3975(01)00171-2 2003-11-19 Nivat's processes and their synchronization. 31-36 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Arnold02 http://dx.doi.org/10.1016/S0304-3975(02)00006-3 2003-11-19 Rational omega-Languages are Non-Ambiguous. 221-223 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Arnold83 2003-11-19 A Syntactic Congruence for Rational omega-Language. 333-335 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Arnold85 2003-11-19 Logical Definability of Fixed Points. 289-297 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Arnold88 2003-11-19 An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. 121-132 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Arnold95 http://dx.doi.org/10.1016/0304-3975(95)00069-9 2003-11-19 A new algorithm for linear regular tree pattern matching. 125-142 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#ShankarGYM00 http://dx.doi.org/10.1016/S0304-3975(98)00205-9 2003-11-19 Longest fault-free paths in star graphs with vertex faults. 215-227 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#HsiehCH01 http://dx.doi.org/10.1016/S0304-3975(00)00190-0 2003-11-19 The Functional Dimension of Inductive Definitions. 143-158 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Rougemont92 2003-11-19 A transition system semantics for the control-driven coordination language MANIFOLD. 3-47 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#BonsangueABRSZ00 http://dx.doi.org/10.1016/S0304-3975(99)00226-1 2003-11-19 Groups and tilings. 81-97 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#BeauquierF02 http://dx.doi.org/10.1016/S0304-3975(02)00008-7 2003-11-19 Une Note sur le Théorème de Caractérisation des Générateurs Algébriques. 117-127 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#BeauquierG87 2003-11-19 A codicity undecidable problem in the plane. 417-430 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(03)00029-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#BeauquierN03 2003-11-19 Languages and Scanners. 3-21 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#BeauquierP91 2003-11-19 Rabin Tree Automata and Finite Monoids. 13-25 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#BeauquierP94 2003-11-19 Decidable verification for reducible timed automata specified in a first order logic with time. 347-388 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#BeauquierS02 http://dx.doi.org/10.1016/S0304-3975(01)00186-4 2003-11-19 Tree-shellability of Boolean functions. 633-647 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#TakenagaNY01 http://dx.doi.org/10.1016/S0304-3975(00)00369-8 2003-11-19 On the parallel approximability of a subclass of quadratic programming. 217-231 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#SernaX01 http://dx.doi.org/10.1016/S0304-3975(99)00337-0 2003-11-19 Lazy Narrowing: Strong Completeness and Eager Variable Elimination. 95-130 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#MiddeldorpOI96 http://dx.doi.org/10.1016/0304-3975(96)00071-0 2003-11-19 On the Ordering of Sparse Linear Systems. 301-313 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Manzini96 http://dx.doi.org/10.1016/0304-3975(95)00151-4 2003-11-19 On Bounded Interpretations of Grammar Forms. 287-313 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Csuhaj-VarjuD91 2003-11-19 On the Power of Cooperation: A Regular Representation of Recursively Enumerable Languages. 305-310 1991 81 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Csuhaj-VarjuK91 2003-11-19 Descriptional Complexity of Context-Free Grammar Forms. 277-289 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#Csuhaj-VarjuK93 2003-11-19 Team Behaviour in Eco-Grammar Systems. 213-224 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Csuhaj-VarjuK98 http://dx.doi.org/10.1016/S0304-3975(97)00110-2 2003-11-19 The Simple Type Theory of Normalization by Evaluation. 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#Vestergaard01 2003-11-19 On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. 511-538 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Csuhaj-VarjuV01 http://dx.doi.org/10.1016/S0304-3975(99)00318-7 2003-11-19 Parallel communicating grammar systems with bounded resources. 205-219 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Csuhaj-VarjuV02 http://dx.doi.org/10.1016/S0304-3975(01)00172-4 2003-11-19 On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems. 349-358 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#Csuhaj-VarjuV99 http://dx.doi.org/10.1016/S0304-3975(98)00193-5 2003-11-19 On the Expressive Power of Temporal Logic for Infinite Words. 301-312 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Cohen-Chesnot91 2003-11-19 Sur la Combinatoire des Codes à Deux Mots. 61-80 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#RestR85 2003-11-19 Transitive Closure and Related Semiring Properties via Eliminants. 257-274 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#AbdaliS85 2003-11-19 Bases de Lyndon des algèbres de Lie libres partiellement commutatives. 217-226 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Lalonde93 2003-11-19 Analysis of Program Optimization Possibilities and Further Development. 17-36 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Pottosin91 2003-11-19 Finding Transversals for Sets of Simple Geometric Figures. 55-69 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Edelsbrunner85 2003-11-19 Polynomial-time identification of very simple grammars from positive data. 179-206 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00423-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Yokomori03 2003-11-19 On Purely Morphic Characterizations of Context-Free Languages. 301-308 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Yokomori87 2003-11-19 Localic sup-lattices and tropological systems. 311-346 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00702-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#ResendeV03 2003-11-19 Causal automata. 265-288 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Gunawardena92 2003-11-19 Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin. 179-186 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Brookes93 2003-11-19 Relating conflict-free stable transition and event models via redex families. 65-95 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#KhasidashviliG02 http://dx.doi.org/10.1016/S0304-3975(01)00235-3 2003-11-19 A comparison of identification criteria for inductive inference of recursive real-valued functions. 351-366 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#HirowatariA01 http://dx.doi.org/10.1016/S0304-3975(00)00275-9 2003-11-19 Full Abstraction and Recursion. 207-256 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#MisloveO95 http://dx.doi.org/10.1016/0304-3975(95)00052-X 2003-11-19 Episturmian words and some constructions of de Luca and Rauzy. 539-553 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#DroubayJP01 http://dx.doi.org/10.1016/S0304-3975(99)00320-5 2003-11-19 Dedication. 23 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#BrooksM02 http://dx.doi.org/10.1016/S0304-3975(00)00329-7 2003-11-19 Online strategies for backups. 43-53 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Damaschke02 http://dx.doi.org/10.1016/S0304-3975(01)00289-4 2003-11-19 Nearly optimal strategies for special cases of on-line capital investment. 35-44 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00727-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Damaschke03 2003-11-19 An Optimal Parallel Algorithm for Digital Curve Segmentation. 225-236 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#Damaschke97 http://dx.doi.org/10.1016/S0304-3975(96)00227-7 2004-07-01 On the presence of periodic configurations in Turing machines and in counter machines. 573-590 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BlondelCN02 2003-11-19 On the computational power of context-free PC grammar systems. 135-148 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Mandache00 http://dx.doi.org/10.1016/S0304-3975(98)00159-5 2003-11-19 From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis. 319-329 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Pour-El99 http://dx.doi.org/10.1016/S0304-3975(99)00294-7 2003-11-19 Mixed Computation and Compilation: New Approaches to Old Problems. 209-226 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Bulyonkov90 2003-11-19 From Partial Evaluation to Mixed Computation. 47-60 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Bulyonkov91 2003-11-19 Rapid Constructions of Algebraic Axioms From Samples. 199-208 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#BarzdinB91 2003-11-19 A lower bound for range enclosure in interval arithmetic. 83-95 2002 279 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#Hertling02 http://dx.doi.org/10.1016/S0304-3975(00)00428-X 2003-11-19 The Effective Riemann Mapping Theorem. 225-265 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Hertling99 http://dx.doi.org/10.1016/S0304-3975(98)00290-4 2003-11-19 Interconvertibility of a class of set constraints and context-free-language reachability. 29-98 2000 248 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#MelskiR00 http://dx.doi.org/10.1016/S0304-3975(00)00049-9 2003-11-19 Walks confined in a quadrant are not always D-finite. 257-276 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00219-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Bousquet-MelouP03 2003-11-19 On the drift of short schedules. 473-484 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#FeigeR02 2003-11-19 On the semantics of durational actions. 47-82 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#CorradiniFP01 http://dx.doi.org/10.1016/S0304-3975(00)00375-3 2003-11-19 A Coalgebraic presentation of structured transition systems. 27-55 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#CorradiniGH01 http://dx.doi.org/10.1016/S0304-3975(00)00121-3 2003-11-19 Compositional SOS and beyond: a coalgebraic view of open systems. 163-192 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#CorradiniHM02 http://dx.doi.org/10.1016/S0304-3975(01)00025-1 2003-11-19 Adequacy for a Lazy Functional Language with Recursive and Polymorphic Types. 243-275 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#BlaabergC94 2003-11-19 Cumulative defect. 97-109 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Bruyere03 2003-11-19 An Answer to a Question about Finite Maximal Prefix Sets of Words. 339-344 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Bruyere88 2003-11-19 Maximal Codes With Bounded Deciphering Delay. 53-76 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#Bruyere91 2003-11-19 On Maximal Codes with Bounded Synchronization Delay. 11-28 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Bruyere98 http://dx.doi.org/10.1016/S0304-3975(98)00028-0 2003-11-19 More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 3-29 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#DiksH98 http://dx.doi.org/10.1016/S0304-3975(97)00285-5 2003-11-19 Euclidean strings. 321-340 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00589-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#EllisRSS03 2003-11-19 Reliable Computations on Faulty EREW PRAM. 107-122 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#DiksP96 http://dx.doi.org/10.1016/0304-3975(95)00186-7 2003-11-19 System Diagnosis with Smallest Risk of Error. 163-173 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#DiksP98 http://dx.doi.org/10.1016/S0304-3975(97)00294-6 2003-11-19 How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms. 117-144 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#ColussiT96 http://dx.doi.org/10.1016/0304-3975(95)00137-9 2003-11-19 On Optimal Parallel Computations for Sequences of Brackets. 251-262 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#DiksR91 2003-11-19 A Characterization of Recognizable Picture Languages by Tilings by Finite Sets. 297-323 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Simplot99 http://dx.doi.org/10.1016/S0304-3975(98)00328-4 2003-11-19 An Abstract Machine for Concurrent Modular Systems: CHARM. 165-200 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#CorradiniMR94 2003-11-19 Finite Divergence. 113-139 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#HansenPC95 http://dx.doi.org/10.1016/0304-3975(94)00145-9 2003-11-19 Primitive recursion for higher-order abstract syntax. 1-57 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#SchurmannDP01 http://dx.doi.org/10.1016/S0304-3975(00)00418-7 2003-11-19 Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact. 265-332 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#LabhallaLM01 http://dx.doi.org/10.1016/S0304-3975(99)00139-5 2003-11-19 Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux. 69-92 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#LabhallaLM96 http://dx.doi.org/10.1016/0304-3975(95)00090-9 2003-11-19 Analysis of multiple quickselect variants. 45-91 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00729-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Panholzer03 2003-11-19 A Uniform Approach to Define Complexity Classes. 263-283 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#BovetCS92 2003-11-19 On a conjecture on bidimensional words. 123-150 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(01)00386-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#EpifanioKM03 2003-11-19 On Winning Strategies in Ehrenfeucht-Fraïssé Games. 97-121 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#AroraF97 http://dx.doi.org/10.1016/S0304-3975(96)00015-1 2003-11-19 On parsing and condensing substrings of LR languages in linear time. 61-82 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#Goeman01 http://dx.doi.org/10.1016/S0304-3975(00)00296-6 2003-11-19 Representation of Nondeterministic Information. 27-39 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#OrlowskaP84 2003-11-19 Coalgebra-to-Algebra Morphisms. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Eppendahl99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 The Ehrenfeucht Conjecture: An Algebra-Framework for Its Proof. 333-339 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Poulsen86 2003-11-19 Type dependencies for logic programs using ACI-unification. 131-159 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#CodishL00 http://dx.doi.org/10.1016/S0304-3975(98)00122-4 2003-11-19 Proving Implications by Algebraic Approximation. 57-74 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#CodishM96 http://dx.doi.org/10.1016/0304-3975(96)00040-0 2003-11-19 Minimisation of Acyclic Deterministic Automata in Linear Time. 181-189 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Revuz92 2003-11-19 A Representation of Fomega in LF. 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#SchurmannYN01 2003-11-19 2-Asynchronous Automata. 93-102 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#CoriSLR88 2003-11-19 A Property of Three-Element Codes. 215-222 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Karhumaki85a 2003-11-19 Multiple factorizations of words and defect effect. 81-97 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#KarhumakiM02 http://dx.doi.org/10.1016/S0304-3975(00)00435-7 2003-11-19 Conway's problem for three-word sets. 705-725 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#KarhumakiP02 2003-11-19 _infinityto within almost-polynomial factors is NP-hard. 55-71 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#Dinur02 http://dx.doi.org/10.1016/S0304-3975(01)00290-0 2003-11-19 On the Size of Independent Systems of Equations in Semigroups. 105-119 1996 168 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#KarhumakiP96 http://dx.doi.org/10.1016/S0304-3975(96)00064-3 2003-11-19 NP problems are tractable in the space of cellular automata in the hyperbolic plane. 99-128 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#MargensternM01 http://dx.doi.org/10.1016/S0304-3975(99)00328-X 2003-11-19 Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. 445-464 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#YenJL96 http://dx.doi.org/10.1016/S0304-3975(96)80714-6 2003-11-19 On the VC-Dimension of Depth four Threshold Circuits and the Complexity of Boolean-Valued Functions. 109-127 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Sakurai95 http://dx.doi.org/10.1016/0304-3975(94)00163-D 2003-11-19 Practical Proofs of Knowledge without Relying on Theoretical Proofs of Membership on Languages. 317-335 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Sakurai97 http://dx.doi.org/10.1016/S0304-3975(96)00277-0 2003-11-19 Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position. 305-320 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Szwerinski82 2003-11-19 Proof finding algorithms for implicational logics. 165-186 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#Bunder00 http://dx.doi.org/10.1016/S0304-3975(99)00174-7 2003-11-19 An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. 337-342 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Bunder85 2003-11-19 Lambda Terms Definable as Combinators. 3-21 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Bunder96 http://dx.doi.org/10.1016/S0304-3975(96)00111-9 2003-11-19 Resolution for Some First-Order Modal Systems. 213-229 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Cialdea91 2003-11-19 Lower Bounds on the Area Complexity of Boolean Circuits. 285-300 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#HromkovicLRSS92 2003-11-19 Categorical Abstract Machines for Higher-Order Typed lambda-Calculi. 125-162 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Ritter94 2003-11-19 Squaring transducers: an efficient procedure for deciding functionality and sequentiality. 45-63 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#BealCPS03 2003-11-19 Parameterized complexity of finding subgraphs with hereditary properties. 997-1008 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#KhotR02 2003-11-19 Selected Papers of the Workshop on Deductive Database Theory, Illiers-Combray, France, 1989, Forword. 1 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#Gardarin91 2003-11-19 A Characterisation of the Least-Fixed-Point Operator by Dinaturality. 301-314 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Simpson93 2003-11-19 The giant component threshold for random regular graphs with edge faults H. Prodinger. 307-321 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Goerdt01 http://dx.doi.org/10.1016/S0304-3975(00)00015-3 2003-11-19 Unrestricted Resolution versus N-Resolution. 159-167 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Goerdt92 2003-11-19 A Discrimination Algorithm Inside lambda-beta-Calculus. 265-292 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#BohmDPR79 2003-11-19 Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. 243-257 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#JiangIW94 2003-11-19 Effective simultaneous approximability of reals. 397-417 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Krupski02 http://dx.doi.org/10.1016/S0304-3975(01)00097-4 2003-11-19 Structure of Concurrency. 5-52 1993 112 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#JanickiK93 2003-11-19 Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards. 97-129 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#JanickiM90 2003-11-19 The Mixed Powerdomain. 311-334 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Gunter92 2003-11-19 Unification and extension of weighted finite automata applicable to image compression. 275-294 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00846-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#JiangVL03 2003-11-19 Alignment of Trees - An Alternative to Tree Edit. 137-148 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#JiangWZ95 http://dx.doi.org/10.1016/0304-3975(95)80029-9 2005-02-07 1-optimality of static BSP computations: scheduling independent chains as a case study. 1331-1359 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#GoldmanMT03 2003-11-19 On the expressive power of first-order boolean functions in PCF. 543-567 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#PucellaP01 http://dx.doi.org/10.1016/S0304-3975(00)00282-6 2003-11-19 Meta-Modelling for Formal Software Development. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#SreenivasVJ01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 On the number of occurrences of all short factors in almost all words. 2031-2035 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Tomescu03 2005-11-17 On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. 277-285 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Tomescu96 http://dx.doi.org/10.1016/0304-3975(95)00259-6 2003-11-19 On Words Containing all Short Subwords. 235-240 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#Tomescu98 http://dx.doi.org/10.1016/S0304-3975(97)00231-4 2003-11-19 On the structure of categories of coalgebras. 87-117 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#JohnstonePTWW01 http://dx.doi.org/10.1016/S0304-3975(00)00124-9 2003-11-19 Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht. 171-188 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Spehner85 2003-11-19 Le Calcul Rapide des Melanges de Deux Mots. 171-203 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Spehner86 2003-11-19 La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire. 341-381 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#Spehner88 2003-11-19 Merging in Maps and in Pavings. 205-232 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#Spehner91 2003-11-19 Generalizations of suffix arrays to multi-dimensional matrices. 223-238 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00828-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#KimKP03 2003-11-19 A Bijection Between Cliques in Graphs and Factorizations in Free Monoids. 209-223 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Spehner94 2003-11-19 On the Concentration of Infinite Traces. 35-54 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Diekert93a 2003-11-19 Foreword. 573 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#BerthiaumeR03 2003-11-19 On the Decidability of the Sequence Equivalence Problem for D0L-Systems. 75-84 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Culik76 2003-11-19 New Techniques for Proving the Decidability of Equivalence Problems. 29-45 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Culik90 2003-11-19 On Reversal-Bounded Picture Languages. 185-206 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#KimS92a 2003-11-19 Complexity of DNA sequencing by hybridization. 1459-1473 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BlazewiczK03 2003-11-19 Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree. 441-461 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#AulettaPP96 http://dx.doi.org/10.1016/0304-3975(96)00089-8 2003-11-19 Complexity Results for 1-Safe Nets. 117-136 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#ChengEP95 http://dx.doi.org/10.1016/0304-3975(94)00231-7 2003-11-19 A Design of a Parallel Dictionary Using Skip Lists. 1-33 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#GabarroMM96 http://dx.doi.org/10.1016/0304-3975(94)00288-6 2003-11-19 The Algorithmic Analysis of Hybrid Systems. 3-34 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#AlurCHHHNOSY95 http://dx.doi.org/10.1016/0304-3975(94)00202-T 2003-11-19 Preface. 355-357 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Nesetril02 2003-11-19 Some Nonstandard Ramsey Like Applications. 3-15 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#Nesetril84 2003-11-19 Series-parallel languages and the bounded-width property. 347-380 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#LodayaW00 http://dx.doi.org/10.1016/S0304-3975(00)00031-1 2003-11-19 Paths, Computations and Labels in the lambda-Calculus. 277-297 1995 142 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#AspertiL95 http://dx.doi.org/10.1016/0304-3975(94)00279-7 2003-11-19 Interaction Systems II: The Practice of Optimal Reductions. 191-244 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#AspertiL96 http://dx.doi.org/10.1016/0304-3975(95)00062-3 2003-11-19 Finite Semigroup Varieties Defined by Programs. 325-339 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#PeladeauST97 http://dx.doi.org/10.1016/S0304-3975(96)00297-6 2003-11-19 Graph Driven BDDs - A New Data Structure for Boolean Functions. 283-310 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#SielingW95 http://dx.doi.org/10.1016/0304-3975(94)00078-W 2003-11-19 Pattern Spectra, Substring Enumeration, and Automatic Sequences. 161-174 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#AlloucheMS92 2003-11-19 Gödel's Incompleteness Theorem. 239-319 1994 130 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#Uspensky94 2003-11-19 Why Does Information-Based Complexity Use the Real Number Model? 451-465 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Wozniakowski99 http://dx.doi.org/10.1016/S0304-3975(98)00300-4 2003-11-19 Algorithmes rélatifs á la décomposition dds oolynômes. 227-235 1976 1 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Mignotte76 2003-11-19 Intersection des Images de Certaines Suites Récurrentes Linéaires. 117-122 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Mignotte78 2003-11-19 Tests de Primalite. 109-117 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Mignotte80 2003-11-19 Sur l'équation de Catalan, II. 145-149 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Mignotte94 2003-11-19 Membership Problems for Data Dependencies in Relational Expressions. 315-335 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#ItoITK84 2003-11-19 Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines. 123-135 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#ItoITW95 http://dx.doi.org/10.1016/0304-3975(95)80028-8 2003-11-19 Probabilistic rebound Turing machines. 739-760 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#ZhangIIW02 http://dx.doi.org/10.1016/S0304-3975(01)00098-6 2003-11-19 The Knowledge Complexity of Quadratic Residuosity Languages. 291-317 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#SantisCP94 2006-03-14 Languages Whose n-Element Subsets Are Codes. 325-344 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#ItoJST92 2003-11-19 On the transition graphs of turing machines. 195-223 2003 2 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00655-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Caucal03a 2003-11-19 Asymptotically optimal declustering schemes for 2-dim range queries. 511-534 2003 3 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00742-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#SinhaBC03 2003-11-19 A Periodic Division Pattern that Cannot be Generated by D0L Systems. 205-218 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#BoerLT91 2003-11-19 The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models. 49-66 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#BusscheG95 http://dx.doi.org/10.1016/0304-3975(95)00025-R 2003-11-19 Nondeterminism and Infinite Computations in Constraint Programming. 37-78 1995 151 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#BoerPP95 http://dx.doi.org/10.1016/0304-3975(95)00047-Z 2003-11-19 A Functional LR Parser. 313-323 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#LeermakersAA92 2003-11-19 Applications du calcul formel à la balistique. 263-284 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#CarriereO97 http://dx.doi.org/10.1016/S0304-3975(97)00069-8 2003-11-19 Associative language descriptions. 463-491 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#CherubiniCP02 http://dx.doi.org/10.1016/S0304-3975(00)00417-5 2003-11-19 Unprovability of Theorems of Complexity Theory in Weak Number Theories. 259-268 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Leivant82 2003-11-19 Typing and Computational Properties of Lambda Expressions. 51-68 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#Leivant86 2003-11-19 Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. 309-322 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Leivant93 2003-11-19 A Formal Framework for Independence with Respect to Transactions in the Universal Relation Model. 303-327 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#LukassenV91 2003-11-19 Parametricity as Isomorphism. 163-181 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Robinson94 2003-11-19 New Protocols for the Election of a Leader in a Ring. 53-64 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Marchetti-Spaccamela87 2003-11-19 Argument Reduction by Factoring. 269-310 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#NaughtonRSU95 http://dx.doi.org/10.1016/0304-3975(94)00186-M 2003-11-19 Cyclic Rational Transductions and Polynomials of Rational Functions. 261-271 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Terlutte90 2003-11-19 Preface. 343-344 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#ArikawaFMM03 2003-11-19 Complexity of some problems in positive and related calculi. 171-185 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00450-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Maksimova03 2003-11-19 On-Line Chain Partitions of Orders. 283-292 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Felsner97 http://dx.doi.org/10.1016/S0304-3975(96)00204-6 2003-11-19 Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms. 143-173 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#CulikMORS78 2003-11-19 On the phenomenon of autocomputability. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Arslanov00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 On Elementary Computability-Theoretic Properties of Algorithmic Randomness. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#Arslanov01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Small Universal Turing Machines. 215-240 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Rogozhin96 http://dx.doi.org/10.1016/S0304-3975(96)00077-1 2003-11-19 Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. 21-71 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Bournez99 http://dx.doi.org/10.1016/S0304-3975(98)00096-6 2003-11-19 Stability in L Systems. 53-71 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Grefenstette83 2003-11-19 Corrigendum: Stability in L Systems. 347 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Grefenstette84 2003-11-19 The Complexity of Group Algebra Computations. 205-209 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Atkinson77 2003-11-19 Distributive Semantics for Nondeterministic Typed lambda-Calculi. 121-156 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#AstesianoC84 2003-11-19 Free Objects and Equational Deduction for Partial Conditional Specifications. 91-138 1995 152 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#AstesianoC95 http://dx.doi.org/10.1016/0304-3975(95)00246-5 2003-11-19 Formalism and method. 3-34 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#AstesianoR00 http://dx.doi.org/10.1016/S0304-3975(99)00205-4 2003-11-19 Parametric Channels via Label Expressions in CCS. 45-63 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#AstesianoZ84 2003-11-19 Self-stabilizing timestamps. 449-515 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00130-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#Abraham03 2003-11-19 On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers. 257-298 1995 149 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#Abraham95 http://dx.doi.org/10.1016/0304-3975(95)00013-M 2003-11-19 Reset Words for Commutative and Solvable Automata. 273-279 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Rystsov97 http://dx.doi.org/10.1016/S0304-3975(96)00136-3 2003-11-19 Structure Preserving Elimination of Null Productions from Context-Free Grammars. 43-54 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#Ukkonen82 2003-11-19 Approximate String Matching with q-grams and Maximal Matches. 191-211 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Ukkonen92 2003-11-19 ^T=C. 623-638 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Kirrinnis01 http://dx.doi.org/10.1016/S0304-3975(00)00322-4 2003-11-19 Combinatorial interpretation of Kolmogorov complexity. 111-123 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#RomashchenkoSV02 http://dx.doi.org/10.1016/S0304-3975(01)00034-2 2003-11-19 Denotational Semantics in the CPO and Metric Approach. 171-220 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#BaierM94 2003-11-19 Bounding Queries in the Analytic Polynomial-Time Hierarchy. 89-104 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#BaierW98 http://dx.doi.org/10.1016/S0304-3975(98)00057-7 2004-01-13 On-line load balancing of temporary tasks revisited. 325-340 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#LamTTW02 http://dx.doi.org/10.1016/S0304-3975(00)00392-3 2003-11-19 Séries de Malcev-Neumann sur le groupe libre et questions de ratonalité. 79-97 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Cauchon92 2003-11-19 Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. 677-700 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#KuceraM02 http://dx.doi.org/10.1016/S0304-3975(01)00094-9 2003-11-19 Entropy of Contact Circuits and Lower Bounds on Their Complexity. 113-129 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Jukna88 2003-11-19 Strictly causal functions have a unique fixed point. 483-488 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Naundorf00 http://dx.doi.org/10.1016/S0304-3975(99)00165-6 2003-11-19 Clustering for Petri nets. 145-197 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00597-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#Keller03 2003-11-19 Fast Rehashing in PRAM Emulations. 349-363 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Keller96 http://dx.doi.org/10.1016/0304-3975(95)00292-8 2003-11-19 Efficient web searching using temporal factors. 569-582 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#CzumajFGGLRZ01 http://dx.doi.org/10.1016/S0304-3975(00)00366-2 2003-11-19 The Complexity of Optimizing Finite-State Transducers. 323-336 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#RichS94 2003-11-19 Alternating Tree Automata. 305-318 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Slutzki85 2003-11-19 Probabilistic approach to the Satisfiability Problem. 65-75 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#DuboisC91 2003-11-19 New upper bounds to the limitedness of distance automata. 19-32 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#Hashiguchi00 http://dx.doi.org/10.1016/S0304-3975(97)00260-0 2003-11-19 Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1RR2 for given regular languages R1, R2. 853-859 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Hashiguchi02 2003-11-19 Erratum to "New upper bounds to the limitedness of distance automata". 2183 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Hashiguchi03 2003-11-19 A Decision Procedure for the Order of Regular Events. 69-72 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Hashiguchi79 2003-11-19 Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages. 53-66 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#Hashiguchi86 2003-11-19 Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages. 303-316 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Hashiguchi88 2003-11-19 Improved Limitedness Theorems on Finite Automata with Distance Functions. 27-38 1990 72 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#Hashiguchi90 2003-11-19 Recognizable Closures and Submonoids of Free Partially Commutative Monoids. 233-241 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#Hashiguchi91 2003-11-19 A Hoare-Like Verification System for a Language with an Exception Handling Mechanism. 319-335 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Szczepanska91 2003-11-19 An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. 639-652 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#JungS03 2003-11-19 Simple Operational and Denotational Semantics for Prolog with Cut. 193-208 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Billaud90 2003-11-19 Sur la Determination du Rang d'une Equation dans le Monoide Libre. 337-340 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Pecuchet81 2003-11-19 Automates Boustrophédon et Mots Infinis. 115-122 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Pecuchet85 2003-11-19 On the Complementation of Büchi Automata. 95-98 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Pecuchet86 2003-11-19 Etude Syntaxique des Parties Reconnaissables de Mots Infinis. 231-248 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Pecuchet88 2003-11-19 Characterization of State-Independent Automata. 1-10 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Grzymala-BusseB86 2003-11-19 On-Line Algorithms for Orders. 225-238 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#BouchitteR97 http://dx.doi.org/10.1016/S0304-3975(97)00200-4 2003-11-19 Listing all potential maximal cliques of a graph. 17-32 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#BouchitteT02 http://dx.doi.org/10.1016/S0304-3975(01)00007-X 2003-11-19 Power consumption in packet radio networks. 289-305 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#KirousisKKP00 http://dx.doi.org/10.1016/S0304-3975(98)00223-0 2003-11-19 Growth Problems for Avoidable Words. 319-345 1989 69 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#BakerMT89 2003-11-19 Relativizing Relativized Computations. 267-276 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#ImmermanM89 2003-11-19 An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. 167-204 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#GastinPZ94 2003-11-19 Coding properties of DNA languages. 1557-1579 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#HussiniKK03 2003-11-19 QuickHeapsort, an efficient mix of classical sorting algorithms. 25-42 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#CantoneC02 http://dx.doi.org/10.1016/S0304-3975(01)00288-2 2003-11-19 CTS Systems and Petri Nets. 149-162 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#AalbersbergR85 2003-11-19 Theory of Traces. 1-82 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#AalbersbergR88 2003-11-19 Stochastically Costed Tree Automata: Turakainen's Theorem. 145-158 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Louscou-Bozapalidou96 http://dx.doi.org/10.1016/0304-3975(95)00009-7 2003-11-19 Algebraic constraints, automata, and regular languages. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Khoussainov00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 On algebraic and logical specifications of classes of regular languages. 325-346 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00812-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Khoussainov03 2003-11-19 The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. 287-298 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#GuptaN96 http://dx.doi.org/10.1016/0304-3975(96)00046-1 2003-11-19 On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series. 291-299 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Varricchio92a 2003-11-19 A syntactical proof of the Marriage Lemma. 1107-1113 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Coquand03 2003-11-19 Categories of Embeddings. 221-237 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Coquand89 2003-11-19 Another Proof of the Intuitionistic Ramsey Theorem. 63-75 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Coquand93 2003-11-19 Star free expressions over the reals. 233-245 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#Rabinovich00 http://dx.doi.org/10.1016/S0304-3975(98)00050-4 2003-11-19 Finite variability interpretation of monadic logic of order. 111-125 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Rabinovich02 http://dx.doi.org/10.1016/S0304-3975(01)00126-8 2005-07-25 Automata over continuous time. 331-363 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00331-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#Rabinovich03 2003-11-19 On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. 197-214 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#Rabinovich98 http://dx.doi.org/10.1016/S0304-3975(97)00075-3 2003-11-19 Recursive quasi-metric spaces. 17-42 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00692-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Brattka03 2003-11-19 Recursive Characterization of Computable Real-Valued Functions and Relations. 45-77 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Brattka96 http://dx.doi.org/10.1016/0304-3975(95)00249-9 2003-11-19 Computable Invariance. 3-20 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Brattka99 http://dx.doi.org/10.1016/S0304-3975(98)00095-4 2003-11-19 Performance of Fault-Tolerant Data and Compute Intensive Programs over a Network of Workstations. 319-345 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#SmithS98 http://dx.doi.org/10.1016/S0304-3975(97)00206-5 2003-11-19 On the Inference of Approximate Programs. 249-266 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#SmithV90 2005-11-08 Flexible High-Order Discretization of Geometric Data for Global Motion Planning. 53-77 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#ElihaiY96 http://dx.doi.org/10.1016/0304-3975(95)00175-1 2003-11-19 Confluence in Concurrent Constraint Programming. 281-315 1997 183 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#FalaschiGMP97 http://dx.doi.org/10.1016/S0304-3975(97)00328-9 2003-11-19 Frequency Computation and Bounded Queries. 177-192 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#BeigelGK96 http://dx.doi.org/10.1016/0304-3975(95)00149-2 2003-11-19 The Verus language: representing time efficiently with BDDs. 95-118 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#CamposC01 http://dx.doi.org/10.1016/S0304-3975(00)00090-6 2003-11-19 Advances in the Theory and Practice of Graph Drawing. 235-254 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Tamassia99 http://dx.doi.org/10.1016/S0304-3975(98)00272-2 2003-11-19 Recursive Ascent Parsing: From Earley to Marcus. 299-312 1992 104 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Leermakers92 2003-11-19 On the Number of Databases and Closure Operations. 377-381 1991 78 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#BuroschDKKS91 2003-11-19 Construction de Codes Factorisants. 99-108 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Felice85 2003-11-19 Finite Biprefix Sets of Paths in a Graph. 103-128 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Felice88 2003-11-19 Construction of a Family of Finite Maximal Codes. 157-184 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Felice89 2003-11-19 An Application of Hajós Factorizations to Variable-Length Codes. 223-252 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Felice96 http://dx.doi.org/10.1016/0304-3975(95)00223-5 2003-11-19 ICALP, EATCS and Maurice Nivat. 25-30 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#RozenbergS02 http://dx.doi.org/10.1016/S0304-3975(02)00005-1 2005-04-25 DNA computing by blocking. 653-665 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#RozenbergS03 2003-11-19 On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms. 267-288 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#RozenbergV81 2003-11-19 Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms. 301-326 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#RozenbergV83 2003-11-19 On Simulation and Propagating E0L Forms. 41-48 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#RozenbergV84 2003-11-19 On Context-Free Trees. 33-50 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Cazanescu85 2003-11-19 A Model of Finite Automata on Timed omega-Trees. 2001 42 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#TorreN01 http://www.elsevier.nl/locate/entcs/volume42.html 2003-11-19 Finite automata on timed omega-trees. 479-505 2003 293 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#TorreN03 2003-11-19 Structured Algebraic Specifications: A Kernel Language. 123-249 1986 42 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs42.html#Wirsing86 2005-04-27 A representation theorem for recovering contraction relations satisfying wci. 545-564 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ZhuLXCZ03 2003-11-19 A General Adequacy Result for a Linear Functional Language. 27-58 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Brauner97 http://dx.doi.org/10.1016/S0304-3975(96)00233-2 2003-11-19 Categorical foundations for randomly timed automata. 393-427 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00894-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#MateusMNPSS03 2003-11-19 On the universality of Post and splicing systems. 157-170 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#FerrettiMKY00 http://dx.doi.org/10.1016/S0304-3975(99)00097-3 2006-05-02 On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity. 53-62 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00444-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#CegielskiHR03 2003-11-19 Fixed Points in Free Process Algebras, Part I. 275-294 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#BensonT89 2003-11-19 Architecture independent parallel selection with applications to parallel priority queues. 119-142 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00572-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#GerbessiotisS03 2003-11-19 Shallow Grates. 389-395 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Klawe94 2003-11-19 On three variants of rewriting P systems. 201-215 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00581-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#FerrettiMPZ03 2003-11-19 A Simple Sequent Calculus for Partial Functions. 317-330 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Elvang-GoranssonO93 2003-11-19 Periodic Character Sequences where Identifying two Characters Strictly Reduces the Period. 167-192 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#ImoriY85 2003-11-19 Declarative Modeling of the Operational Behavior of Logic Languages. 289-318 1989 69 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#FalaschiLPM89 2003-11-19 From rewrite rules to bisimulation congruences. 183-230 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#Sewell02 http://dx.doi.org/10.1016/S0304-3975(00)00309-1 2003-11-19 On the Computational Complexity of Dynamic Graph Problems. 233-277 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#RamalingamR96 http://dx.doi.org/10.1016/0304-3975(95)00079-8 2003-11-19 A shifting algorithm for continuous tree partitioning. 353-380 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#BeckerSC02 http://dx.doi.org/10.1016/S0304-3975(01)00075-5 2003-11-19 Bottom-Up Evaluation and Query Optimization of Well-Founded Models. 145-184 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#KempSS95 http://dx.doi.org/10.1016/0304-3975(94)00153-A 2003-11-19 Querying Disjunctive Databases Through Nonmonotonic Logics. 321-363 1996 160 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#BonattiE96 http://dx.doi.org/10.1016/0304-3975(95)00192-1 2003-11-19 On the complexity of finding common approximate substrings. 407-430 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00320-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#EvansSW03 2003-11-19 Optimal Algorithms for Sensitivity Analysis in Associative Multiplication Problems. 79-90 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Rosenthal81 2003-11-19 General Information Dispersal Algorithms. 87-105 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#BeguinC98 http://dx.doi.org/10.1016/S0304-3975(97)00098-4 2003-11-19 A Shared-Memory Implementation of the Hierarchical Radiosity Method. 215-240 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#PodehlRR98 http://dx.doi.org/10.1016/S0304-3975(97)00202-8 2003-11-19 IAP for dummies: The YAP Design. 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#CorreiaC99 2003-11-19 Alternating Finite Automata on omega-Words. 321-330 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#MiyanoH84 2003-11-19 Successive Approximation in Parallel Graph Algorithms. 19-35 1990 74 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#FussellT90 2003-11-19 Reachability is Decidable in the Numbers Game. 431-439 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Eriksson94 2003-11-19 Sense of direction in distributed computing. 29-53 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#FlocchiniMS03 2003-11-19 The Meet Operation in the Lattice of Codes. 117-129 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#BruyereDL98 http://dx.doi.org/10.1016/S0304-3975(96)00318-0 2003-11-19 On Some Decision Problems for Trace Codings. 227-260 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#BruyereFG95 http://dx.doi.org/10.1016/0304-3975(95)00036-V 2003-11-19 Computing on anonymous networks with sense of direction. 355-379 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00592-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#FlocchiniRS03 2003-11-19 Strong Fairness and Ultra Metrics. 121-140 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#PrieseN92 2003-11-19 A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. 219-256 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#PrieseW98 http://dx.doi.org/10.1016/S0304-3975(97)00169-2 2003-11-19 Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. 233-248 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#DeniseZ99 http://dx.doi.org/10.1016/S0304-3975(98)00323-5 2003-11-19 On the longest perpetual reductions in orthogonal expression reduction systems. 737-772 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Khasidashvili01 http://dx.doi.org/10.1016/S0304-3975(00)00372-8 2003-11-19 Frozen development in graph coloring. 227-264 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#CulbersonG01 http://dx.doi.org/10.1016/S0304-3975(01)00164-5 2003-11-19 Algebra of Communicating Processes - Preface to the Special Issue. 285-286 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#PonseVV97 http://dx.doi.org/10.1016/S0304-3975(96)00249-6 2003-11-19 Martin's game: a lower bound for the number of sets. 871-876 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#game02 2003-11-19 An Asymptotic Equality for the Number of Necklaces in a Shuffle-Exchange Network. 355-365 1992 102 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#PrasadI92 2003-11-19 A Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons. 249-263 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#PrasadI95 http://dx.doi.org/10.1016/0304-3975(95)95693-E 2003-11-19 Rational Probability Measures. 171-188 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#HanselP89 2003-11-19 Towards Language-Agnostic Mobile Code. 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#HouselSHDF01 2006-02-03 A Generalised Mathematical Theory of Structured Programming. 145-171 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#FentonWK85 2006-01-11 Complexity Analysis of Term-Rewriting Systems. 261-282 1989 67 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#ChoppyKS89 2003-11-19 Nets, Sequential Components and Concurrency Relations. 87-121 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Janicki84 2003-11-19 Transforming Sequential Systems into Concurrent Systems. 27-58 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Janicki85 2003-11-19 Is Strategic Programming a Viable Paradigm? 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#Klint01 2003-11-19 Mixed Product and Asynchronous Automata. 183-199 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Duboc86a 2003-11-19 Some Remarks on Non-Algebraic Adherences. 341-349 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Istrail82a 2003-11-19 A probabilistic algorithm for updating files over a communication link. 191-199 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#Evfimievski00 http://dx.doi.org/10.1016/S0304-3975(98)00019-X 2003-11-19 Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization. 83-103 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#IstrailM83 2003-11-19 Coping with Known Patterns of Lies in a Search Game. 85-94 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#RavikumarL84 2003-11-19 Normalization, approximation, and semantics for combinator systems. 975-1019 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BakelF03 2003-11-19 Operators on classes of coalgebras. 419-431 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#MasulovicT01 http://dx.doi.org/10.1016/S0304-3975(01)00014-7 2003-11-19 A Generalized Counter Scheme. 271-278 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#LamSY81 2003-11-19 Upper bounds on the satisfiability threshold. 187-197 2001 265 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Dubois01 http://dx.doi.org/10.1016/S0304-3975(01)00161-X 2003-11-19 Counting the Number of Solutions for Instances of Satisfiability. 49-64 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Dubois91 2003-11-19 Mutual Exclusion Scheduling. 225-243 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#BakerC96 http://dx.doi.org/10.1016/0304-3975(96)00031-X 2003-11-19 A Second Step Toward the Polynomial Hierarchy. 177-187 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#BakerS79 2003-11-19 Matching Patterns in Strings Subject to Multi-Linear Transformations. 231-254 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#Eilam-TzoreffV88 2003-11-19 On sparse evaluation representations. 119-147 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#Ramalingam02 http://dx.doi.org/10.1016/S0304-3975(00)00315-7 2003-11-19 Strategies anticipating a difference in search depth using opponent-model search. 83-104 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#GaoIUH01 http://dx.doi.org/10.1016/S0304-3975(00)00077-3 2003-11-19 Interval routing in some planar networks. 1503-1540 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#ChepoiR03 2003-11-19 A Class of Boolean Functions with Linear Combinational Complexity. 161-183 1975 1 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#HarperHS75 2003-11-19 BABEL 2001 - Preface. 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#BentonK01 2003-11-19 Unifying Concurrency Control and Recovery of Transactions with Semantically Rich Operations. 363-396 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#VingralekHBS98 http://dx.doi.org/10.1016/S0304-3975(97)00095-9 2003-11-19 Periodicity and Ultimate Periodicity of D0L Systems. 19-33 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Lando91 2003-11-19 Parallel String Matching with k Mismatches. 341-348 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#GalilG87 2003-11-19 Speeding up Dynamic Programming with Applications to Molecular Biology. 107-118 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#GalilG89 2003-11-19 Cyclic Ordering is NP-Complete. 179-182 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#GalilM77 2003-11-19 Dynamic Programming with Convexity, Concavity, and Sparsity. 49-76 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#GalilP92 2003-11-19 Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. 331-336 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#GalilS81 2003-11-19 Decompositions of Nondeterministic Reductions. 175-181 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Lange88 2003-11-19 Unambiguity of Circuits. 77-94 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#Lange93 2006-02-07 Variations on the Bagdomain Theme. 3-20 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Johnstone94 2003-11-19 Two applications of analytic functors. 113-175 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#Hasegawa02 http://dx.doi.org/10.1016/S0304-3975(00)00349-2 2003-11-19 Several Applications of Analytic Functors to Theoretical Computer Science. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Hasegawa99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 A relation - algebraic approach to the region connection calculus. 63-83 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#DuntschWM01 http://dx.doi.org/10.1016/S0304-3975(99)00156-5 2003-11-19 On the Linearity of On-Line Computable Functions. 117-132 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Pelibossian96 http://dx.doi.org/10.1016/0304-3975(95)00251-0 2003-11-19 Iterative Factor Algebras and Induced Metrics. 287-298 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Parisi-Presicce84 2003-11-19 Foundations of Rule-Based Design of Modular Systems. 131-155 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Parisi-Presicce91 2003-11-19 The Complexity of Computing Symmetric Functions Using Threshold Circuits. 253- 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#BeameBL92 2003-11-19 Additive models of probabilistic processes. 481-519 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Ying02a http://dx.doi.org/10.1016/S0304-3975(01)00294-8 2003-11-19 Fast Average-Case Pattern Matching by Multiplexing Sparse Tables. 165-179 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Quong92 2003-11-19 Adding Relational Query Facilities to Software Development Environments. 213-230 1990 73 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Horwitz90 2003-11-19 Recursive equations in higher-order process calculi. 839-852 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#YingW01 http://dx.doi.org/10.1016/S0304-3975(00)00378-9 2003-11-19 Closures and Fairness in the Semantics of Programming Logic. 167-184 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#LassezM84 2003-11-19 Optimal Fixedpoints of Logic Programs. 15-25 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#LassezM85 2003-11-19 MLOG: A Strongly Typed Confluent Functional Language with Logical Variables. 201-223 1994 122 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#Poirriez94 2003-11-19 The Variety of Kleene Algebras with Conversion is not Finitely Based. 235-245 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#CrvenkovicDE00 http://dx.doi.org/10.1016/S0304-3975(99)00079-1 2003-11-19 Generic Sort-Preserving Traversal Strategies. 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#Lammel01 2003-11-19 Comments on "Tautology Testing with a Generalized Matrix Reduction Method". 341 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Ben-Ari80 2003-11-19 Least Fixed Points Revisited. 155-181 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Bakker76 2003-11-19 An approximate A* algorithm and its application to the SCS problem. 2021-2029 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#NicosiaO03 2003-11-19 Asynchronous Automata Versus Asynchronous Cellular Automata. 179-207 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Pighizzini94 2003-11-19 Fibonacci arrays and their two-dimensional repetitions. 263-273 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#ApostolicoB00 http://dx.doi.org/10.1016/S0304-3975(98)00182-0 2003-11-19 Efficient Detection of Quasiperiodicities in Strings. 247-265 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#ApostolicoE93 2003-11-19 Optimal Off-Line Detection of Repetitions in a String. 297-315 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#ApostolicoP83 2003-11-19 Planar Graph Coloring is not Self-Reducible, Assuming P != NP. 183-189 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#KhullerV91 2003-11-19 An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. 103-128 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#LakshmananM87 2003-11-19 Uni-transitional Watson-Crick D0L systems. 537-553 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Salomaa02 http://dx.doi.org/10.1016/S0304-3975(02)00026-9 2003-11-19 Composition sequences for functions over a finite domain. 263-281 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Salomaa03 2003-11-19 On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions. 283-296 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Salomaa86 2003-11-19 A Pumping Result for 2-Context-Free Languages. 267-287 1988 62 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Salomaa88 2003-11-19 A Deterministic Algorithm for Modular Knapsack Problems. 127-138 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Salomaa91 2003-11-19 Synchronized Tree Automata. 25-51 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Salomaa94 2003-11-19 Decidability of Equivalence for Deterministic Synchronized Tree Automata. 171-192 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#Salomaa96 http://dx.doi.org/10.1016/0304-3975(96)00073-4 2005-09-28 On the support of graph Lie algebras. 283-294 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#DuchampLL02 http://dx.doi.org/10.1016/S0304-3975(00)00446-1 2003-11-19 Plane and Projective Meanders. 227-241 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#LandoZ93 2003-11-19 Partitioning vertices of 1-tough graphs into paths. 255-261 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#BazganHLW01 http://dx.doi.org/10.1016/S0304-3975(00)00247-4 2003-11-19 A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. 223-230 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#TomitaS85 2003-11-19 A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict. 39-53 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#TomitaS89 2003-11-19 Verification in loosely synchronous queue-connected discrete timed automata. 1713-1735 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#IbarraDP03 2003-11-19 Discrete Warehouse Problem. 231-247 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#SarrafzadehM95 http://dx.doi.org/10.1016/0304-3975(94)00192-L 2003-11-19 Distributed Algorithms in Synchronous Broadcasting Networks. 171-184 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#GalilLY87 2003-11-19 Limit Values of the Recurrence Quotient of Sturmian Sequences. 3-12 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#Cassaigne99 http://dx.doi.org/10.1016/S0304-3975(98)00247-3 2003-11-19 A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. 301-313 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#IbarraJW92 2003-11-19 On the Complexity of Simple Arithmetic Expressions. 17-28 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#IbarraLM82 2003-11-19 The tree equivalence of linear recursion schemes. 1-29 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Sabelfeld00 http://dx.doi.org/10.1016/S0304-3975(98)00207-2 2003-11-19 An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes. 265-279 1990 71 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Sabelfeld90 2003-11-19 On the Control Power of Integer Division. 35-52 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#IbarraMR83 2003-11-19 A type system for JVM threads. 741-778 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Laneve03 2003-11-19 On Efficient Recognition of Transductions and Relations. 89-106 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#IbarraPC85 2003-11-19 On modelling mobility. 147-176 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#Amadio00 http://dx.doi.org/10.1016/S0304-3975(99)00230-3 2003-11-19 Fast Parallel Language Recognition by Cellular Automata. 231-246 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#IbarraPK85 2003-11-19 On the power of incremental learning. 277-307 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#LangeG02 2003-11-19 Variants of iterative learning. 359-376 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#LangeG03 2003-11-19 Decision lists over regular patterns. 71-87 2003 1 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00419-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#LangeN03 2003-11-19 Synchronized Finite Automata and 2DFA Reductions. 261-275 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#IbarraT93a 2003-11-19 Factoring polynomials over arbitrary finite fields. 301-308 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#LangeW00 http://dx.doi.org/10.1016/S0304-3975(99)00291-1 2003-11-19 Recurrent Words and Simultaneous Growth in T0L Systems. 1-15 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#LangeW85 2003-11-19 Process languages and nets. 161-181 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Czaja00 http://dx.doi.org/10.1016/S0304-3975(98)00124-8 2003-11-19 Finite Automata with Multiplication. 271-294 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#IbarraSK76 2003-11-19 Mobile ambients. 177-213 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#CardelliG00 http://dx.doi.org/10.1016/S0304-3975(99)00231-5 2003-11-19 On the Parallel Complexity of Loops. 381-395 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#IbarraTY97 http://dx.doi.org/10.1016/S0304-3975(96)00184-3 2003-11-19 Maximality Preserving Bisimulation. 165-183 1992 102 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Devillers92 2003-11-19 An Introduction to Randomization in Computational Geometry. 35-52 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Devillers96 http://dx.doi.org/10.1016/0304-3975(95)00174-3 2003-11-19 Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. 157-180 1989 66 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#EdelsbrunnerRW89 2003-11-19 On the sensitivity of additive cellular automata in Besicovitch topologies. 341-354 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00591-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Formenti03 2003-11-19 Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA. 347-356 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#AmtoftT92 2003-11-19 Asymptotic orbits of primitive substitutions. 439-450 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00889-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#BargeDH03 2003-11-19 Functional Equations Associated with Congruential Functions. 397-406 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Burckel94 2003-11-19 Closed Iterative Calculus. 371-378 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Burckel96 http://dx.doi.org/10.1016/0304-3975(95)00171-9 2003-11-19 Statistical Dynamics of the Royal Road Genetic Algorithm. 41-102 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#NimwegenCM99 http://dx.doi.org/10.1016/S0304-3975(99)00119-X 2003-11-19 Confluence for Graph Transformations. 329-348 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#MicheauxR96 http://dx.doi.org/10.1016/0304-3975(95)00007-0 2003-11-19 A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation. 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#AkamaNK01 2003-11-19 Correspondence and translation for heterogeneous data. 179-213 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#AbiteboulCM02 http://dx.doi.org/10.1016/S0304-3975(01)00128-1 2003-11-19 On-Line Scheduling of Jobs with Fixed Start and End Times. 5-16 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#Woeginger94 2003-11-19 On the Representation and Querying of Sets of Possible Worlds. 158-187 1991 78 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs78.html#AbiteboulKG91 2003-11-19 Almost k-wise independence and hard Boolean functions. 281-295 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00643-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Kabanets03 2003-11-19 Conjugacy and episturmian morphisms. 1-34 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00726-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Richomme03 2003-11-19 Encoding Hamiltonian circuits into multiplicative linear logic. 987-996 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#KrantzM01 http://dx.doi.org/10.1016/S0304-3975(00)00381-9 2003-11-19 A generalized topological view of motion in discrete space. 111-134 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00701-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Galton03 2004-12-15 A Data Structure Useful for Finding Hamiltonian Cycles. 419-424 1990 71 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#ChrobackSK90 2003-11-19 Essence of Generalized Partial Computation. 61-79 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#FutamuraNT91 2003-11-19 A Function for Evaluating the Computing Time of a Bubbling System. 315-324 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#SadoI87 2003-11-19 A Slight Strengthening of a Theorem of Blair and Kunen. 175-181 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Doets92 2003-11-19 Left Termination Turned into Termination. 180-187 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Doets94 2003-11-19 Intractability of decision problems for finite-memory automata. 297-308 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#SakamotoI00 http://dx.doi.org/10.1016/S0304-3975(99)00105-X 2003-11-19 Aggregate Operations in the Information Source Tracking Method. 421-442 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Sadri94 2003-11-19 Computing with Infinitary Logic. 101-128 1995 149 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#AbiteboulVV95 http://dx.doi.org/10.1016/0304-3975(95)00027-T 2003-11-19 A Characterization of Power-Free Morphisms. 117-122 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Leconte85 2003-11-19 Orthogonal Projection Onto the Free Lie Algebra. 227-239 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Duchamp91 2003-11-19 Polygonal Radix Representations of Complex Numbers. 159-171 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Safer99 http://dx.doi.org/10.1016/S0304-3975(98)00100-5 2003-11-19 Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions. 273-287 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Sagan93 2003-11-19 Comparing three semantics for Linda-like languages. 49-90 2000 240 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#BusiGZ00 http://dx.doi.org/10.1016/S0304-3975(99)00227-3 2003-11-19 A Process Algebraic View of Linda Coordination Primitives. 167-199 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#BusiGZ98 http://dx.doi.org/10.1016/S0304-3975(97)00149-7 2003-11-19 Expressive power of SQL. 379-404 2003 3 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00736-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Libkin03 2003-11-19 Models of Approximation in Databases. 167-210 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#Libkin98 http://dx.doi.org/10.1016/S0304-3975(97)00090-X 2003-11-19 Periodicity, morphisms, and matrices. 107-121 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00398-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#CautisMSWY03 2003-11-19 Translation of Logic Programs into Functional Fixpoint Equations. 253-274 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#GardarinGM89 2003-11-19 Monads, shapely functors, and traversals. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#MoggiBJ99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Two-Way Automata with More than one Storage Medium. 267-280 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#VogelW85 2003-11-19 Net Processes Correspond to Derivation Processes in Graph Grammars. 275-305 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#KreowskiW86 2003-11-19 Complexity for Finite Factors of Infinite Sequences. 177-195 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#FerencziK99 http://dx.doi.org/10.1016/S0304-3975(98)00258-8 2003-11-19 Logicality of conditional rewrite systems. 209-232 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#YamadaALM00 http://dx.doi.org/10.1016/S0304-3975(99)00210-8 2003-11-19 A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men. 305-323 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#AndreaeHW99 http://dx.doi.org/10.1016/S0304-3975(98)00203-5 2003-11-19 Ulam's Searching Game with a Fixed Number of Lies. 307-321 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Spencer92 2003-11-19 Randomization, Derandomization and Antirandomization: Three Games. 415-429 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Spencer94 2003-11-19 Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives. 379-391 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Dolev79 2003-11-19 Partial Derivatives of Regular Expressions and Finite Automaton Constructions. 291-319 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Antimirov96 http://dx.doi.org/10.1016/0304-3975(95)00182-4 2003-11-19 Dynamics of Equivalence Relations in Automata Networks. 355-367 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Saito91 2003-11-19 An Algebraic Structure for Derivations in Rewriting Systems. 205-224 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Velinov88 2003-11-19 Valentin M. Antimirov (1961-1995). 289-290 1996 155 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#KucherovLM96 2003-11-19 A note on iterated duals of certain topological spaces. 69-77 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Burdick02 http://dx.doi.org/10.1016/S0304-3975(00)00414-X 2003-11-19 New Methods for 3-SAT Decision and Worst-case Analysis. 1-72 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#Kullmann99 http://dx.doi.org/10.1016/S0304-3975(98)00017-6 2003-11-19 Analysis of security protocols as open systems. 1057-1106 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Martinelli03 2003-11-19 Regularity of Sets of Initial Strings of Periodic D0L-Systems. 101-108 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#HeadL86a 2003-11-19 Kolmogorov Numberings and Minimal Identification. 175-194 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#FreivaldsJ97 http://dx.doi.org/10.1016/S0304-3975(96)00295-2 2003-11-19 On the Decomposition of Datalog Program Mappings. 143-177 1990 76 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#DongG90 2003-11-19 Localizable Constraints for Object Histories. 391-432 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#DongG91 2003-11-19 Intuitionistic Interpretation of Deductive Databases with Incomplete Information. 267-306 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#DongL94 2003-11-19 The Synthesis Problem for Elementary Net Systems is NP-Complete. 107-134 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#BadouelBD97 http://dx.doi.org/10.1016/S0304-3975(96)00219-8 2003-11-19 Axiomatising Extended Computation Tree Logic. 41-60 1998 190 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#Kaivola98 http://dx.doi.org/10.1016/S0304-3975(97)00083-2 2003-11-19 DOL Schemes and the Periodicity of String Embeddings. 83-89 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#HeadTW83 2003-11-19 Dominance constraints with Boolean connectives: a model-eliminative treatment. 321-343 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Duchier03 2003-11-19 Completeness of type assignment systems with intersection, union, and type quantifiers. 341-398 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#Yokouchi02 http://dx.doi.org/10.1016/S0304-3975(00)00356-X 2003-11-19 Church-Rosser Theorem for a Rewriting System on Categorical Combinators. 271-290 1989 65 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Yokouchi89 2003-11-19 F-Semantics for Type Assignment Systems. 39-77 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Yokouchi94 2003-11-19 Proving the Correctness of Recursion-Based Automatic Program Transformations. 193-233 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#Sands96 http://dx.doi.org/10.1016/0304-3975(96)00074-6 2003-11-19 The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. 63-94 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Courcelle00a http://dx.doi.org/10.1016/S0304-3975(00)00180-8 2003-11-19 A Representation of Trees by Languages II. 25-55 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Courcelle78a 2003-11-19 The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability. 153-202 1991 80 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Courcelle91a 2003-11-19 Basic Notions of Universal Algebra for Language Theory and Graph Grammars. 1-54 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Courcelle96a http://dx.doi.org/10.1016/0304-3975(95)00145-X 2003-11-19 Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. 59-82 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#CrochemoreR91 2003-11-19 On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. 403-414 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#CrochemoreR94 2003-11-19 On page migration and other relaxed task systems. 43-66 2001 268 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#BartalCI01 http://dx.doi.org/10.1016/S0304-3975(00)00259-0 2003-11-19 Attribute Grammars and Recursive Program Schemes I. 163-191 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#CourcelleF82 2003-11-19 The evaluation of first-order substitution is monadic second-order compatible. 177-206 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#CourcelleK02 http://dx.doi.org/10.1016/S0304-3975(02)00012-9 2004-02-13 Monadic Second-Order Evaluations on Tree-Decomposable Graphs. 49-82 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#CourcelleM93 2003-11-19 What is a (non-constructive) non-monotone logical system? 489-494 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#BesnardS00 http://dx.doi.org/10.1016/S0304-3975(99)00319-9 2003-11-19 Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. 589-631 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Vogler02 http://dx.doi.org/10.1016/S0304-3975(01)00300-0 2003-11-19 Executions: A New Partial-Order Semantics of Petri Nets. 205-238 1991 91 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Vogler91