2004-05-27 A Zero-One Law for Random Subset. 317-326 1991 2 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#Dolan91 2004-05-27 Countable Sparse Random Graphs. 205-214 1990 1 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Spencer90 2004-05-27 Asymptotic Packing via a Branching Process. 167-172 1995 7 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#Spencer95 2004-05-27 Random minimal spanning tree and percolation on the N-cube. 63-82 1998 12 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#Penrose98 2004-05-27 On k-connectivity for a geometric random graph. 145-164 1999 15 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#Penrose99 2004-05-27 Energy of flows on Z2 percolation clusters. 143-155 2000 16 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#Hoffman00 2004-05-27 Enumeration of Almost-Convex Polygons on the Square Lattice. 445-462 1992 3 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#EntingGRW92 2004-05-27 The Random-Facet simplex algorithm on combinatorial cubes. 353-381 2002 20 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10034 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#Gartner02 2004-05-27 Cube Ramsey numbers are polynomial. 99-101 2001 19 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#Lingsheng01 2004-05-27 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. 414-435 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#MonassonZKST99 2006-09-21 The Dimension of Random Ordered Sets. 254-276 1991 2 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#ErdosKT91 2004-05-27 On the Size of a Random Maximal Graph. 309-318 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#ErdosSW95 2004-05-27 Two-coloring random hypergraphs. 249-259 2002 20 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#AchlioptasKKT02 2004-05-27 Random Graphs with Monochromatic Triangles in Every Edge Coloring. 253-270 1994 5 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#RodlR94 2004-05-27 Note on Independent Sets in Steiner Systems. 183-190 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#RodlS94 2004-05-27 Rainbow Subgraphs in Properly Edge-colored Graphs. 175-182 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#RodlT92 2004-05-27 On the Genus of a Random Graph. 1-12 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#RodlT95 2004-05-27 Asymptotic packing and the random greedy algorithm. 161-177 1996 8 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa8.html#RodlT96 2004-05-27 Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. 459-478 1995 6 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#AlonFW95 2004-05-27 Finding a large hidden clique in a random graph. 457-466 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#AlonKS98 2004-05-27 Acyclic Coloring of Graphs. 277-288 1991 2 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#AlonMR91 2004-05-27 Permutations with roots. 157-167 2000 17 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#BonaMW00 2004-05-27 A few logs suffice to build (almost) all trees (I). 153-184 1999 14 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#ErdsSSW99 2004-05-27 A Critical Point for Random Graphs with a Given Degree Sequence. 161-180 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#MolloyR95a 2004-05-27 On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs. 147-154 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Kostichka94 2004-05-27 Hypergeometrics and the Cost Structure of Quadtrees. 117-144 1995 7 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#FlajoletLLS95 2004-05-27 Bond percolation critical probability bounds for three Archimedean lattices. 507-518 2002 20 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10029 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#Wierman02 2004-05-27 Inexpensive d-dimensional matchings. 50-58 2002 20 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#HuangPS02 2004-05-27 Maximum matchings in sparse random graphs: Karp-Sipser revisited. 111-177 1998 12 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#AronsonFP98 2004-05-27 A study of random Weyl trees. 271-295 1998 12 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#DevroyeG98 2004-05-27 The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags. 1-14 1995 7 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#DevroyeL95 2004-05-27 On the complexity of branch-and-bound search for random trees. 309-327 1999 14 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#DevroyeZ99 2004-05-27 On a random graph with immigrating vertices: Emergence of the giant component. 79-102 2000 17 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#AldousP00 2004-05-27 Brownian Bridge Asymptotics for Random Mappings. 487-512 1994 5 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#AldousP94 2004-05-27 A family of random trees with random edge lengths. 176-195 1999 15 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#AldousP99 2004-05-27 On Uncrowded Hypergraphs. 209-212 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#DukeLR95 2004-05-27 Can You Feel the Double Jump? 191-204 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#ShelahS94 2004-05-27 Sparse Pseudorandom Distributions. 163-174 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#GoldreichK92 2004-05-27 Tiny families of functions with random properties: A quality-size trade-off for hashing. 315-343 1997 11 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#GoldreichW97 2004-05-27 New and faster filters for multiple approximate string matching. 23-49 2002 20 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#Baeza-YatesN02 2004-05-27 A Power Law for Connectedness of Some Random Graphs at the Critical Point. 101-120 1991 2 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#Zhang91 2004-05-27 Delayed path coupling and generating random permutations. 238-259 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#CzumajK00 2004-05-27 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. 213-237 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#CzumajS00 2004-05-27 Randomized allocation processes. 297-331 2001 18 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#CzumajS01 2004-05-27 The Effect of Random Restrictions on Formula Size. 121-134 1993 4 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#ImpagliazzoN93 2004-05-27 Asymptotic analysis of (3, 2, 1)-shell sort. 59-75 2002 21 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10046 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#SmytheW02 2004-05-27 The capacity of majority rule. 83-109 1998 12 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#FangV98 2004-05-27 Learning finite binary sequences from half-space data. 345-381 1999 14 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#FangV99 2004-05-27 Random lifts of graphs: Independence and chromatic number. 1-22 2002 20 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#AmitLM02 2004-05-27 Addendum to On the log-product of the subtree-sizes of random trees. 405 1998 12 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#MeirM98a 2004-05-27 Colliding Stacks: A Large Deviations Analysis. 379-420 1991 2 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#Maier91 2004-05-27 The Shape of Stretched Planar Trees. 331-340 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Maier95 2004-05-27 Random graphs generated by the Star 2-Process. 125-149 1997 11 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#Robalewska97 2004-05-27 Poisson Approximation for Large Deviations. 221-230 1990 1 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Janson90a 2004-05-27 Hamilton Cycles in a Random Tournament. 213-220 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Janson95a 2004-05-27 A Graph Fourier Transform and Proportional Graphs. 341-352 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Janson95b 2004-05-27 Proportional Graphs. 209-224 1991 2 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#JansonK91 2004-05-27 Shellsort with three increments. 125-142 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#JansonK97 2004-05-27 The infamous upper tail. 317-342 2002 20 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10031 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#JansonR02 2004-05-27 Probabilistic Construction of Proportional Graphs. 127-138 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#JansonS92 2004-05-27 Intersecting random half cubes. 436-449 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#Talagrand99a 2004-05-27 Randomized Greedy Matching. 29-46 1991 2 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#DyerF91 2004-05-27 The complexity of counting graph homomorphisms. 260-289 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#DyerG00 2004-05-27 A more rapidly mixing Markov chain for graph colorings. 285-317 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#DyerG98 2004-05-27 The number of Boolean functions computed by formulas of a given size. 349-382 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#SavickyW98 2004-05-27 Testing the diameter of graphs. 165-183 2002 20 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#ParnasR02 2004-05-27 On the square of a Hamiltonian cycle in dense graphs. 193-211 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#KomlosSS96 2004-05-27 An algorithmic version of the blow-up lemma. 297-312 1998 12 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#KomlosSS98 2004-05-27 Distinctness of compositions of an integer: A probabilistic analysis. 407-437 2001 19 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#HitczenkoL01 2004-05-27 Extremal problems on set systems. 131-164 2002 20 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#FranklR02 2004-05-27 On characterizing hypergraph regularity. 293-335 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10058 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#DementievaHNR02 2004-05-27 Parallel Simulated Annealing. 139-148 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Mazza92 2004-05-27 On the connectivity of a random interval graph. 137-161 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#GodehardtJ96 2004-05-27 Expected Hitting and Cover Times of Random Walks on Some Special Graphs. 173-182 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Palacios94 2004-05-27 Low-Diameter Graph Decomposition Is in NC. 441-452 1994 5 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#AwerbuchBCP94 2004-05-27 Approximation algorithms for the covering Steiner problem. 465-482 2002 20 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10038 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#KonjevodRS02 2004-05-27 A Tight Upper Bound on the Cover Time for Random Walks on Graphs. 51-54 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Feige95 2004-05-27 A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees. 535-558 1994 5 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#DeneenST94 2004-05-27 On Boolean Decision Trees with Faulty Nodes. 453-464 1994 5 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#KenyonK94 2004-05-27 Linear waste of best fit bin packing on skewed distributions. 441-464 2002 20 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10037 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#KenyonM02 2004-05-27 Shrinkage of de Morgan Formulae under Restriction. 135-150 1993 4 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#PatersonZ93 2004-05-27 Change of Leadership in a Random Graph Process. 243-252 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#ErdosL94 2004-05-27 Covering of r-Graphs by Complete r-Partite Subgraphs. 319-322 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#ErdosR95 2004-05-27 Representations of Integers as the Sum of k Terms. 245-262 1990 1 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#ErdosT90 2004-05-27 Small Cliques in Random Graphs. 403-434 1990 1 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#BarbourJKR90 2004-05-27 The length of random subsets of Boolean lattices. 177-194 2000 16 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#KohayakawaKO00 2004-05-27 Very weak zero one law for random graphs with order and random binary functions. 351-358 1996 9 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#Shelah96 2004-05-27 The Boyer-Moore-Horspool heuristic with Markovian input. 153-163 2001 18 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#Smythe01 2004-05-27 On the log-product of the subtree-sizes of random trees. 197-212 1998 12 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#MeirM98 2004-05-27 A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck. 609-626 1994 5 Random Struct. Algorithms 5 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Pemantle94 2004-05-27 ₄. 220-238 2002 20 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#LoweM02 2004-05-27 The Giant Component 1960-1993. 231-232 1993 4 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#Erdos93 2004-05-27 ^d. 262-278 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#NandaN99 2004-05-27 Markoc Chains on Hypercubes: Spectral Representations and Several Mahorization Relations. 1-36 1993 4 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#KarlinLY93 2004-05-27 A decision procedure for well-formed linear quantum cellular automata. 381-394 1997 11 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#DurrLS97 2004-05-27 Multiple cover time. 403-411 1996 9 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#WinklerZ96 2004-05-27 On finding a minimum spanning tree in a network with random weights. 187-204 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#McDiarmidJS97 2004-05-27 Extension of Fill's perfect rejection sampling algorithm to general chains. 290-316 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#FillMMR00 2004-05-27 Perfect Matchings in Random s-Uniform Hypergraphs. 41-58 1995 7 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#FriezeJ95 2004-05-27 Multicolored Trees in Random Graphs. 45-56 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#FriezeM94 2004-05-27 Algorithmic theory of random graphs. 5-42 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#FriezeM97 2004-05-27 Counting the Number of Hamilton Cycles in Random Digraphs. 235-242 1992 3 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#FriezeS92 2004-05-27 On the Independence Number of Random Cubic Graphs. 649-664 1994 5 Random Struct. Algorithms 5 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#FriezeS94 2004-05-27 The Variance of Level Numbers in Certain Families of Trees. 361-374 1992 3 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Gutjahr92 2004-05-27 Expectation Transfer between Branching Processes and Random Trees. 447-468 1993 4 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#Gutjahr93 2004-05-27 Connection Reliabilities in Stochastic Acyclic Networks. 57-73 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Gutjahr94 2004-05-27 A Probabilistic Analysis of a Pattern Matching Problem. 191-214 1993 4 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#AtallahJS93 2004-05-27 On randomized greedy matchings. 353-383 1997 10 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#MillerP97 2004-05-27 Distributed algorithms with dynamical random transitions. 371-396 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10060 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#Guillotin-PlantardS02 2004-05-27 Generalized Digital Trees and Their Difference-Differential Equations. 305-320 1992 3 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#FlajoletR92 2004-05-27 Analysis of algorithms. 1-3 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#FlajoletS97 2004-05-27 The Logic of Ordered Random Structures. 429-447 1993 4 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#DolanL93 2004-05-27 On the distribution of search cost for the move-to-front rule. 179-186 1996 8 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa8.html#FillH96 2004-05-27 Approximating the limiting Quicksort distribution. 376-406 2001 19 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#FillJ01 2004-05-27 Random unary predicates: Almost sure theories and countable models. 229-248 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#SpencerJ98 2004-05-27 Crossing numbers of random graphs. 347-358 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10053 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#SpencerT02 2004-05-27 Long Range Percolation in Stationary Point Processes. 177-190 1993 4 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#BurtonM93 2004-05-27 Random disease on the square grid. 409-422 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#BaloghP98 2004-05-27 Fast convergence of the Glauber dynamics for sampling independent sets. 229-241 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#LubyV99 2004-05-27 Evasive random walks and the clairvoyant demon. 239-248 2002 20 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#AbramsLLPZ02 2004-05-27 Compound Poisson approximations of subgraph counts in random graphs. 39-60 2001 18 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#Stark01 2004-05-27 Total variation asymptotics for independent process approximations of logarithmic multisets and selections. 51-80 1997 11 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#Stark97 2004-05-27 Random generation of 2×n contingency tables. 71-79 1998 13 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#Hernek98 2004-05-27 Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph. 47-57 2000 16 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#GaoMW00 2004-05-27 Uniform boundedness of critical crossing probabilities implies hyperscaling. 368-413 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#BorgsCKS99 2004-05-27 The phase transition in random horn satisfiability and its algorithmic implications. 483-506 2002 20 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10028 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#Istrate02 2004-05-27 Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. 59-80 1995 7 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#KamathMPS95 2004-05-27 Random Sparse Unary Predicates. 375-394 1994 5 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#ShelahS94a 2004-05-27 On the Anti-Ramsey Property of Ramanujan Graphs. 417-432 1995 6 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#HaxellK95 2004-05-27 Random railways modeled as random 3-regular graphs. 113-136 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#Garmo96 2004-05-27 The asymptotic distribution of long cycles in random regular graphs. 43-92 1999 15 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#Garmo99 2004-05-27 On the internal path length of d-dimensional quad trees. 25-41 1999 15 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#NeiningerR99 2004-05-27 Analysis of random LC tries. 359-375 2001 19 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#Devroye01 2004-05-27 On the Height of Random m-ary Search Trees. 191-204 1990 1 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Devroye90 2004-05-27 Limit Laws for Local Counters in Random Binary Search Tree. 303-316 1991 2 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#Devroye91 2004-05-27 A Note on the Probabilistic Analysis of Patricia Trees. 203-214 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Devroye92 2004-05-27 On Random Cartesian Trees. 305-328 1994 5 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Devroye94 2004-05-27 Almost All Graphs with 1.44n Edges are 3-Colorable. 11-28 1991 2 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#Chvatal91 2004-05-27 Nearest neighbor and hard sphere models in continuum percolation. 295-315 1996 9 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#HaggstromM96 2004-05-27 On near-critical and dynamical percolation in the tree case. 311-318 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#HaggstromP99 2004-05-27 An Example of a Superproportional Graph. 95-98 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Karrman94 2004-05-27 On sampling with Markov chains. 55-77 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#ChungGY96 2004-05-27 Dependent percolation and colliding random walks. 58-84 2000 16 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#Winkler00 2004-05-27 Constructions of Permutation Arrays for Certain Scheduling Cost Measures. 39-50 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#NaorR95 2004-05-27 The Birth of the Giant Component. 233-359 1993 4 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#JansonKLP93 2004-05-27 Combinatorics of reliability Monte Carlo. 329-343 1999 14 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#LomonosovS99 2004-05-27 A note on disagreement percolation. 267-278 2001 18 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#Haggstrom01 2004-05-27 Uniform and minimal essential spanning forests on trees. 27-50 1998 12 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#Haggstrom98 2004-05-27 Complete Matchings in Random Subgraphs on the Cube. 95-104 1990 1 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Bollobas90 2004-05-27 Paul Erdös and probability theory. 521-533 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#Bollobas98 2004-05-27 On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. 75-88 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Santha95 2004-05-27 Analysis of Hoare's FIND algorithm with Median-of-three partition. 143-156 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#KirschenhoferPM97 2004-05-27 Analysis of a splitting process arising in probabilistic counting and other related algorithms. 379-401 1996 9 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#KirschenhoferPS96 2004-05-27 Coupling vs. conductance for the Jerrum-Sinclair chain. 1-17 2001 18 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#KumarR01 2004-05-27 An Upper Bound for the Solvability of a Random Stable Roommates Instance. 465-487 1994 5 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#PittelI94 2004-05-27 A phase transition phenomenon in a random directed acyclic graph. 164-184 2001 18 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#PittelT01 2004-05-27 The random bipartite nearest neighbor graphs. 279-310 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#PittelW99 2004-05-27 The minimum expectation selection problem. 278-292 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10061 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#EppsteinL02 2004-05-27 Approximating the Permanent: A Simple Approach. 349-362 1994 5 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Rasmussen94 2004-05-27 Approximately counting cliques. 395-411 1997 11 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#Rasmussen97 2004-05-27 On the asymptotic distributions of subgraph counts in a random tournament. 249-260 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#Andersson98 2004-05-27 Probabilities of Sentences about Very Sparse Random Graphs. 33-54 1992 3 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Lynch92 2004-05-27 An Extension of 0-1 Laws. 155-172 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#Lynch94 2004-05-27 On the Threshold of Chaos in Random Boolean Cellular Automata. 239-260 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Lynch95 2004-05-27 Estimates for Distributions of the Voronoi Polygon's Geometric Characteristics. 149-162 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Zuyev92 2004-05-27 Large Antichains in the Partition Lattice. 89-104 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#CanfieldH95 2004-05-27 The Diameter of a Random Graph with Bounded Diameter. 193-200 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Grable95 2004-05-27 Random Walks on Colored Graphs. 285-304 1994 5 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#CondonH94 2004-05-27 Algorithms for graph partitioning on the planted partition model. 116-140 2001 18 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#CondonK01 2004-05-27 A semidefinite bound for mixing rates of Markov chains. 299-313 1997 11 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#Kahale97 2004-05-27 _p-tests, almost independence and small probability spaces. 293-313 2000 16 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#Bertram-KretzbergL00 2004-05-27 A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. 252-277 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10052 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#Nebel02 2004-05-27 Radius and Diameter of Random Subgraphs of the Hypercube. 215-230 1993 4 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa4.html#KostochkaSW93 2004-05-27 Spanning Maximal Planar Subgraphs of Random Graphs. 225-232 1991 2 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa2.html#BollobasF91 2004-05-27 Colorings generated by monotone properties. 1-25 1998 12 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa12.html#BollobasR98 2005-05-23 Problems and results on judicious partitions. 414-430 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10062 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#BollobasS02 2004-05-27 Generalized Chromatic Numbers of Random Graphs. 353-356 1995 6 Random Struct. Algorithms 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#BollobasT95 2004-05-27 Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs. 131-147 1996 8 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa8.html#Fundia96 2004-05-27 First order zero-one laws for random graphs on the circle. 239-266 1999 14 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#McColm99 2004-05-27 Poisson approximations for functionals of random trees. 79-92 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#DobrowS96 2004-05-27 An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number. 343-360 1990 1 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Szabo90 2004-05-27 Competition Graphs and Clique Dimensions. 183-190 1990 1 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#Furedi90 2004-05-27 On the maximum number of Hamiltonian paths in tournaments. 291-296 2001 18 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#AdlerAR01 2004-05-27 Renewal processes on partially ordered sets. 15-32 2003 22 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10064 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#Siegrist03 2004-05-27 Bounds on absorption times of directionally biased random sequences. 279-293 1996 9 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#BaritompaS96 2004-05-27 On the covariance of the level sizes in random recursive trees. 519-539 2002 20 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10030 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa20.html#HofstadHM02 2004-05-27 Reconstructing a three-color scenery by observing it along a simple random walk path. 196-207 1999 15 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#Matzinger99 2004-05-27 A Passage Time for Greedy-Coloring Cycles. 105-112 1995 6 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Preater95 2004-05-27 An urn model from learning theory. 43-67 1997 10 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#BoucheronG97 2004-05-27 On the swapping algorithm. 66-97 2003 22 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10066 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#MadrasZ03 2004-05-27 Minimum independent dominating sets of random cubic graphs. 147-161 2002 21 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10047 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#DuckworthW02 2004-05-27 On random orderings of variables for parity ordered binary decision diagrams. 233-239 2000 16 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa16.html#Savicky00 2004-05-27 Improved Boolean Formulas for the Ramsey Graphs. 407-416 1995 6 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa6.html#Savicky95 2004-05-27 A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. 189-209 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#PanholzerP98 2004-05-27 Linear Arboricity of Random Regular Graphs. 443-447 1990 1 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#McDiarmidR90 2006-06-30 On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. 215-222 1992 3 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#CalkinFK92 2004-05-27 Phase transition and finite-size scaling for the integer partitioning problem. 247-288 2001 19 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#BorgsCP01 2004-05-27 Scrambling permutations and entropy of hypergraphs. 97-104 1996 8 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa8.html#Furedi96 2004-05-27 Partial Steiner systems and matchings in hypergraphs. 335-347 1998 13 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa13.html#KostochkaR98 2004-05-27 Phase transition for Parking blocks, Brownian excursion and coalescence. 76-119 2002 21 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10039 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#ChassaingL02 2004-05-27 Parking with density. 364-380 2001 18 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#Marckert01 2004-05-27 The rank of sparse random matrices over finite fields. 407-419 1997 10 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa10.html#BlomerKW97 2004-05-27 The degree sequence of a random graph. I. The models. 97-117 1997 11 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#McKayW97 2004-05-27 Approximate counting via random optimization. 187-198 1997 11 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#Barvinok97 2004-05-27 Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor. 29-61 1999 14 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#Barvinok99 2004-05-27 Introduction. 1-3 1994 5 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa5.html#FriezeJL94 2004-05-27 Limiting distributions for the costs of partial match retrievals in multidimensional tries. 428-459 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#Schachinger00 2004-05-27 The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie. 81-96 1995 7 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#Schachinger95 2004-05-27 Large Cliques Elude the Metropolis Process. 347-360 1992 3 Random Struct. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa3.html#Jerrum92 2004-05-27 A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. 157-166 1995 7 Random Struct. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa7.html#Jerrum95 2004-05-27 Property testers for dense constraint satisfaction programs on finite domains. 14-32 2002 21 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10041 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#AnderssonE02 2004-05-27 Gaussian averages, Bernoulli averages, and Gibbs' measures. 197-204 2002 21 Random Struct. Algorithms 3-4 http://dx.doi.org/10.1002/rsa.10059 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa21.html#Talagrand02 2004-05-27 Self averaging and the space of interactions in neural networks. 199-213 1999 14 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#Talagrand99 2004-05-27 Threshold functions for asymmetric Ramsey properties involving cycles. 245-276 1997 11 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa11.html#KohayakawaK97 2004-05-27 Error-resilient DNA computation. 450-466 1999 15 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa15.html#KarpKW99 2004-05-27 The degree sequence of a scale-free random graph process. 279-290 2001 18 Random Struct. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa18.html#BollobasRST01 2004-05-27 Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions. 51-72 1990 1 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#DiaconisGM90 2004-05-27 The perturbation method and triangle-free random graphs. 253-269 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#Wormald96 2004-05-27 Asymptotic distributions for partial match queries in K-d trees. 403-427 2000 17 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa17.html#Neininger00 2004-05-27 On a multivariate contraction method for random recursive structures with applications to Quicksort. 498-524 2001 19 Random Struct. Algorithms 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#Neininger01 2004-05-27 On the structure of clique-free graphs. 37-53 2001 19 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa19.html#PromelSS01 2004-05-27 A Sharp Threshold for k-Colorability. 63-70 1999 14 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa14.html#AchlioptasF99 2004-05-27 The average complexity of a coin-weighing problem. 1-14 1996 9 Random Struct. Algorithms 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa9.html#AlonsoCS96 2004-05-27 Stable Husbands. 1-14 1990 1 Random Struct. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa1.html#KnuthMP90 2004-05-27 Minors in graphs of large girth. 213-225 2003 22 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10076 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#KuhnO03 2004-05-27 Simple analysis of graph tests for linearity and PCP. 139-160 2003 22 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10068 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#HastadW03 2004-05-27 The shortest disjunctive normal form of a random Boolean function. 161-186 2003 22 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10065 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#Pippenger03 2004-05-27 Random channel assignment in the plane. 187-212 2003 22 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10077 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#McDiarmid03 2004-09-17 Integer and fractional packings in dense 3-uniform hypergraphs. 248-310 2003 22 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10075 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#HaxellNR03 2004-05-27 Regular pairs in sparse random graphs I. 359-434 2003 22 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10081 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#KohayakawaR03 2004-05-27 The Wiener Index of simply generated random trees. 337-358 2003 22 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10074 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#Janson03 2004-05-27 A general model of web graphs. 311-335 2003 22 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10084 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#CooperF03 2004-05-27 The number of k-SAT functions. 227-247 2003 22 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10079 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#BollobasB03 2004-05-27 Notes on the variance of the number of maxima in three dimensions. 440-447 2003 22 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10086 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#Carlsund03 2004-05-27 A note on scrambling permutations. 435-439 2003 22 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10082 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa22.html#Radhakrishnan03 2004-05-27 On restricted min-wise independence of permutations. 397-408 2003 23 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10101 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#MatousekS03 2004-05-27 Three theorems regarding testing graph properties. 23-57 2003 23 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10078 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#GoldreichT03 2004-05-27 Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. 73-91 2003 23 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10072 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#BazganVK03 2004-05-27 Rate of convergence of crossover operators. 58-72 2003 23 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10085 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#Ollivier03 2004-05-27 Deterministic approximation of the cover time. 1-22 2003 23 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10083 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#FeigeR03 2004-05-27 Speeding up the FMMR perfect sampling algorithm: A case study revisited. 434-452 2003 23 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10096 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#DobrowF03 2004-05-27 The computational complexity of two-state spin systems. 133-154 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10090 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#GoldbergJP03 2004-05-27 Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. 409-433 2003 23 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10102 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#AlonJMP03 2004-05-27 On the noise sensitivity of monotone functions. 333-350 2003 23 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10097 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#MosselO03 2004-05-27 On the distribution of the number of roots of polynomials and explicit weak designs. 235-263 2003 23 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10095 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#HartmanR03 2004-09-17 On large intersecting subfamilies of uniform setfamilies. 351-356 2003 23 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10098 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#DukeER03 2004-05-27 Randomly coloring graphs with lower bounds on girth and maximum degree. 167-179 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10087 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#DyerF03 2004-05-27 Proof of a tiling conjecture of Komlós. 180-205 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10091 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#ShokoufandehZ03 2004-05-27 Turán's theorem in sparse random graphs. 225-234 2003 23 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10088 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#SzaboV03 2004-05-27 On smallest triangles. 206-223 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10092 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#GrimmettJ03 2004-05-27 Random suffix search trees. 357-396 2003 23 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.10103 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#DevroyeN03 2004-09-17 Regularity properties for triple systems. 264-332 2003 23 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.10094 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#NagleR03 2004-05-27 Coalescing times for IID random variables with applications to population biology. 155-166 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10080 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#AdlerAKR03 2004-05-27 Perfect matchings in random uniform hypergraphs. 111-132 2003 23 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10093 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#Kim03 2004-05-27 Space complexity of random formulae in resolution. 92-109 2003 23 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10089 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa23.html#Ben-SassonG03 2004-05-27 ². 279-302 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20002 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#GoldbergMP04 2004-05-27 Building uniformly random subtrees. 420-443 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20011 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#LuczakW04 2004-05-27 Coloring uniform hypergraphs with few colors. 1-10 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10109 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Kostochka04 2004-05-27 Counting the onion. 155-165 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10114 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Dalal04 2004-05-27 Adding random edges to dense graphs. 105-117 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10112 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#BohmanFKM04 2004-05-27 Self-destructive percolation. 480-501 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20003 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#BergB04 2004-05-27 The vertex degree distribution of random intersection graphs. 249-258 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20005 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Stark04 2004-05-27 Divide and conquer martingales and the number of triangles in a random graph. 166-174 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10113 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#KimV04 2004-05-27 Phase diagram for the constrained integer partitioning problem. 315-380 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20001 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#BorgsCMP04 2004-05-27 Exact and approximative algorithms for coloring G(n, p). 259-278 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20007 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Coja-OghlanT04 2004-05-27 Randomization helps to perform independent tasks reliably. 11-41 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10104 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#ChlebusK04 2004-05-27 General urn models with several types of balls and Gaussian limiting fields. 75-103 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10107 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#DrmotaGG04 2004-05-27 Functions that have read-twice constant width branching programs are not necessarily testable. 175-193 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10110 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#FischerNS04 2004-05-27 Large deviations for sums of partly dependent random variables. 234-248 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20008 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Janson04 2004-05-27 Mixing in time and space for lattice spin systems: A combinatorial view. 461-479 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20004 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#DyerSVW04 2004-05-27 Continuous and discontinuous phase transitions in hypergraph processes. 397-419 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20013 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#DarlingLN04 2004-05-27 A second threshold for the hard-core model on a Bethe lattice. 303-314 2004 24 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20006 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#BrightwellW04 2004-05-27 Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph. 65-74 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10105 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Panchenko04 2004-05-27 Essential edges in Poisson random hypergraphs. 381-396 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20014 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#GoldschmidtN04 2004-05-27 Random MAX SAT, random MAX CUT, and their phase transitions. 502-545 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20015 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#CoppersmithGHS04 2004-05-27 Negative association in uniform forests and connected graphs. 444-460 2004 24 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20012 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#GrimmettW04 2004-05-27 The rotation correspondence is asymptotically a dilatation. 118-132 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10111 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#Marckert04 2005-07-12 ₅-free subgraphs of random graphs. 194-232 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20000 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#GerkeSS04 2004-05-27 m-ary Search trees when m ge 27: A strong asymptotics for the space requirements. 133-154 2004 24 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.10108 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#ChauvinP04 2004-05-27 A stochastic model for solitons. 51-64 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10106 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#ItohMT04 2004-05-27 The emergence of a giant component in random subgraphs of pseudo-random graphs. 42-50 2004 24 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.10100 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa24.html#FriezeKM04 2005-06-03 Directed graphs, Hamiltonicity and doubly stochastic matrices. 376-395 2004 25 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20034 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#BorkarEF04 2005-06-03 Random covering of an interval and a variation of Kingman's coalescent. 277-292 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20022 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Bertoin04 2005-06-03 Is constraint satisfaction over two variables always easy? 150-178 2004 25 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20026 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#EngebretsenG04 2005-06-03 Regularity Lemma for k-uniform hypergraphs. 1-42 2004 25 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20017 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#RodlS04 2005-06-03 A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. 68-90 2004 25 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20016 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Salavatipour04 2005-06-03 Correction: Small worlds. 115 2004 25 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20028 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#BarbourR04 2005-06-03 Data structures for maintaining set partitions. 43-67 2004 25 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20025 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#BenderSS04 2005-06-16 Avoidance of a giant component in half the edge set of a random graph. 432-449 2004 25 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20038 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#BohmanFW04 2005-06-03 Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups. 227-245 2004 25 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20020 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#ErlihsonG04 2005-06-03 Some bounds on the coupon collector problem. 208-226 2004 25 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20019 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Martinez04 2006-11-06 On the advantage over a random assignment. 117-149 2004 25 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20031 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#HastadV04 2005-06-03 The shape of large Galton-Watson trees with possibly infinite variance. 311-335 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20021 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#GeigerK04 2005-06-03 Identifying several biased coins encountered by a hidden random walk. 91-114 2004 25 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20018 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#LevinP04 2006-01-31 De Bruijn cycles for covering codes. 421-431 2004 25 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20033 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#ChungC04 2005-06-03 Random walks on the torus with several generators. 336-345 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20029 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#PrescottS04 2005-06-03 The cores of random hypergraphs with a given degree sequence. 353-375 2004 25 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20040 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Cooper04 2005-06-03 On the number of full levels in tries. 247-276 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20023 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#KnesslS04 2005-06-03 The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. 179-207 2004 25 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20027 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Panholzer04 2005-06-03 Simply generated trees, B-series and Wigner processes. 293-310 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20024 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#Mazza04 2005-07-12 Corrigendum: The complexity of counting graph homomorphisms. 346-352 2004 25 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20036 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#DyerG04 2005-06-03 On the clustering of independent uniform random variables. 396-420 2004 25 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20030 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa25.html#CsorgoW04 2005-06-03 Asymptotic degree distribution in random recursive trees. 69-83 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20046 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Janson05 2005-06-16 Perfect matchings in random bipartite graphs with minimal degree at least 2. 319-358 2005 26 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20044 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Frieze05 2005-06-03 Testing graphs for colorability properties. 289-309 2005 26 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20037 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Fischer05 2005-06-03 Combinatorial dimension in fractional Cartesian products. 146-159 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20058 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#BleiG05 2005-06-03 Vertex and edge expansion properties for rapid mixing. 52-68 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20045 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Montenegro05 2005-06-03 The phase transition in the uniformly grown random graph has infinite order. 1-36 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20041 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#BollobasJR05 2005-06-03 Generating random elements of abelian groups. 437-445 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20055 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Lukacs05 2005-06-03 Continuum percolation with steps in the square or the disc. 392-403 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20064 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#BalisterBW05 2005-06-03 Integer and fractional packing of families of graphs. 110-118 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20048 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Yuster05 2005-06-03 Limit distribution of the number of consecutive records. 404-417 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20052 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#ChernH05 2005-06-03 Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. 253-265 2005 26 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20035 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Sudakov05 2005-06-03 On the probability of rendezvous in graphs. 266-288 2005 26 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20032 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#DietzfelbingerT05 2005-06-03 A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment. 237-251 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20066 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Wastlund05 2005-06-03 Transfer theorems and asymptotic distributional results for m-ary search trees. 359-391 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20039 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#FillK05 2005-06-03 Steady state analysis of balanced-allocation routing. 446-467 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20071 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#AnagnostopoulosKU05 2005-06-03 Concentration of vertex degrees in a scale-free random graph process. 224-236 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20065 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Szymanski05 2005-06-03 The climbing depth of random trees. 84-109 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20047 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Panholzer05 2005-06-03 Counting subgraphs in quasi-random 4-uniform hypergraphs. 160-203 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20056 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#RodlS05 2005-06-03 Coin flipping from a cosmic source: On error correction of truly random bits. 418-436 2005 26 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20062 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#MosselO05 2005-06-03 Positional games on random graphs. 204-223 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20059 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#StojakovicS05 2005-06-03 Hunting for sharp thresholds. 37-51 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20042 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#Friedgut05 2005-10-05 Percolation in Voronoi tilings. 310-318 2005 26 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20043 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#BalisterBQ05 2005-06-03 How complex are random graphs in first order logic? 119-145 2005 26 Random Struct. Algorithms 1-2 http://dx.doi.org/10.1002/rsa.20049 http://www.informatik.uni-trier.de/~ley/db/journals/rsa/rsa26.html#KimPSV05 2006-03-16 Workshop Report: 1991 Workshop on Architectural Aspects of Real-Time Systems, San Antonio, Texas, U. S. A.. 85-87 1992 4 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#KrishnaL92 2003-05-22 RTC: Language Support for Real-Time Concurrency. 63-87 1993 5 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#WolfeDL93 2003-05-22 Monitoring Distributed Real-Times. 33-56 1994 7 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#Schmid94 2002-01-03 Design and Programming Tools for Time Critical Applications. 251-267 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#AncilottiBNS98 2002-01-03 Object Orientation vs. Real-Time Systems - Response to Alan C. Shaw's Contribution. 75-77 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Zalewski00 2003-05-22 On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking? 177-195 1989 1 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#NishioTI89 2003-05-22 Fundamental Issues in Testing Distributed Real-Time Systems. 129-157 1994 7 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#Schutz94 2003-05-22 Replica Determinism in Distributed Real-Time Systems: A Brief Survey. 289-316 1994 6 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#Poledna94 2002-01-03 Trade-Off Analysis of Real-Time Control Performance and Schedulability. 199-217 2001 21 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#SetoLSS01 2003-05-22 A Study on the timeliness Property in Real-Time Systems. 247-273 1991 3 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#Chen91 2002-01-03 Least Suffering Strategy in Distributed Real-Time Programming Language DROL. 41-70 1996 11 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#TakashioT96 2003-05-22 Deadlock Prevention in Concurrent Real-Time Systems. 305-318 1993 5 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#DavidsonLW93 2002-01-03 Global Positioning System (GPS) Time Dissemination for Real-Time Applications. 9-40 1997 12 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#Dana97 2002-01-03 Archictecture and Performance of Java-Based Distributed Object Models: CORBA vs RMI. 43-75 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#MunozZ01 2002-01-03 Visual Keyword Image Retrieval Based on Synergetic Neural Network for Web-Based Image Search. 127-142 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#ZhaoTIQ01 2002-01-03 Experimental Assessment of the Period Calibration Method: A Case Study. 41-64 1999 17 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#KimRHS99 2002-01-03 Object Oriented Design for Real-Time Systems-Response to C. E. Pereira's Contribution. 95-99 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Babau00 2005-07-26 Pipelined Processors and Worst Case Execution Times. 319-343 1993 5 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#ZhangBN93 2002-01-03 Optimal Real-Time Scheduling with Minimal Rejections and Minimal Finishing Time. 229-253 2001 20 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#ChengH01 2003-05-22 Stack-based Scheduling of Realtime Processes. 67-99 1991 3 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#Baker91 2004-12-06 An Integrated Approach to Scheduling in Safety-Critical Embedded Control Systems. 5-37 2003 25 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#BateB03 2002-01-03 A History of Real-Time Industrial Process Control in the Dutch Steel-Making Industry. 215-226 1995 8 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#Ende95 2002-01-03 Specification and Verification of Reactive System Behaviour: The Railroad Crossing Example. 143-178 1996 10 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#ArmstrongB96 2003-10-31 An Approach to Platform Independent Real-Time Programming: (2) Practical Application. 87-112 2000 19 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#HoomanR00a 2002-01-03 A Codesign Approach to Real-time High Precision Control. 41-60 2000 19 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#HoMTK00 2003-05-22 Specifying Real-Time Properties with Metric Temporal Logic. 255-299 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#Koymans90 2002-01-03 Scheduling Aperiodic Tasks in Dynamic Priority Systems. 179-210 1996 10 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#SpuriB96 2003-03-21 Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems. 239-271 2002 23 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#JonssonS02 2003-03-21 Utilization-Based Admission Control for Scalable Real-Time Communication. 171-202 2003 24 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#ChoiXBZL03 2003-05-22 RIMMS - An OSI-based Real-Time Messaging System. 213-234 1990 2 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#RoddZI90 2002-01-03 Interval-based Clock Synchronization. 173-228 1997 12 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#SchmidS97 2003-05-22 Feasible Processor Allocation in a Hard-Real-Time Environment. 77-93 1989 1 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#Henn89 2003-05-22 Programmable Real-Time Scheduler Using a Neurocomputer. 351-363 1989 1 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#AeA89 2002-01-03 Measuring the Performance of Real-Time Systems. 59-68 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#HalangGCD00 2002-01-03 A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling. 171-181 1998 14 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#ManabeA98 2002-01-03 Techniques for LAN Performance Analysis in a Real-Time Environment. 21-44 1998 14 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#IreyHM98 2003-05-22 Response Time Driven Scheduling for Programmable Logic Controllers with Network-Based I/O Systems. 67-91 2003 25 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#JeongCK03 2002-01-03 Aperiodic Servers in a Deadline Scheduling Environment. 31-67 1995 9 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#GhazalieB95 2003-05-22 The IPTES Environment: Support for Incremental Heterogeneous and Distributed Prototyping. 153-171 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#LeonDPZA93 2004-11-09 A Network Time Interface M-Module for Distributing GPS-Time over LANs. 25-57 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#SchmidKMNCK00 2003-05-22 Dual-Priority versus Background Scheduling: A Path-Wise Comparison. 39-66 2003 25 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#GaujalNM03 2003-05-22 An Architecture for Real-Time Distributed Artificial Intelligent Systems. 263-288 1994 6 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#HoltR94 2003-05-22 Guest Introduction: The IPTES Project. 135-137 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#Bologna93 2003-05-22 Preemptive Scheduling with Release Times and Deadlines. 265-281 1989 1 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#HongL89 2003-11-24 Procedure-Level Verification of Real-time Concurrent Systems. 81-114 1999 16 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#WangL99 2003-05-22 Timing Analysis of MRL: A Real-Time Rule-Based System. 89-128 1993 5 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#WangM93 2004-12-14 Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. 183-192 1998 15 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#OhB98 2002-01-03 Task Behavior Monitoring for Adaptive Real-Time Communication. 173-195 1996 11 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#OhM96 2003-05-22 Enhancing Fault-Tolerance in Rate-Monotonic Scheduling. 315-329 1994 7 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#OhS94 2002-01-03 Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems. 207-239 1995 9 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#OhS95 2003-05-22 Introduction: Real-Time Language and Language-Level Timing Tools and Analysis. 9-12 1993 5 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#Stankovic93 2002-01-03 Object Caching and Prefetching in Distributed Virtual Walkthrough. 143-164 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#LauCGLS01 2003-05-22 A Decomposition Approach to Non-Preemptive Real-Time Scheduling. 7-35 1994 6 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#YuanSA94 2003-05-22 Time-Constrained Reasoning Under Uncertainty. 25-45 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#BonissoneH90 2002-01-03 Priority Scheduling Versus Pre-Run-Time Scheduling. 7-23 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#XuP00 2002-06-20 Data-Flow Frameworks for Worst-Case Execution Time Analysis. 183-227 2002 22 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#Blieberger02 2006-03-16 Voltage-Clock Scaling for Low Energy Consumption in Fixed-Priority Real-Time Systems. 303-317 2003 24 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#LeeK03 2003-05-22 Modeling and Evaluating the Feasibility of Timing Constraints Under Different Real-time scheduling Algorithms. 287-306 1992 4 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#BerrymanS92 2003-05-22 Depth-Limited Search for Real-Time Problem Solving. 7-24 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#Korf90 2002-01-03 Worst Case Execution Time Analysis for a Processor with Branch Prediction. 249-274 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#ColinP00 2002-01-03 The Spring System: Integrated Support for Complex Real-Time Systems. 223-251 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#StankovicRNHW99 2003-05-22 Dynamic Scheduling of Real-Time Tasks under Precedence Constraints. 181-194 1990 2 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#ChettoSB90 2002-01-03 A Software-Reuse Approach to Build Monitor Programs for Soft Real-Time Applications. 123-148 2000 19 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#KuoH00 2002-01-03 Critical Issues in Object-Oriented Real-Time Systems - A Guided Panel Discussion. 69-70 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Wedde00 2003-06-23 The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. 107-126 1997 13 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#GoossensD97 2003-05-22 A Comparison of Four Microcomputer Operating Systems. 345-368 1993 5 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#Wells93 2003-05-22 Synchronous Atomic Broadcast for Redundant Broadcast Channels. 195-212 1990 2 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#Cristian90 2003-05-22 A Partial Evaluator for the Maruti Hard Real-Time System. 13-30 1993 5 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#NirkheP93 2003-03-21 A Computation Method for Providing Statistical Performance Guarantee to an ATM Switch. 297-317 2002 23 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#NgST02 2003-05-22 Integrated End-to-End Delay Analysis for Regulated ATM Networks. 93-124 2003 25 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#NgSZ03 2002-01-03 Automated Meta-Control for Adaptable Real-Time Software. 107-134 1998 14 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#JehudaI98 2003-05-22 Compositional Verification of a Distributed Real-Time Arbitration Protocol. 173-205 1994 6 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#Hooman94 2002-01-03 Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks. 119-149 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#WangWL02 2002-01-03 A Model for Scheduling of Object-Based, Distributed Real-Time Systems. 5-34 1995 8 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#VerhooselHLWS95 2002-01-03 Real-Time Reactions in Supervisory Control According to Data Freshness. 197-210 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#ShimakawaITT01 2003-05-22 A Retargetable Technique for Predicting Execution Time of Code Segments. 159-182 1994 7 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#HarmonBW94 2005-06-01 On the Competitiveness of On-Line Real-Time Task Scheduling. 125-144 1992 4 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#BaruahKMMRRSW92 2002-01-03 Software Architectures for Reducing Priority Inversion and Non-determinism in Real-time Object Request Brokers. 77-125 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#SchmidtMFG01 2003-05-22 Predicting Program Execution Times by Analyzing Static and Dynamic Program Paths. 31-62 1993 5 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#Park93 2003-05-22 A Verifier for Real-Time Properties. 5-35 1992 4 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Ostroff92 2003-05-22 Handling Real-Time Communication Constraints in a Mobile Station used for the Pan European Digital Mobile Communication Network. 113-123 1992 4 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Jager92 2003-05-22 Concepts, Methods, and Languages for Building Timely Intelligent Systems. 127-148 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#LarkEFG90 2003-05-22 Real-Time Concurrent C: A Language for Programming Dynamic Real-Time Systems. 377-405 1991 3 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#GehaniR91 2003-05-22 An Application of Structural Modeling and Automated Reasoning to Real-Time Systems Design. 313-331 1989 1 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#HonidenUMMA89 2003-05-22 An Executable Subset of VDM-SL, in an SA/RT Framework. 197-211 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#ElmstromLA93 2003-05-22 Giving Semantics to SA/RT by Means of High-Level Times Petri Nets. 249-271 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#ElmstromLP93 2002-01-03 Editorial. 217-218 1997 13 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#Kramer97 2002-01-03 A Description Language for Engineering of Complex Real-Time Systems. 245-263 1996 11 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#StoyenkoML96 2002-01-03 Real-Time Communication in FDDI Networks. 75-107 1996 10 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#MalcolmKZ96 2002-06-20 Guest Editorial. 5-6 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#ShaA02 2002-01-03 A Case For Object-Oriented Real-Time Systems (OORTS). 71-74 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Shaw00 2002-01-03 Implementation of Adaptive Fuzzy Control for a Real-Time Control Demo-Model. 219-239 2001 21 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#Ruan01 2002-06-20 Adaptive Workload Management through Elastic Scheduling. 7-24 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#ButtazzoA02 2002-01-03 Open Embedded Control. 325-343 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#NilssonBL98 2002-01-03 Fundamentals of Implementing Real-Time Control Applications in Distributed Computer Systems. 219-250 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#Torngren98 2005-02-18 Using Control Theory to Achieve Service Level Objectives In Performance Management. 127-141 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#ParekhGHTJB02 2002-01-03 Reengineering a Single Threaded Embedded Missile Application onto a Parallel Processing Platform Using MetaH. 7-20 1998 14 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#McConnellLG98 2003-05-22 Editorial: What is Predictability for Real-Time Systems? 247-254 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#StankovicR90 2003-05-22 Addressing Real-Time Constraints in the Design of Autonomous Agents. 81-96 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#HoweHC90 2003-05-22 A Temporal Logic-Based Model of Event-Driven Nets. 407-428 1991 3 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#CingelF91 2003-05-22 Analysis of Real-Time Properties and Rules for Setting Protocol Parameters of MAP Networks. 221-241 1989 1 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#RzehakEJ89 2003-05-22 Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time. 325-346 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#ChenL90 2006-01-10 A Scheduling Algorithm for Tasks Described by Time Value Function. 293-312 1996 10 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#ChenM96 2003-05-22 Scheduling Customers in a Non-Removal Real-time System with an Application to Disk Scheduling. 55-72 1994 6 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#ChenT94 2003-03-21 Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks. 183-208 2002 23 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#ChenW02 2003-05-22 Fast Sensor Corrections of Robot Motion Paths Processed in Real-Time by Control Algorithms Running in Parallel. 207-220 1989 1 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#Schweinzer89 2002-01-03 Dynamic Dispatching of Cyclic Real-Time Tasks with Relative Timing Constraints. 5-40 2000 19 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#ChoiA00 2002-01-03 Support Software for the Development of Programmable Logic Controller Applications. 173-193 1995 9 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#HassapisP95 2002-01-03 Hard Real-Time Communication in Multiple-Access Networks. 35-77 1995 8 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#MalcolmZ95 2003-05-22 Conventional and Early Token Release Scheduling Models for the IEEE 802.5 Taken Ring. 5-32 1994 7 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#SathayeS94 2002-01-03 Preface to the Special Issue on ``The Engineering of Complex Real-Time Computer Control Systems''. 221-222 1996 11 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#Irwin96 2002-06-20 Specification, Mapping and Control for QoS Adaptation. 143-174 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#KoliverNFFS02 2002-01-03 Cache-Conscious Limited Preemptive Scheduling. 257-282 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#LeeMKLL99 2003-05-22 Quantitative Temporal Reasoning. 331-352 1992 4 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#EmersonMSS92 2002-01-03 Tools for Specifying Real-Time Systems. 117-172 1995 8 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#BucciCN95 2002-01-03 Threaded Prefetching: A New Instruction Memory Hierarchy for Real-Time Systems. 47-65 1997 13 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#LeeMSKP97 2003-03-21 How to Verify a Safe Real-Time System: The Application of Model Checking and Timed Automata to the Production Cell Case Study. 135-151 2003 24 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#Burns03 2002-01-03 Challenges in Design and Implementation of Middlewares for Real-Time Systems: Guest Editor's Introduction. 115-116 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#Zhao01 2002-01-03 How to Implement a Safe Real-Time System: The OBSERV Implementation of the Production Cell Case Study. 61-90 1998 15 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#Tyszberowicz98 2002-01-03 Generalized Multiframe Tasks. 5-22 1999 17 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#BaruahCGM99 2003-02-21 Synergos-Synergetic Vision Research. 7-41 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#BrunoJCC01 2002-01-03 Improvement in Feasibility Testing for Real-Time Tasks. 19-39 1996 11 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#RipollCM96 2002-01-03 A Real-Time Self-Tuning Web Tension Regulation Scheme. 265-287 1996 11 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#BoulterG96 2002-01-03 Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996. 329-345 1997 12 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#DolevRSS97 2002-01-03 An Optimal Value-Based Admission Policy and its Reflective Use in Real-Time Systems. 5-30 1999 16 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#BondavalliGM99 2002-01-03 Enhancing O-O Middleware to Become Time-Aware. 211-228 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#NettGM01 2002-01-03 Implementing a Probabilistic Clock Synchronization Algorithm. 25-46 1997 13 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#AlariC97 2005-01-12 Flexible Soft Real-Time Processing in Middleware. 77-118 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#BrandtN02 2003-03-21 On the Scheduling of Flexible and Reliable Real-Time Control Systems. 153-169 2003 24 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#ChandraLS03 2002-01-03 Presto - A System Environment for Mission-Critical Multimedia Applications. 127-139 1997 13 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#HuangKAR97 2002-01-03 Improving the Accuracy of Scheduling Analysis Applied to Distributed Systems Computing Minimal Response Times and Reducing Jitter. 5-25 2001 20 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#HendersonKR01 2002-01-03 Application of the Genetic Algorithm to Real-Time Active Noise Control. 289-302 1996 11 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#TangMKCC96 2002-01-03 A New Approach for Scheduling of Parallelizable Tasks in Real-Time Multiprocessor Systems. 39-60 1998 15 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#ManimaranMR98 2002-01-03 Priority Inheritance in Soft Real-Time Databases. 243-268 1992 4 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#HuangSRTP92 2006-04-26 Analysis of Checkpointing for Real-Time Systems. 83-102 2001 20 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#PunnekkatBD01 2002-01-03 Verifying Timing Constraints of Real-Time Systems by Means of Evolutionary Testing. 275-298 1998 15 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#WegenerG98 2002-01-03 A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing Constraints. 241-268 2001 21 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#WegenerM01 2003-05-22 Architectural Foundations for Real-Time Performance in Intelligent Agents. 99-125 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#Hayes-Roth90 2002-01-03 Worst-Case Space and Time Complexity of Recursive Procedures. 115-144 1996 11 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#BliebergerL96 2002-01-03 Rapid Prototyping of Real-Time Information Processing Units for Mechatronic Systems. 269-291 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#HerpelG98 2003-07-28 Performance Evaluation of Two New Disk Scheduling algorithms for Real-Time Systems. 307-336 1991 3 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#ChenSKT91 2002-01-03 The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks. 103-130 1998 15 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#AltenberndH98 2002-01-03 Guest Editorial: A Review of Worst-Case Execution-Time Analysis. 115-128 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#PuschnerB00 2003-05-22 Calculating the Maximum Execution Time of Real-Time Programs. 159-176 1989 1 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#PuschnerK89 2002-01-03 Computing Maximum Task Execution Times - A Graph-Based Approach. 67-91 1997 13 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#PuschnerS97 2002-01-03 Editorial. 217-218 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#WikanderS98 2002-01-03 Fast and Precise WCET Prediction by Separated Cache and Path Analyses. 157-179 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#TheilingFW00 2002-01-03 Efficient and Precise Cache Behavior Prediction for Real-Time Systems. 131-181 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#FerdinandW99 2002-01-03 User-level Real-Time Network System on Microkernel-based Operating Systems. 45-60 1998 14 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#NakajimaT98 2002-01-03 Data Access Scheduling in Firm Real-Time Database Systems. 203-241 1992 4 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#HaritsaCL92 2003-05-22 MELODY: A Completely Decentralized Adaptive File System for Handling Real-Time Tasks in Unpredictable Environments. 347-364 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#WeddeAHKK90 2002-01-03 Timing Analysis and Validation for Real-Time Systems - Guest Editor's Introduction. 127-129 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#Wilhelm99 2003-05-22 Mutliprocessor Task Scheduling with Resource Requirements. 37-53 1994 6 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#BlazewiczE94 2002-01-03 Low-Power Design for Real-Time Systems. 131-148 1998 15 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#ChengCH98 2002-01-03 Implementation of Hard Real-Time Embedded Control Systems. 293-310 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#ColnariVGH98 2002-01-03 A Compact Task Graph Representation for Real-Time Scheduling. 71-102 1996 11 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#GuptaS96 2002-01-03 A Highly Dependable Computing Architecture for Safety-Critical Control Applications. 237-251 1997 13 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#KramerV97 2005-06-06 Integrating Schedulability Analysis and Design Techniques in SD. 267-302 2003 24 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#AlvarezDLPT03 2003-05-22 Timed High-Level Nets. 165-189 1991 3 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#MorascaPT91 2004-02-12 Editorial. 5-6 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009348.68186.9a http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#X04 2004-02-12 Ordering and Timeliness Requirements of Dependable Real-Time Programs. 105-128 1994 7 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#Verissimo94 2004-02-12 Causal Delivery Protocols in Real-time Systems: A Generic Model. 45-73 1996 10 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#Verissimo96 2002-01-03 On Using Real-Time Static Locking Protocols for Distributed Real-Time Databases. 141-166 1997 13 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#LamHS97 2002-01-03 Transaction Scheduling in Distributed Real-Time Systems. 169-193 2000 19 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#LamLH00 2004-04-29 Cashing in on Caching: An Architecture for Time-Bounded Knowledge-Based Problem Solving. 221-247 1998 15 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#ChatterjeeC98 2002-01-03 Quantitative Analysis of Hardware Support for Real-Time Operating Systems. 123-142 1996 10 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#ChatterjeeS96 2003-05-22 The Cyclic Executive Model and Ada. 7-25 1989 1 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#BakerS89 2003-05-22 Predictable Synchronization Mechanisms for Multiprocessor Real-Time Systems. 163-180 1990 2 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#MoleskySZ90 2002-01-03 Towards a Mobile Code Management Environment for Complex, Real-Time, Distributed Systems. 165-189 2001 21 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#StoyenP01 2003-05-22 Real-Time Software Specification and Validation with Transnet. 153-172 1994 6 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#Sacha94 2003-05-22 Priority Inheritance and Message Passing Communication: A Formal Treatment. 19-44 1991 3 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#BurnsW91 2003-05-22 HRT-HOOD: A Structured Design Method for Hard Real-Time Systems. 73-114 1994 6 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#BurnsW94 2003-03-21 Analysis of Worst Case DMA Response Time in a Fixed-Priority Bus Arbitration Protocol. 209-238 2002 23 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#HahnHML02 2002-01-03 Real-Time Transaction Scheduling: A Framework for Synthesizing Static and Dynamic Factors. 135-170 1998 14 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#ChakravarthyHJ98 2002-01-03 Possible and Impossible Self-Stabilizing Digital Clock Synchronization in General Graphs. 95-107 1997 12 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#Dolev97 2003-05-22 Allocating Hard Real-Time tasks: An NP-Hard Problem Made Easy. 145-165 1992 4 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#TindellBW92 2003-05-22 An Extendible Approach for Analyzing Fixed Priority Hard Real-Time Tasks. 133-151 1994 6 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#TindellBW94 2002-01-03 Analysis of Hard Real-Time Communications. 147-171 1995 9 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#TindellBW95 2002-01-03 Cache Aware Pre-Runtime Scheduling. 235-256 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#KastnerT99 2002-07-18 HEDRA: Heterogeneous Distributed Real-Time Architecture. 311-323 1998 14 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#ThielemansDB98 2002-01-03 Priority Scheduling of Transactions in Distributed Real-Time Databases. 31-62 1999 16 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#LeeLK99 2003-05-22 Distributed Execution of Specifications. 213-234 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#PuenteALD93 2002-01-03 Scheduling Messages with Earliest Deadline Techniques. 255-285 2001 20 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#NataleM01 2003-05-22 Temporal Modeling of Real-Time Communication Protocols Based on a Process/Channel Approach. 243-262 1994 6 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#RoddA94 2003-05-22 The OR Dataflow Architecture for a Machine Embedded Control System. 107-132 1989 1 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#LentK89 2003-05-22 A Survey of Research in Deliberative Real-Time Artificial Intelligence. 317-347 1994 6 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#GarveyL94 2002-01-03 Report of the First European Dependable Computing Conference EDCC-1. 227-228 1995 8 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#Echtle95 2003-05-22 A Static Scheduling Algorithm for Distributed Real-Time Systems. 227-246 1991 3 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#VerhooselLHJ91 2002-01-03 The ProCoS Approach to Correct Systems. 253-275 1997 13 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#Langmaack97 2002-01-03 On Developing Distributed Middleware Services for QoS- and Criticality-Based Resource Negotiation and Adaptation. 187-221 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#HuangWC99 2004-12-01 Criticality- and QoS-Based Multiresource Negotiation and Adaptation. 249-273 1998 15 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#HuangWD98 2002-01-03 Dynamic Scheduling and Fault-Tolerance: Specification and Verification. 51-81 2001 20 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#JanowskiJ01 2003-05-22 Forecasting Real-Time Behavior During Software Design using a CASE Environment. 61-76 1989 1 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#Lauber89 2002-01-03 Expressing and Enforcing Timing Constraints in a Dynamic Real-Time CORBA System. 253-280 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#WolfeDGSWZJ99 2002-01-03 Application of Partial-Order Methods to Reactive Programs with Event Memorization. 287-316 2001 20 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#HerbreteauCR01 2003-05-22 Mode Change Protocols for Priority-Driven Preemptive Scheduling. 243-264 1989 1 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#ShaRLR89 2002-01-03 BASEMENT: A Distributed Real-Time Architecture for Vehicle Applications. 223-244 1996 11 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#HanssonLSL96 2003-05-22 Maintaining Global Time in Futurebus+. 5-17 1991 3 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#VolzSW91 2003-03-21 Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks. 93-128 2003 24 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#Baruah03 2002-01-03 A Synthetic Workload for a Distributed Real-time System. 5-18 1996 11 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#KiskisS96 2005-07-06 An Open Environment for Real-Time Applications. 155-185 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#DengLZMF99 2002-01-03 Analytic Evaluation of Contention Protocols Used in Distributed Real-Time Systems. 69-107 1995 9 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#ShinH95 2002-01-03 ARMADA Middleware and Communication Services. 127-153 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#AbdelzaherDFJJMMSSWZBM99 2002-01-03 Real-Time Access Control and Reservation on B-Tree Indexed Data. 245-281 2000 19 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#KuoWL00 2002-01-03 Can Formal Methods be Integrated into Real-Time Object-Oriented Design? Response to J. de la Puente's Contribution. 85-87 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Wedde00a 2002-01-03 Building Large, Complex, Distributed Safety-Critical Operating Systems. 277-302 1997 13 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#WeddeL97 2002-01-03 The EDL Server for Scheduling Periodic and Soft Aperiodic Tasks with Resource Constraints. 87-111 1999 17 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#Silly99 2002-01-03 Improving Predictability of Transaction Execution Times in Real-time Databases. 283-302 2000 19 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#RastogiSBLSS00 2002-01-03 Formal Specification and Compositional Verification of an Atomic Broadcast Protocol. 119-145 1995 9 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#ZhouH95 2003-09-15 Guaranteed Task Deadlines for Fault-Tolerant Workloads with Conditional Branches. 275-305 1991 3 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#McElvanyS91 2003-05-22 Cy-Clone: An Approach to the Engineering of Resource Adequate Cyclic Real-Time Systems. 55-83 1992 4 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Lawson92 2002-01-03 Extending the SCR Method for Real-Time Systems. 27-49 2001 20 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#HongCCK01 2002-01-03 Resource Management Middleware for Dynamic, Dependable Real-Time Systems. 183-196 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#RavindranWS01 2003-05-22 An Improved Hard Real-Time Scheduling for the IEEE 802.5. 99-112 1992 4 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Pleinevaux92 2002-01-03 Real-time Fault Tolerant Operation of the 802.5 Token Ring. 79-91 1995 8 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#Pleinevaux95 2002-01-03 Decomposition in Real-Time Safety-Critical Systems. 183-202 1998 14 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#MukherjeeS98 2003-05-22 Automated Verification of Responsive Protocols Modeled by Extended Finite State Machines. 275-289 1994 7 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#KakudaKK94 2002-01-03 Cello: A Disk Scheduling Framework for Next Generation Operating Systems. 9-48 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#ShenoyV02 2002-01-03 The Design and Performance of a Real-Time CORBA Scheduling Service. 117-154 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#GillLS01 2002-01-03 WCET Analysis of Superscalar Processors Using Simulation With Coloured Petri Nets. 275-288 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#BurnsKY00 2003-03-21 Utilization Based Schedulability Bounds for Age Constraint Process Sets in Real-Time Systems. 273-295 2002 23 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#Lundberg02 2003-05-22 Criticality and Utility in the Next Generation. 351-354 1991 3 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#BurnsW91a 2002-01-03 A Systematic Approach to the Petri Net Based Specification of Concurrent Systems. 219-236 1997 13 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#MazzeoMRV97 2003-05-22 A Hierarchical Approach to Systems with Heterogeneous Real-Time Requirements. 149-163 1991 3 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#BottazziS91 2003-05-22 Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. 301-324 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#BaruahRH90 2002-01-03 To Schedule or to Execute: Decision Support and Performance Implications. 281-313 1999 16 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#HamidzadehAR99 2003-05-22 Responsive, Deterministic IEEE 802.5 Token Ring Scheduling. 133-158 1989 1 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#StrosniderM89 2003-05-22 Software Architecture for Hard Real-Time Applications: Cyclic Executives vs. Fixed Priority Executives. 37-53 1992 4 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Locke92 2002-01-03 Stabilizing Pre-Run-Time Schedules With the Help of Grace Time. 65-86 1999 17 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#MagalhaesS99 2002-01-03 Real-Time Database Systems in the New Millenium. 205-208 2000 19 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#HaritsaR00 2002-01-03 Terrestrial Time Signal Dissemination. 41-61 1997 12 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#Lichtenecker97 2003-05-22 Guest Introduction: Some Italian Research on Real-Time Systems. 113-114 1991 3 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#Cantone91 2002-01-03 An Historical Survey of Early Real-Time Computing Developments in the U.S. 199-213 1995 8 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#LaplanteRG95 2002-01-03 Fixed Priority Pre-emptive Scheduling: An Historical Perspective. 173-198 1995 8 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts8.html#AudsleyBDTW95 2002-01-03 On Tasks Synchronization with the MMS Protocol. 265-287 1995 9 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#AkazanM95 2003-05-22 Hybrid Protocols Using Dynamic Adjustment of serialization Order for Real-Time Concurrency Control. 269-276 1992 4 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#SonLL92 2002-01-03 Predictability of a RTX2000-based Implementation. 223-244 1996 10 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#AndreP96 2002-06-20 Communication Response Time in P-NET Networks: Worst-Case Analysis Considering the Actual Token Utilization. 229-249 2002 22 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#TovarVB02 2002-01-03 Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU). 295-327 1997 12 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#SchossmaierSHL97 2002-01-03 Increasing Processor Utilization in Hard-Real-Time Systems with Checkpoints. 5-29 1995 9 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#BertossiBM95 2003-03-21 Fail-Awareness: An Approach to Construct Fail-Safe Systems. 203-238 2003 24 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#FetzerC03 2002-01-03 Integrating External and Internal Clock Synchronization. 123-171 1997 12 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#FetzerC97 2002-02-26 Real-Time Schedulability Tests for Preemptive Multitasking. 61-93 1998 14 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#Fidge98 2002-01-03 Symbolic Cache Analysis for Real-Time Systems. 181-215 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#BliebergerFS00 2002-06-20 Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms. 85-126 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#LuSST02 2002-01-03 Causal Delivery of Messages with Real-Time Data in Unreliable Networks. 245-262 1996 10 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#BaldoniMR96 2002-01-03 Non-Preemptive Real-Time Scheduling of Multimedia Tasks. 23-39 1999 17 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#DolevK99 2002-01-03 Towards a Stable Earliest Deadline Scheduling Algorithm. 263-291 1996 10 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#Delacroix96 2003-05-22 Real-Time Control Software for Transaction Processing Based on Colored Safe Petri Net Model. 299-312 1989 1 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#MurataK89 2003-05-22 Schedulability-Analyzable Exception Handling for Fault-Tolerant Real-Time Languages. 183-212 1994 7 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#MarloweSMW94 2002-01-03 A Process Algebraic Approach to the Schedulability Analysis of Real-Time Systems. 189-219 1998 15 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#Ben-AbdallahCCKLX98 2002-01-03 Introduction to the Special Issue on Flexible Scheduling. 5-7 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#FohlerB02 2002-01-03 Algorithms and Optimality of Scheduling Soft Aperiodic Requests in Fixed-Priority Preemptive Systems. 23-43 1996 10 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#TiaLS96 2002-01-03 Supporting Timing Analysis by Automatic Bounding of Loop Iterations. 129-156 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#HealySRWE00 2002-01-03 Real-Time Performance of Sorting Algorithms. 63-79 1999 16 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts16.html#Puschner99 2002-01-03 Fault-Tolerant Rate-Monotonic Scheduling. 149-181 1998 15 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#GhoshMMS98 2002-01-03 Combining Static Worst-Case Timing Analysis and Program Proof. 145-171 1996 11 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#ChapmanBW96 2003-06-17 Stability and Performance of List Scheduling With External Process Delays. 5-38 1998 15 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts15.html#DeogunKK98 2003-03-21 Real-Time Atomic Multicast Algorithms Implemented on a Shared Memory Multiprocessor. 55-91 2003 24 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#StokJ03 2002-01-03 Aperiodic Task Scheduling for Hard Real-Time Systems. 27-60 1989 1 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#SpruntSL89 2003-05-22 Graphical Animation as a Form of Prototyping Real-Time Software Systems. 173-195 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#PulliHL93 2002-01-03 Real-Time Object-Oriented Design and Formal Methods. 79-83 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Puente00 2002-01-03 A Traffic Generator for Testing Communication Systems: Presentation, Implementation and Performance. 5-24 1997 13 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#CelandroniFP97 2003-05-22 Dataflow Computer Extension Towards Real-Time Processing. 333-350 1989 1 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts1.html#Takesue89 2002-01-03 A Formal Approach to the Specification and the Behavior Validation of Real-Time Systems Based on Rewriting Logic. 5-22 1996 10 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts10.html#AttouiS96 2004-09-17 Dealing with Different Time Granularities in Formal Specifications of Real-Time Systems. 191-215 1991 3 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#CorsettiMR91 2003-05-22 Issues in Real-Time Data Management. 185-202 1992 4 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#Graham92 2002-01-03 Quality of Service Support for Multimedia Applications in Third Generation Mobile Networks Using Adaptive Scheduling. 269-284 2001 21 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts21.html#RichardsonSG01 2003-05-22 Polynomial-Time Transformations and Schedulability Analysis of Parallel Real-Time Programs with Restricted Resource Contention. 307-329 1992 4 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#StoyenkoM92 2003-05-22 High-Level Timed Petri Nets as a Kernel for Executable Specifications. 235-248 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#FelderGP93 2002-06-20 Scheduler Modeling Based on the Controller Synthesis Paradigm. 55-84 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#AltisenGS02 2003-05-22 Hartstone Uniprocessor Benchmark: Definitions and Experiments for Real-Time Systems. 353-382 1992 4 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#WeidermanK92 2003-05-22 Formal Timing Analysis for Distributed Real-Time Programs. 57-90 1994 7 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#WeddeKH94 2002-01-03 Timing Analysis for Data and Wrap-Around Fill Caches. 209-233 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#WhiteMHWH99 2002-01-03 Invited Note: Java for Real-Time. 197-205 1996 11 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts11.html#Nilsen96 2006-06-19 Scheduling and Priority Mapping for Static Real-Time Middleware. 155-182 2001 20 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts20.html#DipippoWECBBJTM01 2002-01-03 Flexible Real-Time Linux*: A Flexible Hard Real-Time Environment. 151-173 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#TerrasaGB02 2002-01-03 GPS-based Clock Synchronization in a Mobile, Distributed Real-Time System. 63-75 1997 12 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#Sterzbach97 2003-03-21 A Ravenscar-Compliant Run-time Kernel for Safety-Critical Systems. 29-54 2003 24 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#LundqvistA03 2002-01-03 An Integrated Path and Timing Analysis Method based on Cycle-Level Symbolic Execution. 183-207 1999 17 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts17.html#LundqvistS99 2006-09-18 Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling. 5-28 2003 24 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#LopezGDG03 2002-01-03 Real-Time Disk Scheduling for Multimedia Applications with Deadline-Modification-Scan Scheme. 149-168 2000 19 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#ChangSC00 2003-05-22 IPTES: A Concurrent Engineering Approach for Real-Time Software Development. 139-152 1993 5 Real-Time Systems 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#PulliE93 2002-06-20 Feedback-Feedforward Scheduling of Control Tasks. 25-53 2002 23 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts23.html#CervinEBA02 2003-05-22 Compositional Reasoning about Responsive Systems with Limited Resources. 291-313 1994 7 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#Schepers94 2003-10-31 An Approach to Platform Independent Real-Time Programming: (1) Formal Description. 61-85 2000 19 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#HoomanR00 2003-05-22 Dynamic Priority Scheduling of Periodic and Aperiodic Tasks in Hard Real-time Systems. 207-235 1994 6 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts6.html#HomayounR94 2003-03-21 Scheduling of Offset Free Systems. 239-258 2003 24 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#Goossens03 2002-01-03 Editorial. 5-6 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Albertos00 2003-05-22 Runtime Monitoring of Timing Constraints in Distributed Real-Time Systems. 247-273 1994 7 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#JahanianRR94 2002-05-10 Analysis of Railway Stations by Means of Interval Timed Coloured Petri Nets. 241-263 1995 9 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#AalstO95 2002-01-03 Are Object-Oriented Concepts Useful to Real-Time Systems Development? 89-94 2000 18 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Pereira00 2002-01-03 Triggered Updates for Temporal Consistency in Real-Time Databases. 209-243 2000 19 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts19.html#AhmedV00 2002-07-26 A Heuristic Approach to the Multitask-Multiprocessor Assignment Problem using the Empty-Slots Method and Rate Monotonic Scheduling. 167-199 1997 13 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts13.html#SantosFOC97 2002-01-03 Fast Heuristic Scheduling Based on Neural Networks for Real-Time Systems. 289-304 1995 9 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts9.html#ThawonmasCS95 2002-01-03 Editorial. 5-6 1998 14 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts14.html#HammerSW98 2003-05-22 Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems. 229-245 1994 7 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts7.html#BertossiM94 2003-05-22 Comparative Evaluation of High-Level Real-Time Programming Languages. 365-382 1990 2 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#HalangS90 2003-05-22 Conference Announcement: NATO Study Institute (ASI) on Real-Time Computing. 167-168 1992 4 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts4.html#HalangS92 2002-01-03 High Accuracy Concurrent Event Processing in Hard Real-Time Systems. 77-94 1997 12 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#HalangW97 2003-05-22 A Local Area Network Architecture for Communication in Distributed Real-Time Systems. 115-147 1991 3 Real-Time Systems 2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#ArvindRS91 2003-05-22 Time Capsules: An Abstraction for Access to Continuous-Media Data. 355-376 1991 3 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#Herrtwich91 2002-06-20 Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol. 251-280 2002 22 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#ZhangBMLY02 2003-05-22 Extending a Blackboard Architecture for Approximate Processing. 47-79 1990 2 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts2.html#DeckerLW90 2003-05-22 Evaluating the Expressive Power of the Real-Time Specification for Java. 319-359 2003 24 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts24.html#WellingsP03 2003-05-22 A Formalization of Priority Inversion. 285-303 1993 5 Real-Time Systems 4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts5.html#BabaogluMS93 2004-02-11 CesiumSpray: a Precise and Accurate Global Time Service for Large-scale Systems. 243-294 1997 12 Real-Time Systems 3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts12.html#VerissimoRC97 2002-01-03 Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling. 49-75 2002 22 Real-Time Systems 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts22.html#BernatB02 2003-05-22 global Cyclic Scheduling: A Method to Guarantee the Timing Behavior of Distributed Real-Time Systems. 45-66 1991 3 Real-Time Systems 1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts3.html#Agne91 2002-01-03 Timing Analysis for Instruction Caches. 217-247 2000 18 Real-Time Systems 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts18.html#Muller00 2004-02-12 Burst Mode Bandwidth Allocation for Real-Time Messages in IEEE 802.12 Networks. 207-229 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025172108841 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#KimKSC03 2004-02-12 The Valid Use of Utility in Adaptive Real-Time Systems. 277-296 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025184411567 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#PrasadBA03 2004-02-12 Response Time Analysis of Asynchronous Real-Time Systems. 131-156 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025115923862 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#Bernat03 2004-02-12 Reactive and Real-Time Systems Course: How to Get the Most Out of it. 231-253 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025180310659 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#Lev-AmiT03 2004-02-12 Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors. 187-205 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025120124771 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#GoossensFB03 2004-02-12 Compact Data Structures and State-Space Reduction for Model-Checking Real-Time Systems. 255-275 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025132427497 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#LarsenLPY03 2004-02-12 Multicycle Polling Scheduling Algorithms for FieldBus Networks. 157-185 2003 25 Real-Time Systems 2-3 http://dx.doi.org/10.1023/A:1025167907933 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts25.html#CavalieriMCS03 2004-02-12 Integrating Data Flow Equations with UML/Realtime. 107-125 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009308.63403.e6 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#BichlerRS04 2004-02-12 The Distributed Time-Triggered Simulation Scheme: Core Principles and Supporting Execution Engine. 9-28 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009304.92936.70 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#Kim04 2004-02-12 Guest Editorial. 7-8 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009349.39890.a1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#BacellarS04 2004-02-12 Real-Time Garbage Collection for a Multithreaded Java Microcontroller. 89-106 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009307.23568.4b http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#PfefferUFKB04 2004-02-12 An Adaptive Middleware for Context-Sensitive Communications for Real-Time Applications in Ubiquitous Computing Environments. 29-61 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009305.62647.ee http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#YauK04 2004-02-12 Memory Management for Real-Time Java: An Efficient Solution using Hardware Support. 63-87 2004 26 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000009306.22263.59 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#Higuera-ToledanoIBP04 2005-04-26 Mode Change Protocols for Real-Time Systems: A Survey and a New Proposal. 161-197 2004 26 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000016129.97430.c6 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#RealC04 2005-04-26 Replication Management in Reliable Real-Time Systems. 261-296 2004 26 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000018248.18519.46 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#PinhoVW04 2005-04-26 <sub>2</sub>Controllers for Sampled-Data Systems with Input Time Delays. 231-260 2004 26 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000018245.94136.d0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#ParkPCLK04 2005-04-26 Modeling Complex Real-Time and Embedded Systems-The UML and DORIS Combination. 135-159 2004 26 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000016128.45507.07 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#HullEH04 2005-04-26 Probabilistic Schedulability Analysis of Harmonic Multi-Task Systems with Dual-Modular Temporal Redundancy. 199-222 2004 26 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000016130.91111.75 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#KimK04 2005-04-26 Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems. 297-325 2004 26 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000018246.09796.a3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts26.html#PopEP04 2005-04-26 Diagnostics and Surveillance Methods in Nuclear Systems for Real-Time Applications. 97-113 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019129.88316.c7 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#Pazsit04 2005-04-26 Using Program Transformations to Provide Safety Properties for Real-Time Systems. 191-207 2004 27 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000027933.63133.5f http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#TsaiW04 2005-04-26 Guest Editorial: Special Issue for Applications of Intelligent Real-Time Systems for Nuclear Engineering. 5-6 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019123.50572.8e http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#Ruan04 2005-04-26 Hard Real-Time Communication with the Timed Token Protocol: Current State and Challenging Problems. 271-295 2004 27 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000029051.60313.06 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#ZhangBCL04 2005-04-26 Redundant Sensor Calibration Monitoring Using Independent Component Analysis and Principal Component Analysis. 27-47 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019125.96107.ac http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#DingGHR04 2005-04-26 A Real-Time Artificially Intelligent Monitoring System for Nuclear Power Plants Operators Support. 71-83 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019127.50572.9b http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#SchirruP04 2005-04-26 Classification of Steam Generator Tube Defects for Real-Time Applications Using Eddy Current Test Data and Self-Organizing Maps. 49-70 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019126.26053.23 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#MesquitaTCU04 2005-04-26 Enhancing Cross-Correlation Analysis with Artificial Neural Networks for Nuclear Power Plant Feedwater Flow Measurement. 85-96 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019128.81821.87 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#RoversoR04 2005-04-26 A Model for Updating Real-Time Applications. 169-189 2004 27 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000027932.11280.3c http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#Montgomery04 2005-04-26 Scheduling Value-Based Nested Transactions in Distributed Real-Time Database Systems. 237-269 2004 27 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000029050.47538.25 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#ChenC04 2005-04-26 Resource Reservation in Dynamic Real-Time Systems. 123-167 2004 27 Real-Time Systems 2 http://dx.doi.org/10.1023/B:TIME.0000027934.77900.22 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#AbeniB04 2005-04-26 Uncertainty Analysis of Memory Based Sensor Validation Techniques. 7-26 2004 27 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000019124.24404.e9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#GribokUH04 2005-04-26 A Task Model to Reduce Control Delays. 215-236 2004 27 Real-Time Systems 3 http://dx.doi.org/10.1023/B:TIME.0000029049.50766.fa http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts27.html#BalbastreRVC04 2005-12-07 Real-Time Operating Systems. 237-253 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045319.20260.73 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#StankovicR04 2005-07-18 Real Time Scheduling Theory: A Historical Perspective. 101-155 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045315.61234.1e http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#ShaAACBBBCLM04 2005-04-26 Online QoS Optimization Using Service Classes in Surveillance Radar Systems. 5-37 2004 28 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000033377.75148.d0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#LeeSS04 2005-04-26 Design for Timing Predictability. 157-177 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045316.66276.6e http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#ThieleW04 2005-04-26 Specification and Timing Analysis of Real-Time Systems. 69-90 2004 28 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000033379.78994.1a http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#WangT04 2005-04-26 Editorial Special Anniversary Issue. 99-100 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045314.51412.71 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#X04a 2005-04-26 Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems. 39-68 2004 28 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000033378.56741.14 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#LopezDG04 2005-06-03 Real-Time Databases and Data Services. 179-215 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045317.37980.a5 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#RamamrithamSD04 2005-04-26 Licensing Reliable Embedded Software for Safety-Critical Applications. 217-236 2004 28 Real-Time Systems 2-3 http://dx.doi.org/10.1023/B:TIME.0000045318.83240.86 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts28.html#Saglietti04 2005-04-26 On the Dynamic Semantics and the Timing Behavior of Ravenscar Kernels. 59-89 2005 29 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000048937.17571.2b http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#VardanegaZP05 2005-04-26 Modeling Control Speculation for Timing Analysis. 27-58 2005 29 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000048933.15922.f9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#LiMR05 2005-04-26 Rate Monotonic vs. EDF: Judgment Day. 5-26 2005 29 Real-Time Systems 1 http://dx.doi.org/10.1023/B:TIME.0000048932.30002.d9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#Buttazzo05 2006-01-13 Integrated Adaptive QoS Management in Middleware: A Case Study. 101-130 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6881-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#GillGCLSAS05 2006-01-13 Radio-Triggered Wake-Up for Wireless Sensor Networks. 157-182 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6883-z http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#GuS05 2006-01-13 A Real-Time Image Recognition System for Tiny Autonomous Mobile Robots. 247-261 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6887-8 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#MahlknechtON05 2006-01-13 String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC). 227-246 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6886-9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#BellaachiaR05 2006-01-13 CCMPerf: A Benchmarking Tool for CORBA Component Model Implementations. 281-308 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6889-6 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#KrishnaNGSWT05 2006-01-13 Dynamic Voltage Scaling for Digital Control System Implementation. 263-280 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6888-7 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#LeeK05 2006-01-13 Editorial. 99-99 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6880-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#AbdelzaherS05 2006-01-13 Global Control of Robotic Highway Safety Markers: A Real-time Solution. 183-204 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6884-y http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#ShiGLDF05 2006-01-13 Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications. 205-225 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6885-x http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#WandelerMT05 2006-01-13 QoS Management Through Adaptive Reservations. 131-155 2005 29 Real-Time Systems 2-3 http://dx.doi.org/10.1007/s11241-005-6882-0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts29.html#AbeniCLMP05 2006-01-13 Pre-Scheduling. 83-103 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0505-y http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#WangMF05 2006-01-31 Guest Editorial. 5-6 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0501-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#Puschner05 2006-01-13 Integrating On-Line Performance Visualization and Real-Time System Design. 163-185 2005 30 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-2745-2 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#BakicM05 2006-01-13 QoS Control Strategies for High-Quality Video Processing. 7-29 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0502-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#WustSVBH05 2006-01-31 A QoS-Enabled Transmission Scheme for MPEG Video Streaming. 217-256 2005 30 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-1401-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#NgLH05 2006-01-13 Feasibility Analysis of Real-Time Periodic Tasks with Offsets. 105-128 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0506-x http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#PellizzoniL05 2006-01-13 Timing Analysis of Real-Time Communication Under Electromagnetic Interference. 55-81 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0504-z http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#BrosterBR05 2006-03-29 A Technique for Adaptive Scheduling of Soft Real-Time Tasks. 187-215 2005 30 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-2461-y http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#BeccariCZ05 2006-01-13 Design, Implementation and Evaluation of a Real-Time Active Content Distribution Service. 31-53 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0503-0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#HuangSA05 2006-01-13 Measuring the Performance of Schedulability Tests. 129-154 2005 30 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-005-0507-9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts30.html#BiniB05 2006-01-13 Maximizing the Robustness of TDMA Networks with Applications to TTP/C. 5-31 2005 31 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-005-2743-4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts31.html#GaujalN05 2006-01-13 Feedback EDF Scheduling of Real-Time Tasks Exploiting Dynamic Voltage Scaling. 33-63 2005 31 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-005-2744-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts31.html#ZhuM05 2006-05-23 Group-Based Pfair Scheduling. 125-168 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-4687-8 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#HolmanA06 2006-05-23 Code Analysis for Temporal Predictability. 253-277 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4683-4 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#GustafssonLKP06 2006-05-23 An Analysis of Fixed-Priority Schedulability on a Multiprocessor. 49-71 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/S11241-005-4686-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#Baker06 2006-05-23 Guest Editorial: Introduction to the Special Issue. 171-173 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4678-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#KimP06 2006-05-23 The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors. 9-20 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-4961-9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#Baruah06 2006-05-23 Real-Time Camera Tracking for Mobile Devices: The VisiTrack System. 279-305 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4684-3 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#StichlingEKK06 2006-05-23 Scalable Online Feasibility Tests for Admission Control in a Java Real-Time System. 175-195 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4679-0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#Brinkschulte06 2006-05-23 The TTA's Approach to Resilience after Transient Upsets. 213-233 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4681-6 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#SteinerPK06 2006-05-23 Editorial. 5-7 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-6900-9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#StankovicHMABR06 2006-05-23 Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks. 21-47 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-4962-8 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#MarchandS06 2006-05-23 A Non-Blocking Buffer Mechanism for Real-Time Event Message Communication. 197-211 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4680-7 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#Kim06 2006-05-23 Modular Design of Real-Time Systems Using Hierarchical Communicating Real-time State Machines. 105-123 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-5318-0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#FurfaroNP06 2006-05-23 A Dynamic Shadow Approach to Fault-Tolerant Mobile Agents in an Autonomic Environment. 235-252 2006 32 Real-Time Systems 3 http://dx.doi.org/10.1007/s11241-005-4682-5 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#XuP06 2006-05-23 A Method for Computing the Number of Iterations in Data Dependent Loops. 73-104 2006 32 Real-Time Systems 1-2 http://dx.doi.org/10.1007/s11241-006-5317-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts32.html#CuratelliM06 2006-05-23 Verifying distributed real-time properties of embedded systems via graph transformations and model checking. 77-100 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6883-y http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#MadlAS06 2006-05-23 Integrated QoS-aware resource management and scheduling with multi-resource constraints. 7-46 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6881-0 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#GhoshRHL06 2006-05-23 A framework for modular analysis and exploration of heterogeneous embedded systems. 101-137 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6884-x http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#HamannJRE06 2006-05-23 Combination of clock-state and clock-rate correction in fault-tolerant distributed systems. 139-173 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6885-9 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#KopetzAH06 2006-05-23 Finite-horizon scheduling of radar dwells with online template construction. 47-75 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6882-z http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#GopalakrishnanCSLS06 2006-05-23 Editorial. 5 2006 33 Real-Time Systems 1-3 http://dx.doi.org/10.1007/s11241-006-6880-1 http://www.informatik.uni-trier.de/~ley/db/journals/rts/rts33.html#Anderson06 2002-10-29 A decision framework for enterprise resource planning maintenance and upgrade: A client perspective. 431-468 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Ng01 2002-10-29 Predicting project delivery rates using the Naive-Bayes classifier. 161-179 2002 14 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#Stewart02 2002-10-29 Emergent maintenance of ERP: new roles and relationships. 373-38 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#HirtS01 2002-10-29 Ageing of a data-intensive legacy system: symptoms and remedies. 281-308 2001 13 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Visaggio01 2002-12-17 Change impact analysis to support architectural evolution. 317-333 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.258 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#ZhaoYXX02 2002-10-29 A semantic entropy metric. 293-310 2002 14 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#EtzkornGH02 2002-10-29 Large packaged application software maintenance: a research framework. 351-371 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#GableCT01 2002-10-29 Metrics for maintainability of class inheritance hierarchies. 147-160 2002 14 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#SheldonJC02 2002-01-03 Review of Frank Niessink's thesis. 185 2000 12 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Vliet00 2002-10-29 Experimental evaluation of hypertext access structures. 83-108 2002 14 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#Koskinen02 2003-02-13 A concept-oriented belief revision approach to domain knowledge recovery from source code. 31-52 2001 13 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#LiYC01 2004-04-21 Maintenance issues in the Web site development process. 109-122 2002 14 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#TaylorMSM02 2002-10-29 A case study in repeated maintenance. 127-141 2001 13 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#WangSH01 2002-10-29 Computing ripple effect for software maintenance. 263-279 2001 13 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Black01 2002-12-17 Relating functional requirements and software architecture: separation and consistency of concerns. 371-388 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.261 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#HeckelE02 2002-01-03 Software maintenance from a service perspective. 103-120 2000 12 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#NiessinkV00 2006-02-02 Behavioural modelling of long-lived evolution processes - some issues and an example. 335-351 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.259 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#LehmanKR02 2002-01-03 Practical Software Maintenance. 249-253 2000 12 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Seaman00 2002-10-29 Software Maintenance: Concepts and Practice. 143-147 2001 13 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Seaman01 2002-01-03 Pattern-based software reengineering: a case study. 121-141 2000 12 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#ChuLSH00 2002-01-03 A formal approach for component retrieval and integration analysis. 325-342 2000 12 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#ChuLYH00 2002-01-03 Maintaining a legacy: towards support at the architectural level. 143-170 2000 12 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#BrilFGKW00 2002-10-29 An approach for extracting code fragments that implement functionality from source programs. 53-75 2001 13 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#TanK01 2002-01-03 Software problem reporting and resolution process at ABB Robotics AB: state of practice. 255-285 2000 12 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Kajko-MattssonFA00 2002-01-03 Object localization in procedural programs: a graph-based approach. 305-323 2000 12 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#CarverV00 2002-10-29 Case study: a maintenance practice used with real-time telecommunications software. 97-126 2001 13 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#PopovicAK01 2006-04-04 An improved method of selecting regression tests for C++ programs. 331-350 2001 13 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#JangMK01 2002-10-29 An empirical study of the influence of departmentalization and organizational position on software maintenance. 65-82 2002 14 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#YehJ02 2002-01-03 Abstraction: a key notion for reverse engineering in a system reengineering approach. 197-228 2000 12 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#YangLZ00 2002-01-03 Evaluating regression test suites based on their fault exposure capability. 171-184 2000 12 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#ElbaumM00 2002-10-29 Problem management maturity within corrective maintenance. 197-227 2002 14 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#Kajko-Mattsson02 2002-01-03 Metrics in the development and maintenance of software: an application in a large scale environment. 343-355 2000 12 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#FasolinoNPQ00 2002-10-29 Field studies using functional size measurement in building estimation models for software maintenance. 31-64 2002 14 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#AbranSP02 2002-10-29 Inference of object-oriented design patterns. 309-330 2001 13 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#TonellaA01 2002-10-29 Types of software evolution and software maintenance. 3-30 2001 13 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#ChapinHKRT01 2002-10-29 Testing and maintaining de-localized software systems in a multi-site environment using Web-based tools. 181-195 2002 14 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#BalajiS02 2002-10-29 The maintenance implications of the customization of ERP software. 415-429 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Light01 2002-10-29 Interview with Girish Parikh. 201-221 2001 13 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#ParikhC01 2002-01-03 Measure-driven processes and architecture for the empirical evaluation of software technology. 47-78 2000 12 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Cantone00 2002-12-17 Separation of concerns for software evolution. 311-315 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.257 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#MensW02 2002-10-29 Graph-based tools for re-engineering. 257-292 2002 14 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#CremerMW02 2002-10-29 Policy analysis for warranty, maintenance, and upgrade of software systems. 469-493 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#SahinZ01 2002-01-03 Preventive actions for residual Y2K defects: a case study. 1-23 2000 12 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Interesse00 2002-10-29 Modelling fault-proneness statistically over a sequence of releases: a case study. 167-199 2001 13 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#OhlssonAW01 2006-01-23 Evolving hypermedia systems: a layered software architecture. 389-405 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.262 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#Garcia-CabreraRP02 2004-05-04 Separating computation, coordination and configuration. 353-369 2002 14 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.260 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#AndradeFGK02 2002-10-29 Characteristics of ERP software maintenance: a multiple case study. 399-414 2001 13 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#NahFC01 2004-01-14 MANTOOL: a tool for supporting the software maintenance process. 77-95 2001 13 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#UsaolaVG01 2002-01-03 Stability assessment of evolving industrial object-oriented frameworks. 79-102 2000 12 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#MattssonB00 2002-10-29 Impact of experience on maintenance skills. 123-146 2002 14 Journal of Software Maintenance 2 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#JorgensenS02 2002-01-03 Deriving fault architectures from defect history. 287-304 2000 12 Journal of Software Maintenance 5 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#AndrewsOW00 2002-10-29 Function-point analysis using design specifications based on the Unified Modelling Language. 223-243 2001 13 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#UemuraKI01 2002-10-29 Evaluation of a scenario-based reading technique for analysing process components. 149-166 2001 13 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#TortorellaV01 2002-10-29 Announcement. 1-2 2001 13 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#ChapinC01 2002-10-29 Piecemeal legacy migrating with an architectural pattern language: a case study. 1-30 2002 14 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#GoedickeZ02 2002-01-03 A maintenance-oriented approach to software construction. 25-45 2000 12 Journal of Software Maintenance 1 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#SchachT00 2002-10-29 A model of factors affecting an information system's change in state. 245-261 2001 13 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr13.html#Pereira01 2002-10-29 Automating the management of software maintenance workflows in a large software enterprise: a case study. 229-255 2002 14 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#AversanoCLS02 2002-01-03 Complex COTS-based software systems: practical steps for their maintenance. 357-376 2000 12 Journal of Software Maintenance 6 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#CarneyHP00 2002-01-03 Test case selection for simulations in the maintenance of real-time systems. 229-248 2000 12 Journal of Software Maintenance 4 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Henry00 2002-01-03 Review of Perspectives on Improving Software Maintenance by Frank Niessink. 187-195 2000 12 Journal of Software Maintenance 3 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr12.html#Chapin00 2004-03-26 Identifying high maintenance legacy software. 429-446 2002 14 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.256 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#HarrisonW02 2004-03-26 A model of factors affecting an information system's change in state. 409-427 2002 14 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.271 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#Heales02 2004-03-26 Consistent database sampling as a database prototyping approach. 447-459 2002 14 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.263 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr14.html#BisbalG02 2004-08-27 Tailoring the software maintenance process to better support complex systems evolution projects. 27-40 2003 15 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.266 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#Donzelli03 2004-08-27 A user-assisted approach to component clustering. 265-295 2003 15 Journal of Software Maintenance 4 http://dx.doi.org/10.1002/smr.277 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#SartipiK03 2004-08-27 Maintaining electronic commerce systems: the legal issues. 61-69 2003 15 Journal of Software Maintenance 2 http://dx.doi.org/10.1002/smr.268 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#Taylor03 2004-08-27 Automated elicitation of inclusion dependencies from the source code for database transactions. 379-392 2003 15 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.290 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#TanZ03 2004-08-27 Advances in Software Maintenance Management: Technologies and Solutions. 375-377 2003 15 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.288 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#Seaman03 2004-08-27 Test processes in software product evolution - a qualitative survey on the state of practice. 41-59 2003 15 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.265 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#RunesonAH03 2004-08-27 An effective strategy for legacy systems evolution. 325-344 2003 15 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.278 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#RahgozarO03 2004-08-27 A case study on the adaptive maintenance of an Internet application. 254-264 2003 15 Journal of Software Maintenance 4 http://dx.doi.org/10.1002/smr.275 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#BerginK03 2004-08-27 Observe-mine-adopt (OMA): an agile way to enhance software maintainability. 297-323 2003 15 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.287 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#HayesMG03 2004-08-27 Architecture-based semantic evolution of embedded remotely controlled systems. 145-190 2003 15 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.273 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#ChungS03 2004-08-27 Guaranteed inconsistency avoidance during software evolution. 393-416 2003 15 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.289 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#GallagherHD03 2004-08-27 Latitudinal and longitudinal process diversity. 9-25 2003 15 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.264 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#SiebelCSR03 2004-08-27 The software maintenance project effort estimation model based on function points. 71-85 2003 15 Journal of Software Maintenance 2 http://dx.doi.org/10.1002/smr.269 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#AhnSKK03 2004-08-27 Determinants of software volatility: a field study. 191-204 2003 15 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.276 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#ZhangWP03 2004-08-27 Software visualization in software maintenance, reverse engineering, and re-engineering: a research survey. 87-109 2003 15 Journal of Software Maintenance 2 http://dx.doi.org/10.1002/smr.270 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#Koschke03 2004-08-27 Integrating diverse paradigms in evolution and maintenance by an XML-based unified model. 111-114 2003 15 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.272 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#LuCCYL03 2004-08-27 Process diversity. 1-8 2003 15 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.267 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#RusSL03 2005-11-02 Feed-forward and recurrent neural networks for source code informal information analysis. 205-244 2003 15 Journal of Software Maintenance 4 http://dx.doi.org/10.1002/smr.274 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#MerloMD03 2004-08-27 Dimensions of reengineering environment infrastructures. 345-373 2003 15 Journal of Software Maintenance 5 http://dx.doi.org/10.1002/smr.279 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr15.html#DucasseT03 2004-08-27 Seventh European Conference on Software Maintenance and Reengineering (CSMR 2003). 217-218 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.294 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#BrandCG04 2004-08-27 Web Site Evolution. 1-4 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.280 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#BoldyreffT04 2004-08-27 Revitalizing modifiability of legacy assets. 219-254 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.295 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#Veerman04 2004-08-27 Problems within front-end support. 309-329 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.298 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#Kajko-Mattsson04 2004-08-27 An assessment strategy for identifying legacy system evolution requirements in eBusiness context. 255-276 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.296 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#AversanoT04 2004-08-27 Reverse engineering Web applications: the WARE approach. 71-101 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.281 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#LuccaFT04 2004-08-27 Migrating to Web services: a performance engineering approach. 51-70 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.285 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#Litoiu04 2005-01-03 A debugging strategy based on the requirements of testing. 277-308 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.297 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#ChaimMJ04 2004-08-27 Statistical testing of Web applications. 103-127 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.284 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#TonellaR04 2004-08-27 Modelling the evolution of legacy systems to Web-based systems. 5-30 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.282 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#LaveryBLA04 2005-02-01 On the business value and technical challenges of adopting Web services. 31-50 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.283 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#TilleyGHHMSW04 2004-08-27 Improving design quality using meta-pattern transformations: a metric-based approach. 331-361 2004 16 Journal of Software Maintenance 4-5 http://dx.doi.org/10.1002/smr.299 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#TahvildariK04 2004-08-27 Hypertext support for the information needs of software maintainers. 187-215 2004 16 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.292 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#KoskinenSP04 2004-10-07 Displaying dependence graphs: a hierarchical approach. 151-185 2004 16 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.291 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#Balmas04 2004-08-27 Analysis of Web-usage behavior for focused Web sites: a case study. 129-150 2004 16 Journal of Software Maintenance 1-2 http://dx.doi.org/10.1002/smr.286 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#El-RamlyS04 2005-11-29 Using software trails to reconstruct the evolution of software. 367-384 2004 16 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.301 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#German04 2005-06-10 Visualizing feature evolution of large-scale software based on problem and modification report data. 385-403 2004 16 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.302 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#FischerG04 2005-06-10 A metrics suite for grammar-based software. 405-426 2004 16 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.293 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#PowerM04 2005-06-10 Analyzing the Evolution of Large-Scale Software. 363-365 2004 16 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.300 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#MensRG04 2005-06-10 Expectation-based, inference-based, and bottom-up software comprehension. 427-447 2004 16 Journal of Software Maintenance 6 http://dx.doi.org/10.1002/smr.307 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr16.html#OBrienBS04 2005-06-10 Software Maintenance Maturity Model (SMmm): the software maintenance process model. 197-223 2005 17 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.311 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#AprilHAD05 2005-06-10 Assessing the capability of internal metrics as early indicators of maintenance effort through experimentation. 225-246 2005 17 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.312 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#BoccoMP05 2005-06-10 Reusing class-based test cases for testing object-oriented framework interface classes. 169-196 2005 17 Journal of Software Maintenance 3 http://dx.doi.org/10.1002/smr.308 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#Al-DallalS05 2005-06-10 An approach to the measurement of software evolution. 65-91 2005 17 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.303 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#NikoraM05 2005-06-10 Automating regression testing for evolving GUI software. 27-64 2005 17 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.305 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#MemonNX05 2005-06-10 Development and evolution of a heterogeneous continuous media server: a case study. 143-167 2005 17 Journal of Software Maintenance 2 http://dx.doi.org/10.1002/smr.309 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#MakaroffH05 2005-06-10 A database evolution taxonomy for object-oriented databases. 93-141 2005 17 Journal of Software Maintenance 2 http://dx.doi.org/10.1002/smr.310 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#RashidS05 2005-06-10 Architectural support in industry: a reflection using C-POSH. 3-25 2005 17 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.304 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#BrilKP05 2005-06-10 Analyzing the Evolution of Large-Scale Software. 1-2 2005 17 Journal of Software Maintenance 1 http://dx.doi.org/10.1002/smr.306 http://www.informatik.uni-trier.de/~ley/db/journals/smr/smr17.html#PfleegerVV05 2003-11-19 A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. 481-495 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#AkutsuMK03 2003-11-19 ELAN from a rewriting logic point of view. 155-185 2002 285 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#BorovanskyKKM02 http://dx.doi.org/10.1016/S0304-3975(01)00358-9 2003-11-19 Unification in Commutative Idempotent Monoids. 345-353 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#BaaderB88 2003-11-19 Combination Techniques and Decision Problems for Disunification. 229-255 1995 142 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#BaaderS95 http://dx.doi.org/10.1016/0304-3975(94)00277-0 2003-11-19 Combination of Constraint Solvers for Free and Quasi-Free Structures. 107-161 1998 192 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#BaaderS98 http://dx.doi.org/10.1016/S0304-3975(97)00147-3 2003-11-19 A Nonlinear Lower Bound on the Practical Combinational Complexity. 335-342 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#GubasHW95 http://dx.doi.org/10.1016/0304-3975(94)00269-O 2003-11-19 Publications of Jean Berstel. 3-7 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#X03 2003-11-19 Breaking DES using P systems. 495-508 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00531-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#KrishnaR03 2003-11-19 Communication Complexity Hierarchy. 109-115 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Hromkovic86 2003-11-19 Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. 325-330 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Hromkovic87 2003-11-19 The Advantages of a New Approach to Defining the Communication Complexity for VLSI. 91-111 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Hromkovic88 2003-11-19 Tradeoffs for Language Recognition on Alternating Machines. 203-221 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Hromkovic89 2003-11-19 Automatic synthesis of schedulers in timed systems. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Krishnan00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Automatic synthesis of a subclass of schedulers in timed systems. 347-363 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00813-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Krishnan03 2003-11-19 A Semantic Characterisation for Faults in Replicated Systems. 159-177 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#Krishnan94 2003-11-19 Contrast-optimal k out of n secret sharing schemes in visual cryptography. 471-485 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#HofmeisterKS00 http://dx.doi.org/10.1016/S0304-3975(99)00243-1 2003-11-19 Discovering instances of poetic allusion from anthologies of classical Japanese poems. 497-524 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#TakedaFNYT03 2003-11-19 The Euclidean Traveling Salesman Problem is NP-Complete. 237-244 1977 4 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Papadimitriou77 2003-11-19 Real-Time and Probabilistic Systems - Foreword. 1-3 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Katoen02 http://dx.doi.org/10.1016/S0304-3975(01)00042-1 2003-11-19 Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz. 335-366 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#MundiciO98 http://dx.doi.org/10.1016/S0304-3975(98)00012-7 2003-11-19 Optimal Comparison Strategies in Ulam's Searching Game with Two Errors. 217-232 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#MundiciT97 http://dx.doi.org/10.1016/S0304-3975(97)00030-3 2003-11-19 Repeatable Words for Substitution. 319-333 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#NishidaK87 2003-11-19 On slender 0L languages. 279-286 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#NishidaS00 http://dx.doi.org/10.1016/S0304-3975(99)00111-5 2003-11-19 Slender 0L Languages. 161-176 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#NishidaS96 http://dx.doi.org/10.1016/0304-3975(95)00067-4 2003-11-19 On the Holonomy Decomposition of Transformation Semigroups. 99-104 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Holcombe82 2003-11-19 Enumerative Sequences of Leaves and Nodes in Rational Trees. 41-60 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#BassinoBP99 http://dx.doi.org/10.1016/S0304-3975(99)00026-2 2003-11-19 Note on the Generalization of Calculations. 3-11 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Baaz99 http://dx.doi.org/10.1016/S0304-3975(98)00304-1 2003-11-19 A Continuous Semantics for Unbounded Nondeterminism. 187-210 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Back83 2003-11-19 Analysis of Dehn's Algorithm by Critical Pairs. 27-52 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Chenadec87 2003-11-19 Fixed Points in Cartesian Closed Categories. 65-72 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Barr90 2003-11-19 Terminal Coalgebras in Well-Founded Set Theory. 299-315 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Barr93 2003-11-19 Additions and Corrections to ``Terminal Coalgebras in Well-founded Set Theory''. 189-192 1994 124 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Barr94 2003-11-19 Nonsymmetric *-Autonomous Categories. 115-130 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Barr95 http://dx.doi.org/10.1016/0304-3975(94)00089-2 2003-11-19 Binary Periodic Synchronizing Sequences. 253-281 1992 102 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Skubiszewski92 2003-11-19 Alice in the Land of Oz - An Interoperability-based Implementation of a Functional Language on Top of a Relational Language. 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#Kornstaedt01 2003-11-19 On the Algebraic Complexity of Rational Iteration Procedures. 313-324 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Baur91 2003-11-19 A Theory of Compaction-Based Parallelization. 121-154 1990 73 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Aiken90 2003-11-19 When does a random Robin Hood win? 477-484 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00289-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#GasarchGS03 2003-11-19 The Polynomial-Time Hierarchy. 1-22 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Stockmeyer76 2003-11-19 Exponential transient length generated by a neuronal recurrence equation. 513-533 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00343-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#NdoundamT03 2003-11-19 Le nombre de posets à isomorphie près ayant 12 èlèments. 89-94 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#ChaunierL94 2003-11-19 Parallel Update Transactions. 93-114 1990 76 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#KarabegV90 2003-11-19 Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. 189-203 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Jonsson00 http://dx.doi.org/10.1016/S0304-3975(98)00343-0 2003-11-19 On the Petri net realization of context-free graphs. 573-598 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#Darondeau01 http://dx.doi.org/10.1016/S0304-3975(00)00162-6 2003-11-19 About Fair Asynchrony. 305-336 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Darondeau85 2003-11-19 Codes Circulaires, Automates Locaux et Entropie. 283-302 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Beal88 2003-11-19 Reducibility of Synchronization Structures. 301-314 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#GinzburgY85 2003-11-19 A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems. 127-157 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#SchepersH94 2003-11-19 The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm. 291-310 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Schmid93 2003-11-19 Random Trees in Queueing Systems with Deadlines. 277-314 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#Schmid95 http://dx.doi.org/10.1016/0304-3975(94)00282-N 2003-11-19 Boolean Layer Cakes. 255-278 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Schmid99 http://dx.doi.org/10.1016/S0304-3975(98)00274-6 2003-11-19 Computational ideal theory in finitely generated extension rings. 1-33 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#Apel00 http://dx.doi.org/10.1016/S0304-3975(00)00172-9 2003-11-19 Dynamics of Positive Automata Networks. 19-32 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Ch85 2003-11-19 Lyapunov Operators to Study the Convergence of Extremal Automata. 329-337 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Ch94 2003-11-19 The Complexity of the Satisfiability Problem for Krom Formulas. 319-341 1984 30 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#DenenbergL84 2003-11-19 Variations on Mobile Processes. 327-368 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#Fu99 http://dx.doi.org/10.1016/S0304-3975(99)00037-7 2003-11-19 A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs. 33-47 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#He88 2003-11-19 An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors. 299-312 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#He90 2003-11-19 <i>k</i><i>k</i>IBDDs. 45-60 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#BolligSSW98 http://dx.doi.org/10.1016/S0304-3975(97)00034-0 2003-11-19 Relatively Recursive Reals and Real Functions. 99-120 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Ho99 http://dx.doi.org/10.1016/S0304-3975(98)00098-X 2003-11-19 La Reconnaissance des Facteurs d'un Mot dans un Texte. 35-52 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Spehner86a 2003-11-19 Reducibilities on Real Numbers. 101-123 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Ko84 2003-11-19 On Some Natural Complete Operators. 1-30 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Ko85 2003-11-19 On the Continued Fraction Representation of Computable Real Numbers. 299-313 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Ko86 2003-11-19 On Helping by Robust Oracle Machines. 15-36 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#Ko87 2003-11-19 On Adaptive Versus Nonadaptive Bounded Query Machines. 51-69 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Ko91 2003-11-19 A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. 241-270 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Ko95 http://dx.doi.org/10.1016/0304-3975(94)00154-B 2003-11-19 On Determining Optimal Strategies in Pursuit Games in the Plane. 203-234 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#Le98 http://dx.doi.org/10.1016/S0304-3975(97)00229-6 2003-11-19 Selected papers from ALT 1997 - Foreword. 1 2001 261 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Li01 http://dx.doi.org/10.1016/S0304-3975(00)00130-4 2003-11-19 Is DNA computing viable for 3-SAT problems? 2095-2107 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Li03 2003-11-19 ⁰[2]. 297-303 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#Lu01 http://dx.doi.org/10.1016/S0304-3975(00)00145-6 2003-11-19 On the Computational Complexity of the General Discrete Fourier Transform. 331-339 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Beth87 2003-11-19 Adequacy Properties of Path Programs. 149-171 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Best82 2003-11-19 From modal logic to terminal coalgebras. 209-228 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Ro01 http://dx.doi.org/10.1016/S0304-3975(00)00128-6 2003-11-19 An operational and denotational approach to non-context-freeness. 261-289 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#KolbMMM03 2003-11-19 No feasible monotone interpolation for simple combinatorial reasoning. 477-482 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#Arai00 http://dx.doi.org/10.1016/S0304-3975(99)00142-5 2003-11-19 A Proper Hierarchy of Propositional Sequent Calculi. 343-354 1996 159 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Arai96 http://dx.doi.org/10.1016/0304-3975(95)00193-X 2003-11-19 Etude Syntaxique de Certains Langages Solutions d'Equations avec Operateurs. 51-84 1977 5 1 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Chottin77 2003-11-19 Dynamic Constraints and Object Migration. 195-236 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#Su97 http://dx.doi.org/10.1016/S0304-3975(96)00142-9 2003-11-19 Coexistence of Uniquely Ergodic Subsystems of Interval Mapping. 167-181 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Ye94 2003-11-19 Opérations polynomiales et hiérarchies de concaténation. 71-84 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Arfi91 2003-11-19 Dot operators. 501-523 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#BorchertS01 http://dx.doi.org/10.1016/S0304-3975(00)00323-6 2003-11-19 Post-plus languages. 85-105 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Yu01 http://dx.doi.org/10.1016/S0304-3975(99)00157-7 2003-11-19 ERCW PRAMs and Optical Communication. 153-180 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#MacKenzieR98 http://dx.doi.org/10.1016/S0304-3975(97)00199-0 2003-11-19 Makanin's Algorithm is not Primitive Recursive. 145-156 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#KoscielskiP98 http://dx.doi.org/10.1016/S0304-3975(96)00321-0 2003-11-19 Lower bounds on the minus domination and k-subdomination numbers. 89-98 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00434-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#KangQSD03 2003-11-19 On the k-ary Hypercube. 333-339 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#Bettayeb95 http://dx.doi.org/10.1016/0304-3975(94)00197-Q 2003-11-19 Relationships Between Classes of Monotonic Functions. 225-247 1976 2 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Trakhtenbrot76 2003-11-19 Sharing one secret vs. sharing many secrets. 123-140 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00399-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Crescenzo03 2003-11-19 A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. 393-400 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#HromkovicI93 2003-11-19 On the power of Las Vegas II: Two-way finite automata. 1-24 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#HromkovicS01 http://dx.doi.org/10.1016/S0304-3975(00)00155-9 2003-11-19 On Commutativity and Approximation. 135-150 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Bini84 2003-11-19 Algebraic Optimization of Object-Oriented Query Languages. 59-94 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#BeeriK93 2003-11-19 Formal Systems for Join Dependencies. 99-116 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#BeeriV85 2003-11-19 Recent results and questions in combinatorial game complexities. 265-288 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Fraenkel00 http://dx.doi.org/10.1016/S0304-3975(00)00062-1 2003-11-19 Arrays, numeration systems and Frankenstein games. 271-284 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Fraenkel02 http://dx.doi.org/10.1016/S0304-3975(01)00070-6 2003-11-19 Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. 49-73 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Fraenkel84 2003-11-19 Learning Nested Differences in the Presence of Malicious Noise. 159-175 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Auer97 http://dx.doi.org/10.1016/S0304-3975(97)00019-4 2003-11-19 Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. 249-260 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#FachiniMRS91 2003-11-19 A Comparison between Algebraic Query Languages for Flat and Nested Databases. 263-286 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#GyssensG91 2006-03-13 Preface. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#DucasseKP99 2003-11-19 Papers from ARTS'97 - Preface. 1 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#BertranR01 http://dx.doi.org/10.1016/S0304-3975(00)00086-4 2003-11-19 Sur une conjecture d'Yves Métivier. 21-30 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Bertrand94 2003-11-19 Towards a Computation System Based on Set Theory. 297-340 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#Beeson88 2003-11-19 Independent domination in finitely defined classes of graphs. 271-284 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00586-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#BoliacL03 2003-11-19 About the p-Paperfolding Words. 35-51 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Koskas96 http://dx.doi.org/10.1016/0304-3975(95)00008-9 2003-11-19 On testing for zero polynomials by a set of points with bounded precision. 15-25 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00429-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#CaiB03 2003-11-19 Dedekind Multisets and Function Shells. 79-98 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Blizard93 2003-11-19 On Input Read-Modes of Alternating Turing Machines. 33-55 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#CaiC95 http://dx.doi.org/10.1016/0304-3975(94)00253-F 2003-11-19 Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. 189-228 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#CaiP95 http://dx.doi.org/10.1016/0304-3975(94)00183-J 2003-11-19 Resolution of Hartmanis' conjecture for NL-hard sparse sets. 257-269 2000 240 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs240.html#CaiS00 http://dx.doi.org/10.1016/S0304-3975(99)00234-0 2003-11-19 Probabilistic Estimation of the Number of Prefixes of a Trace. 249-268 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Goldwurm92 2003-11-19 Optimal Transmission Schedules for Lightwave Networks Embedded with De Bruijn Graphs. 113-131 1999 222 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs222.html#CaoB99 http://dx.doi.org/10.1016/S0304-3975(98)00105-4 2003-11-19 Checkpointing with mutable checkpoints. 1127-1148 2003 290 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CaoS03 2003-11-19 Some properties of the factors of Sturmian sequences. 365-385 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00213-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#CaoW03 2004-02-25 Isomorphism theorem for BSS recursively enumerable sets over real closed fields. 253-273 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#MichauxT00 http://dx.doi.org/10.1016/S0304-3975(99)00103-6 2003-11-19 Shortest Paths Without a Map. 127-150 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#PapadimitriouY91 2003-11-19 Lyndon words, permutations and trees. 173-178 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00099-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#HohlwegR03 2003-11-19 Uniform characterizations of polynomial-query learnabilities. 377-385 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#HayashiMST03 2004-03-16 Private computation using a PEZ dispenser. 69-84 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00210-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#BaloghCIK03 2003-11-19 On parsing LL-languages. 49-59 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#Blum01 http://dx.doi.org/10.1016/S0304-3975(00)00295-4 2003-11-19 More on the Power of Chain Rules in Context-Free Grammars. 287-295 1983 27 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#Blum83 2003-11-19 A Boolean Function Requiring 3n Network Size. 337-345 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Blum84 2003-11-19 An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. 59-69 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Blum85 2003-11-19 Complexity of Selection in X + Y. 105-120 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#CosnardDF89 2003-11-19 On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group. 233-248 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Schupp98 http://dx.doi.org/10.1016/S0304-3975(98)00041-3 2003-11-19 Most General First Order Theorems are not Recursively Enumerable. 149-163 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#Schurz95 http://dx.doi.org/10.1016/0304-3975(94)00229-C 2003-11-24 Langages rationnels définis avec une concaténation non-associative. 217-231 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#GermainP00 http://dx.doi.org/10.1016/S0304-3975(98)00043-7 2003-11-19 Recursively Defined Doains and their Induction Principles. 29-51 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#JensenL87 2003-11-19 <i>omega</i>-Order Type Theory Through Unification. 123-171 1976 3 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#JensenP76 2003-11-19 The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs. 399-424 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00650-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Stevens03 2003-11-19 Fine Covers of a VAS Language. 159-168 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Schwer92 2003-11-19 Some Applications of the McCreight-Meyer Algorithm in Abstract Complexity Theory. 79-98 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Boas78 2003-11-19 Parallel Comparison Merging of Many-Ordered Lists. 275-285 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Azar91 2003-11-19 Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. 239-270 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Gallier81a 2003-11-19 DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems. 155-186 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Gallier81b 2003-11-19 Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. 229 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Gallier82a 2003-11-19 Optimal Dynamic Embedding of X-Trees Into Arrays. 259-276 1988 59 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#HodelL88 2003-11-19 Transformations and Confluence for Rewrite Systems. 269-283 1995 152 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#Verma95 http://dx.doi.org/10.1016/0304-3975(94)00255-0 2003-11-19 Reductions in Tree Replacement Systems. 123-150 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#GallierB85 2003-11-19 Artin-Schreier Curves, Exponential Sums, and Coding Theory. 295-310 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Lachaud92 2003-11-19 Complete Sets of Transformations for General E-Unification. 203-260 1989 67 Theor. Comput. Sci. 2&3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#GallierS89 2003-11-19 A Hoare logic for dynamic networks of asynchronously communicating deterministic processes. 3-41 2002 274 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs274.html#Boer02 http://dx.doi.org/10.1016/S0304-3975(00)00304-2 2003-11-19 Hierarchies of One-Way Multihead Automata Languages. 153-181 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Chrobak86a 2003-11-19 Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. 81-98 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#ChrobakD01 http://dx.doi.org/10.1016/S0304-3975(99)00325-4 2003-11-19 _ⁿ. 45-59 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#Gollmann99 http://dx.doi.org/10.1016/S0304-3975(99)00065-1 2003-11-19 Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. 243-266 1991 86 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#ChrobakE91 2003-11-19 Harmonic is 3-Competitive for Two Servers. 339-346 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#ChrobakL92 2003-11-19 Translational Lemmas, Polynomial Time, and (log n)^j-Space. 215-226 1976 1 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Book76 2003-11-19 Celia Wrathall: On Languages Specified by Relative Acceptance. 185-195 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Book78 2003-11-19 Bounded Query Machines: On NP and PSPACE. 27-39 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Book81 2003-11-19 When is a Monoid a Group? The Church-Rosser Case is Tractable. 325-331 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Book82 2003-11-19 Decidable Sentences of Church-Rosser Congruences. 301-312 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Book83 2003-11-19 Two Results on Linear Embeddings of Complete Binary Trees. 507-526 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#ChrobakR94 2003-11-19 Detecting quantum entanglement. 313-335 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Terhal02 2003-11-19 Solving Word Equations modulo Partial Commutations. 215-235 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#DiekertMM99 http://dx.doi.org/10.1016/S0304-3975(98)00313-2 2003-11-19 The Meaning of Specifications I: Domains and Initial Models. 67-89 1995 152 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#Hodges95 http://dx.doi.org/10.1016/0304-3975(95)00245-3 2003-11-19 On the Limit Set of Some Universal Cellular Automata. 53-78 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#ChMM93 2003-11-19 The structure of a linear chip firing game and related models. 827-841 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#ChMP02 http://dx.doi.org/10.1016/S0304-3975(01)00119-0 2003-11-19 Optimal Strategies Against a Liar. 167-193 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#CicaleseV00 http://dx.doi.org/10.1016/S0304-3975(99)00044-4 2003-11-19 On the Vector Space of the Automatic Reals. 193-210 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#LehrST96 http://dx.doi.org/10.1016/0304-3975(95)00234-0 2003-11-19 Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable. 173-206 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Boussinot82 2003-11-19 Randomized path coloring on binary trees. 355-399 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#AulettaCKP02 2003-11-19 Adaptively secure distributed public-key systems. 535-561 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#FrankelMY02 2003-11-19 Shuffle languages are in P. 31-53 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#JedrzejowiczS01 http://dx.doi.org/10.1016/S0304-3975(99)00109-7 2003-11-19 Lower bounds for some decision problems over C. 425-434 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Malajovich02 http://dx.doi.org/10.1016/S0304-3975(01)00273-0 2003-11-19 On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis. 65-84 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Malajovich94 2003-11-19 Uniqueness of Scott's Reflexive Domain in P-omega. 267-276 1996 155 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#Drakengren96 http://dx.doi.org/10.1016/0304-3975(96)00102-8 2003-11-19 A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in P-omega. 181-195 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#Drakengren98 http://dx.doi.org/10.1016/S0304-3975(97)00038-8 2003-11-19 Generalizations of suffix arrays to multi-dimensional matrices. 401-416 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00861-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#KimKP03a 2003-11-19 Complexity Models for Incremental Computation. 203-236 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#MiltersenSVT94 2003-11-19 Methods for Message Routing in Parallel Machines. 31-62 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#Leighton94 2003-11-19 Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries. 287-309 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Chan94 2003-11-19 On principal types of combinators. 277-290 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#BrodaD00 http://dx.doi.org/10.1016/S0304-3975(99)00086-9 2003-11-19 Relation Algebraic Domain Constructions. 163-188 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Zierer91 2003-11-19 An Efficient Solution of the Firing Mob Problem. 57-69 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#CulikD91 2003-11-19 Sequence Recursiveness Without Cylindrification and Limited Register Machines. 213-221 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#GermanoM81 2005-05-13 Closure Functions and General Iterates as Reflectors. 215-252 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#GermanoM91 2003-11-19 Topological Transformations as a Tool in the Design of Systolic Networks. 183-216 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#CulikF85 2003-11-19 Dominoes Over a Free Monoid. 279-300 1982 18 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#CulikH82 2003-11-19 Efficient Algorithms for Acyclic Colorings of Graphs. 75-95 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#Chen00 http://dx.doi.org/10.1016/S0304-3975(97)00254-5 2003-11-19 A necessary condition for a graph to be the visibility graph of a simple polygon. 417-424 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Chen02 http://dx.doi.org/10.1016/S0304-3975(01)00208-0 2003-11-19 Optimizing stable in-place merging. 191-210 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00775-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Chen03 2003-11-19 The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. 265-278 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Chen90 2003-11-19 Context-Free Grammars, Differential Operators and Formal Power Series. 113-129 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Chen93 2003-11-19 The Communication Complexity of Computing Differentiable Functions in a Multicomputer Network. 373-383 1994 125 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#Chen94 2003-11-19 The Maximal f-Dependent Set Problem for Planar Graphs is in NC. 309-318 1995 143 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Chen95 http://dx.doi.org/10.1016/0304-3975(94)00112-V 2003-11-19 Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. 1-21 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#Chen96 http://dx.doi.org/10.1016/0304-3975(95)00110-7 2003-11-19 Algorithmic Graph Embeddings. 247-266 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Chen97 http://dx.doi.org/10.1016/S0304-3975(96)00273-3 2003-11-19 The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. 71-84 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#CulikK86 2003-11-19 Preface. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Wolfram00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 A Semantics for lambda-Prolog. 277-289 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Wolfram94 2003-11-19 Algebraic specification of reactive systems. 3-40 2000 239 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Broy00 http://dx.doi.org/10.1016/S0304-3975(99)00212-1 2003-11-19 Refinement of time. 3-26 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#Broy01 http://dx.doi.org/10.1016/S0304-3975(00)00087-6 2003-11-19 On the Herbrand-Kleene Universe for Nondeterministic Computations. 1-19 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Broy85 2003-11-19 A Theory for Nondeterminism, Parallelism, Communication, and Concurrency. 1-61 1986 45 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#Broy86 2003-11-19 Equational Specification of Partial Higher-Order Algebras. 3-45 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#Broy88 2003-11-19 On Infinite Words Obtained by Iterating Morphisms. 29-38 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#CulikS82 2003-11-19 Iterative Tree Automata. 227-247 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#CulikY84 2003-11-19 Real-Time, Pseudo Real-Time, and Linear-Time ITA. 15-26 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#CulikY86 2003-11-19 Pattern-matching algorithms based on term rewrite systems. 439-464 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#KatoenN00 http://dx.doi.org/10.1016/S0304-3975(00)00041-4 2005-02-16 Finite-Automaton Aperiodicity is PSPACE-Complete. 99-116 1991 88 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#ChoH91 2003-11-19 On the Planar Monotone Computation of Boolean Functions. 267-279 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#BeynonB87 2003-11-19 Triangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums. 259-288 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#ChoW98 http://dx.doi.org/10.1016/S0304-3975(97)86793-X 2003-11-19 On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping. 1-24 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Groote78 2003-11-19 Transition System Specifications with Negative Premises. 263-299 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Groote93 2003-11-19 An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets. 115-134 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Groote99 http://dx.doi.org/10.1016/S0304-3975(98)00309-0 2003-11-19 Programs in Partial Algebras. 131-149 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Jarzembski93 2003-11-19 Interaction-Free Multivalued Dependency Sets. 221-233 1988 62 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Gucht88 2003-11-19 Representations versus numberings: on the relationship of two computability notions. 473-499 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Spreen01 http://dx.doi.org/10.1016/S0304-3975(00)00319-4 2003-11-19 On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. 261-303 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#Spreen99 http://dx.doi.org/10.1016/S0304-3975(98)00144-3 2003-11-19 Fully Dynamic Secret Sharing Schemes. 407-440 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#BlundoCSV96 http://dx.doi.org/10.1016/0304-3975(96)00003-5 2003-11-19 Extending Horn Clause Logic with Implication Goals. 43-74 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#GiordanoMR92 2003-11-19 On model checking for the µ-calculus and its fragments. 491-522 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#EmersonJS01 http://dx.doi.org/10.1016/S0304-3975(00)00034-7 2003-11-19 Program schemes, arrays, Lindström quantifiers and zero-one laws. 283-310 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Stewart02 http://dx.doi.org/10.1016/S0304-3975(01)00183-9 2003-11-19 Methods for Proving Completeness via Logical Reductions. 193-229 1993 118 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Stewart93 2003-11-19 Complete Problems for Monotone NP. 147-157 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Stewart95 http://dx.doi.org/10.1016/0304-3975(94)00175-I 2003-11-19 Topological properties of omega context-free languages. 669-697 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Finkel01a http://dx.doi.org/10.1016/S0304-3975(00)00405-9 2003-11-19 Wadge hierarchy of omega context-free languages. 283-315 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Finkel01b http://dx.doi.org/10.1016/S0304-3975(01)00008-1 2003-11-19 Ambiguity in omega context free languages. 217-270 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00584-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Finkel03a 2003-11-19 On omega context free languages which are Borel sets of infinite rank. 327-346 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00327-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Finkel03b 2003-11-19 Verifying Identical Communicating Processes is Undecidable. 217-230 1997 174 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#FinkelM97 http://dx.doi.org/10.1016/S0304-3975(96)00026-6 2003-11-19 Well-structured transition systems everywhere! 63-92 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#FinkelS01 http://dx.doi.org/10.1016/S0304-3975(00)00102-X 2003-11-19 A Polynomial Algorithm for the Membership Problem with Categorial Grammars. 207-221 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#FinkelT96 http://dx.doi.org/10.1016/0304-3975(95)00211-1 2003-11-19 Formal Parametric Polymorphism. 9-58 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#AbadiCC93 2003-11-19 Analysis issues in Petri nets with inhibitor arcs. 127-177 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Busi02 http://dx.doi.org/10.1016/S0304-3975(01)00127-X 2003-11-19 Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. 323-337 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#AklCF92 2003-11-19 The finite graph problem for two-way alternating automata. 511-528 2003 3 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00866-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#Bojanczyk03 2003-11-19 A General Construction of Hyperuniverses. 203-215 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#FortiH96 http://dx.doi.org/10.1016/0304-3975(95)00087-9 2003-11-19 Theory of Representations. 35-53 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#KreitzW85 2003-11-19 Fully Abstract Composition Semantics for an Algebra of Logic Programs. 201-209 1995 149 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#BrogiT95 http://dx.doi.org/10.1016/0304-3975(95)00012-L 2003-11-19 Top-down decision tree learning as information based boosting. 447-464 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#TakimotoM03 2003-11-19 Predicting nearly as well as the best pruning of a planar decision graph. 217-235 2002 288 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#TakimotoW02 2006-03-14 Grouped partial ET0L systems and parallel multiple context-free grammars. 131-150 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#NishidaS00a http://dx.doi.org/10.1016/S0304-3975(99)00076-6 2003-11-19 Optimistic atomic broadcast: a pragmatic viewpoint. 79-101 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#PedoneS03 2003-11-19 Data Compression with Factor Automata. 213-221 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Zipstein92 2003-11-19 Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions. 395-408 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Streicher92 2003-11-19 Denotational Completeness Revisited. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Streicher99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 A Lambda-Calculus for Dynamic Binding. 201-231 1998 192 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs192.html#Dami98 http://dx.doi.org/10.1016/S0304-3975(97)00150-3 2003-11-19 The IO- and OI-Hierarchies. 95-207 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#Damm82 2003-11-19 On Finding Commong Subtrees. 345-356 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Grossi93 2003-11-19 Pushdown timed automata: a binary reachability characterization and safety verification. 93-121 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00743-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Dang03 2003-11-19 A Categorical Treatment of Pre- and Post-Conditions. 3-24 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Wagner87a 2003-11-19 An Algebraically Specified Language for Data Directed Design. 195-219 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Wagner90a 2003-11-19 Minimum Vertex Hulls for Polyhedral Domains. 107-135 1992 103 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#DasJ92 2003-11-19 Canonical Constraints for Parameterized Data Types. 323-349 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#WagnerE87 2003-11-19 Streams and strings in formal proofs. 45-83 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#Carbone02 2003-11-19 Semantics of Types for Database Objects. 53-91 1990 76 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Ohori90 2003-11-19 PAC-Learning from General Examples. 43-65 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#FischerHL97 http://dx.doi.org/10.1016/S0304-3975(95)00236-7 2003-11-19 Complexity of Graph Embeddability Problems. 321-328 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#BenzakenF81 2003-11-19 Succinctness in Dependency Systems. 323-329 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#FischerJT83 2003-11-19 On LC(0) Grammars and Languages. 65-85 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Akker89 2003-11-19 Generalized scans and tridiagonal systems. 423-436 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#FischerPS01 http://dx.doi.org/10.1016/S0304-3975(99)00311-4 2003-11-19 Foreword. 1-2 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#FischerSS02 http://dx.doi.org/10.1016/S0304-3975(01)00058-5 2003-11-19 Randomized Algorithms for Metrical Task Systems. 163-182 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#IraniS98 http://dx.doi.org/10.1016/S0304-3975(97)00006-6 2003-11-19 Generalization from Partial Parametrization in Higher-Order Type Theory. 113-139 1989 63 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Hagiya89 2003-11-19 A Typed lambda-Calculus for Proving-by-Example and Bottom-Up Generalization Procedure. 3-23 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Hagiya95 http://dx.doi.org/10.1016/0304-3975(94)00159-G 2003-11-19 Joining Specification Statements. 375-394 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#LeinoM99 http://dx.doi.org/10.1016/S0304-3975(98)00165-0 2003-11-19 Selection and Sorting with Limited Storage. 315-323 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#MunroP80 2003-11-19 Selection from Read-Only Memory and Sorting with Minimum Data Movement. 311-323 1996 165 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#MunroR96 http://dx.doi.org/10.1016/0304-3975(95)00225-1 2003-11-19 Fixpoint semantics for logic programming a survey. 25-51 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Fitting02 http://dx.doi.org/10.1016/S0304-3975(00)00330-3 2003-11-19 Partial Models and Logic Programming. 229-255 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Fitting86 2003-11-19 Partitioning Point Sets in Arbitrary Dimension. 239-265 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Cole87 2003-11-19 Some Questions about Expressiveness and Relative Completeness in Hoare's Logic. 189-206 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Rodriguez-Artalejo85 2003-11-19 ^4.03). 117-144 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00436-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Koucky03 2003-11-19 Active Oberon for .NET: An Exercise in Object Model Mapping. 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#Gutknecht01 2003-11-19 A Complete, Nonredundant Algorithm for Reversed Skolemization. 239-261 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#CoxP84 2003-11-19 Threshold data structures and coding theory. 3-23 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#BachK00 http://dx.doi.org/10.1016/S0304-3975(99)00180-2 2003-11-19 On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes. 47-68 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#BackM85 2003-11-19 Combining Angles, Demons and Miracles in Program Specifications. 365-383 1992 100 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#BackW92 2003-11-19 Testing Equivalences for Processes. 83-133 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#NicolaH84 2003-11-19 Nondeterministic regular expressions as solutions of equational systems. 179-189 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00774-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#NicolaL03 2003-11-19 <i>k</i>-Partition Problem of Graphs Without Specifying Bases. 233-248 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#WadaTK98 http://dx.doi.org/10.1016/S0304-3975(97)00225-9 2003-11-19 Linda-based applicative and imperative process algebras. 389-437 2000 238 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#NicolaP00 http://dx.doi.org/10.1016/S0304-3975(99)00339-4 2003-11-19 A Process Algebraic View of Input/Output Automata. 391-423 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#NicolaS95 http://dx.doi.org/10.1016/0304-3975(95)92307-J 2003-11-19 Andrei P. Ershov 1931-1988. 1-4 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#KotovP89 2003-11-19 Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. 59-86 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00051-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#LouchardP03 2003-11-19 Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order. 183-204 2000 235 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Trahtman00a http://dx.doi.org/10.1016/S0304-3975(99)00191-7 2003-11-19 Generalized covariances of multi-dimensional Brownian excursion local times. 317-336 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00645-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#LouchardT03 2003-11-19 A causal semantics for CCS via rewriting logic. 259-282 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#DeganoGP02 http://dx.doi.org/10.1016/S0304-3975(01)00165-7 2003-11-19 On Equations for Regular Languages, Finite Automata, and Sequential Networks. 19-35 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#BrzozowskiL80 2003-11-19 Automata of Asynchronous Behaviors. 113-128 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#BrzozowskiN00 http://dx.doi.org/10.1016/S0304-3975(99)00021-3 2003-11-19 A Partial Ordering Semantics for CCS. 223-262 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#DeganoNM90 2003-11-19 Universal Axioms for Bisimulations. 63-91 1993 114 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#DeganoNM93 2003-11-19 Optimal Evaluations of Graph-Like Expressions. 297-316 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Staples80a 2003-11-19 Speeding up Subtree Replacement Systems. 39-47 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Staples80b 2003-11-19 Combinatorics of geometrically distributed random variables: run statistics. 261-270 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00641-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#GrabnerKP03 2003-11-19 Computing the Behaviour of Asynchronous Processes. 343-353 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#StaplesN83 2003-11-19 Semantic constructions for the specification of objects. 3-25 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Cirstea01 http://dx.doi.org/10.1016/S0304-3975(00)00120-1 2003-11-19 A coalgebraic equational approach to specifying observational structures. 35-68 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#Cirstea02 http://dx.doi.org/10.1016/S0304-3975(01)00020-2 2003-11-19 A Pragmatic Type Concept for Prolog Supporting Polymorphism, Subtyping, and Meta-Programming. 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#BeierleKM99 2003-11-19 Trees in Algebra and Programming (Editorial). 1 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#Dauchet00 http://dx.doi.org/10.1016/S0304-3975(99)00204-2 2003-11-19 Simulation of Turing Machines by a Regular Rewrite Rule. 409-420 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Dauchet92 2003-11-19 Covarieties and complete covarieties. 71-86 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#GummS01 http://dx.doi.org/10.1016/S0304-3975(00)00123-7 2003-11-19 Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. 269-289 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00284-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#BienvenueF03 2003-11-19 Parallel Interval Order Recognition and Construction of Interval Representations. 73-91 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#BenderGM95 http://dx.doi.org/10.1016/0304-3975(95)80025-5 2003-11-19 Disjunctive Decomposition of Languages. 47-51 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#GuoXT86 2003-11-19 Decompositions for the edge colouring of reduced indifference graphs. 145-155 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00636-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#FigueiredoMMO03 2003-11-19 Connections in Acyclic Hypergraphs. 185-199 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#MaierU84 2003-11-19 Palindromes and Sturmian Words. 73-85 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#DroubayP99 http://dx.doi.org/10.1016/S0304-3975(97)00188-6 2003-11-19 Words and forbidden factors. 99-117 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#MignosiRS02 http://dx.doi.org/10.1016/S0304-3975(00)00436-9 2003-11-19 On Fine and Wilf's theorem for bidimensional words. 245-262 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#MignosiRS03 2003-11-19 Periodicity and the Golden Ratio. 153-167 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#MignosiRS98 http://dx.doi.org/10.1016/S0304-3975(98)00037-1 2003-11-19 Robust algorithms for constructing strongly convex hulls in parallel. 277-295 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#ChenWK02 2003-11-19 Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. 215-227 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#ChenWL93 2003-11-19 On Generalized Language Equations. 63-77 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Leiss81a 2003-11-19 Succinct Representation of Regular Languages by Boolean Automata II. 133-136 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Leiss85a 2003-11-19 On Solving Star Equations. 327-332 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Leiss85b 2003-11-19 Extraction and Verification of Programs by Analysis of Formal Proofs. 225-258 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Alexi88 2003-11-19 Unrestricted Complementation in Language Equations Over a One-Letter Alphabet. 71-84 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Leiss94a 2003-11-19 Designing Equivalent Semantic Models for Process Creation. 109-176 1988 60 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs60.html#AmericaB88 2003-11-19 Embeddings of Binary Trees in Lines. 319-331 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Diks85 2003-11-19 Differential-Algebraic Decision Methods and some Applications to System Theory. 137-161 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Diop92 2003-11-19 Conditioned Rewriting Logic as a United Model of Concurrency. 73-155 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Meseguer92 2003-11-19 Attributed Variables in XSB. 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#CuiW99 2003-11-19 Infinite Words with Linear Subword Complexity. 221-242 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Mignosi89 2003-11-19 On the Number of Factors of Sturmian Words. 71-84 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Mignosi91 2003-11-19 Canonical Positions for the Factors in Paperfolding Sequences. 263-278 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#AlloucheB94 2003-11-19 An improvement on a spernerity proof of Horrocks. 355-377 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#ChengL01 http://dx.doi.org/10.1016/S0304-3975(00)00255-3 2003-11-19 Open Maps, Behavioural Equivalences, and Congruences. 87-112 1998 190 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#ChengN98 http://dx.doi.org/10.1016/S0304-3975(97)00085-6 2003-11-19 On beta-skeleton as a subgraph of the minimum weight triangulation. 459-471 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#ChengX01 http://dx.doi.org/10.1016/S0304-3975(00)00318-2 2003-11-19 The ring of k-regular sequences, II. 3-29 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00090-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#AlloucheS03 2003-11-19 The Ring of k-Regular Sequences. 163-197 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#AlloucheS92 2003-11-19 Constructive metrisability in point-free topology. 85-109 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00699-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Curi03 2003-11-19 Scalable Threshold Closure. 185-206 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#ZhangLJ99 http://dx.doi.org/10.1016/S0304-3975(99)00072-9 2003-11-19 Formal Verification of a Programming Logic for a Distributed Programming Language. 213-235 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#ZhangOL99 http://dx.doi.org/10.1016/S0304-3975(97)00234-X 2003-11-19 Trees and Semantics. 217-250 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#Baier97 http://dx.doi.org/10.1016/S0304-3975(96)00107-7 2003-11-19 Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words. 83-94 1999 218 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#CastelliMR99 http://dx.doi.org/10.1016/S0304-3975(98)00251-5 2003-11-19 Completion of codes with finite bi-decoding delays. 123-137 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00243-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#ZhangSP03 2003-11-19 Lagois Connections - a Counterpart to Galois Connections. 79-107 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#MeltonSS94 2003-11-19 Order-Sorted Model Theory for Temporal Executable Specifications. 273-299 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#AlagicA97 http://dx.doi.org/10.1016/S0304-3975(96)00134-X 2003-11-19 Geometric Optimization and the Polynomial Hierarchy. 87-102 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Bajaj87 2003-11-19 The Parallel Numerical Method of Mechanical Theorem Proving. 253-271 1990 74 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#ZhangYD90 2003-11-19 Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic. 253-281 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#GirodiasCO97 http://dx.doi.org/10.1016/S0304-3975(96)00198-3 2003-11-19 Tail call elimination on the Java Virtual Machine. 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#SchinzO01 2003-11-19 Abstraction Problems in Combinatory Logic a Compositive Approach. 27-43 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Piperno89 2003-11-19 Applications of an Infinite Square-Free CO-CFL. 113-119 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#MainBH87 2003-11-19 An Algebraic View of the Böhm-Out Technique. 233-246 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#Piperno99 http://dx.doi.org/10.1016/S0304-3975(98)00142-X 2003-11-19 A Few Logs Suffice to Build (almost) All Trees: Part II. 77-118 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#ErdosSSW99 http://dx.doi.org/10.1016/S0304-3975(99)00028-6 2003-11-19 The complexity of the characterization of networks supporting shortest-path interval routing. 85-104 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#EilamMZ02 2003-11-19 Palindrome complexity. 9-31 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#AlloucheBCD03 2003-11-19 On a Relationship between Graph L-Systems and Picture Languages. 161-177 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#NakamuraA83 2003-11-19 Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries. 159-176 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#NakamuraA95 http://dx.doi.org/10.1016/0304-3975(94)00166-G 2003-11-19 Pictures of Functions and Their Acceptability by Automata. 37-48 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#NakamuraO83 2003-11-19 A Hierarchy Based on Output Multiplicity. 131-157 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#NaikRRS98 http://dx.doi.org/10.1016/S0304-3975(98)00060-7 2003-11-19 Accidental combinatorist, an autobiography. 457-472 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00231-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Harper03a 2003-11-19 Complete Restrictions of the Intersection Type Discipline. 135-163 1992 102 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Bakel92 2003-11-19 Intersection Type Assignment Systems. 385-435 1995 151 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Bakel95 http://dx.doi.org/10.1016/0304-3975(95)00073-6 2003-11-19 Type Checking with Universes. 107-136 1991 89 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#HarperP91 2003-11-19 On the Information Rate of Secret Sharing Schemes. 283-306 1996 154 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#BlundoSGV96 http://dx.doi.org/10.1016/0304-3975(95)00065-8 2003-11-19 On maximizing the throughput of multiprocessor tasks. 319-335 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(02)00850-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#FishkinZ03 2003-11-19 An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. 183-203 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#PeledWW98 http://dx.doi.org/10.1016/S0304-3975(97)00219-3 2003-11-19 Some Lowness Properties and Computational Complexity Sequences. 233-254 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#BennisonS78 2003-11-19 On the Disjunctive Set Problem. 99-118 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#GoralcikK98 http://dx.doi.org/10.1016/S0304-3975(98)00034-6 2003-11-19 <i>k</i>-Opt Approximate Alignments for Large Cases. 341-374 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#IkedaI99 http://dx.doi.org/10.1016/S0304-3975(98)00093-0 2003-11-19 The Covering Problem for Linear Context-Free Grammars. 361-382 1976 2 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#HuntRS76 2003-11-19 A Formalization of Reasoning not Derived from Standard Predicate Logic. 291-317 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Tseytin99 http://dx.doi.org/10.1016/S0304-3975(98)00316-8 2005-07-25 Decision procedures for inductive Boolean functions based on alternating automata. 301-329 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00089-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#AyariBK03 2003-11-19 Density via duality. 585-591 2002 287 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#NesetrilT02 2003-11-19 MAX3SAT is exponentially hard to approximate if NP has positive dimension. 861-869 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Hitchcock02 2003-11-19 Fractal dimension and logarithmic loss unpredictability. 431-441 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00138-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Hitchcock03 2003-11-19 A Relation Between Space, Return and Dual Return Complexities. 127-140 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#WechsungB79 2003-11-19 Continuations in Possible-World Semantics. 283-303 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#TennentT91 2003-11-19 A Generalization of Automatic Sequences. 1-16 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Shallit88 2003-11-19 A Systematic Study of Models of Abstract Data Types. 139-174 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#BroyWP84 2003-11-19 A Proof-Planning Framework with Explicit Abstractions Based on Indexed Formulas. 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#Autexier01 2003-11-19 Foreword. 877 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#DuEL02 2003-11-19 Calculs sur les structures de langage dénombrable. 205-222 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Bourgade02 http://dx.doi.org/10.1016/S0304-3975(00)00364-9 2003-11-19 On Neciporuk's Theorem for Branching Programs. 331-342 1989 64 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#AlonZ89 2003-11-19 An Efficient Parallel Algorithm for Updating Minimum Spanning Trees. 379-397 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#VarmanD88 2003-11-19 Infinite Hypergraphs I. Basic Properties. 177-214 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Bauderon91 2003-11-19 Infinite Hypergraphs II: Systems of Recursive Equations. 165-190 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#Bauderon92 2003-11-19 Minimizing Mean Flow Time with Release Time Constraint. 347-355 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#DuLY90 2003-11-19 An Answer to an Open Problem of Urquhart. 201-209 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Egly98 http://dx.doi.org/10.1016/S0304-3975(97)00140-0 2003-11-19 Programming in Metric Temporal Logic. 55-125 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#Brzoska98 http://dx.doi.org/10.1016/S0304-3975(97)00139-4 2003-11-19 Parsing as abstract interpretation of grammar semantics. 531-544 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#CousotC03 2003-11-19 "A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs. 123-155 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#CousotC93 2003-11-19 Deforestation: Transforming Programs to Eliminate Trees. 231-248 1990 73 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Wadler90 2003-11-19 Mellin Transforms and Asymptotics: Harmonic Sums. 3-58 1995 144 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#FlajoletGD95 http://dx.doi.org/10.1016/0304-3975(95)00002-E 2003-11-19 Approximations for Subset Interconnection Designs. 171-180 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#DuWK98 http://dx.doi.org/10.1016/S0304-3975(98)00062-0 2003-11-19 Computational complexity of some problems involving congruences on algebras. 591-608 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#BergmanS02 http://dx.doi.org/10.1016/S0304-3975(01)00009-3 2003-11-19 A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. 471-498 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Okada02 http://dx.doi.org/10.1016/S0304-3975(02)00024-5 2003-11-19 Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. 333-396 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Okada99 http://dx.doi.org/10.1016/S0304-3975(99)00058-4 2003-11-19 On Recognizing Graph Properties from Adjacency Matrices. 371-384 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#RivestV76 2003-11-19 The Number of Registers Required for Evaluating Arithmetic Expressions. 99-125 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#FlajoletRV79 2003-11-19 Automatic Average-Case Analysis of Algorithm. 37-109 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#FlajoletSZ91 2003-11-19 Fast Evaluation of Holonomic Functions. 199-215 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#Hoeven99 http://dx.doi.org/10.1016/S0304-3975(98)00102-9 2003-11-19 Bi-Immunity Results for Cheatable Sets. 249-263 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Beigel90 2003-11-19 Bounded Queries to SAT and the Boolean Hierarchy. 199-223 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#Beigel91 2003-11-19 A Calculus for the Random Generation of Labelled Combinatorial Structures. 1-35 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#FlajoletZC94 2003-11-19 Interpretations of Recursively Defined Types. 119-134 1992 106 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Schwartzbach92 2003-11-19 Static Correctness of Hierarchical Procedures. 177-201 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Schwartzbach96 http://dx.doi.org/10.1016/0304-3975(95)00086-0 2003-11-19 CPO'S of Measures for Nondeterminism. 19-37 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Saheb-Djahromi80 2003-11-19 Orders, Reduction Graphs and Spectra. 211-231 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#IntrigilaZ99 http://dx.doi.org/10.1016/S0304-3975(98)00141-8 2003-11-19 Edge coloring of bipartite graphs with constraints. 361-399 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#CaragiannisKP02 http://dx.doi.org/10.1016/S0304-3975(00)00400-X 2003-11-19 On the Relations between Stable and Well-Founded Semantics of Logic Programs. 7-25 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#Dung92 2003-11-19 Type 2 Recursion Theory. 17-33 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Weihrauch85 2003-11-19 Computability on Computable Metric Spaces. 191-210 1993 113 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Weihrauch93 2003-11-19 Computability on the Probability Measureson the Borel Sets of the Unit Interval. 421-437 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Weihrauch99 http://dx.doi.org/10.1016/S0304-3975(98)00298-9 2003-11-19 The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata. 345-360 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Barua92 2003-11-19 Rational Indexes of Generators of the Cone of Context-Free Languages. 279-305 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Pierre92 2003-11-19 Adequacy-Preserving Transformations of COSY Path Programs. 141-158 1992 94 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Koutny92 2003-11-19 Cut-elimination for a logic with definitions and induction. 91-119 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#McDowellM00 http://dx.doi.org/10.1016/S0304-3975(99)00171-1 2003-11-19 A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem. 183-238 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#Mazoyer87 2003-11-19 On Optimal Solutions to the Firing Squad Synchronization Problem. 367-404 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#Mazoyer96 http://dx.doi.org/10.1016/S0304-3975(96)00084-9 2003-11-19 Improved Lower Bounds for the Cycle Detection Problem. 231-237 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#AllenderK85 2003-11-19 Downward Translations of Equality. 335-346 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#AllenderW90 2003-11-19 Fast Parallel and Serial Multidimensional Aproximate Array Matching. 97-115 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#AmirL91 2003-11-19 Partitioning a Graph in O(|A| log2 |V|). 85-98 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#CardonC82 2003-11-19 n-Level Rewriting Systems. 85-99 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Bauer85 2003-11-19 Almost complete sets. 177-194 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00262-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Ambos-SpiesMRT03 2003-11-19 Image reducing words and subgroups of free groups. 77-92 2003 307 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(03)00093-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#AnanichevCV03 2003-11-19 Modifying Edges of a Network to Obtain Short Subgraphs. 91-121 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#DrangmeisterKMNR98 http://dx.doi.org/10.1016/S0304-3975(97)00290-9 2003-11-19 A coinductive completeness proof for the equivalence of recursive types. 575-587 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#Cardone02 http://dx.doi.org/10.1016/S0304-3975(01)00298-5 2003-11-19 Recursive Types for Fun. 29-56 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Cardone91 2003-11-19 The Go polynomials of a graph. 1-18 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00831-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Farr03 2003-11-19 Scoped Dynamic Rewrite Rules. 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#Visser01a 2003-11-19 The 3-server problem in the plane. 335-354 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BeinCL02 2003-11-19 On the cost of recomputing: Tight bounds on pebbling with faults. 247-261 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#AumannBF00 http://dx.doi.org/10.1016/S0304-3975(98)00085-1 2003-11-19 An introduction to metric semantics: operational and denotational models for programming and specification languages. 1-98 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#Breugel01 http://dx.doi.org/10.1016/S0304-3975(00)00403-5 2003-11-19 Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes. 223-230 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#Breugel98 http://dx.doi.org/10.1016/S0304-3975(97)00251-X 2003-11-19 Block Edit Models for Approximate String Matching. 159-179 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#LoprestiT97 http://dx.doi.org/10.1016/S0304-3975(96)00268-X 2003-11-19 A Theory of Timed Automata. 183-235 1994 126 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#AlurD94 2003-11-19 Projections of Vector Addition System Reachability Sets are Semilinear. 343-350 1989 64 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#BuningLM89 2003-11-19 The Complexity of Partial Derivatives. 317-330 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#BaurS83 2003-11-19 Lower Bounds for On-Line Graph Coloring. 163-174 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#HalldorssonS94 2003-11-19 Communication Aspects of Networks Based on Geometric Incidence Relations. 83-96 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#ShamirS89 2003-11-19 Meta-Resolution: An Algorithmic Formalisation. 147-172 1996 166 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs166.html#FouksS96 http://dx.doi.org/10.1016/0304-3975(95)00155-7 2003-11-19 Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. 129-144 1995 137 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs137.html#Shinohara95 http://dx.doi.org/10.1016/0304-3975(94)00164-E 2003-11-19 Corrigendum: Towards a Theory of Local and Global in Computation. 343 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Abelson78a 2003-11-19 On the Relations between Distributive Computability and the BSS Model. 5-21 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Vigna96 http://dx.doi.org/10.1016/0304-3975(95)00247-2 2003-11-19 Data Refinement of Predicate Transformers. 143-162 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#GardinerM91 2003-11-19 A Compositional Axiomatization of Statecharts. 289-335 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#HoomanRR92 2003-11-19 The drawability problem for minimum weight triangulations. 261-286 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#LenhartL02 http://dx.doi.org/10.1016/S0304-3975(00)00383-2 2003-11-19 Shortest Curves in Planar Regions with Curved Boundary. 215-253 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#BourginH93 2003-11-19 A Homomorphic Characterization of Recursively Enumerable Languages. 261-269 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#HiroseOY85 2003-11-19 Expressive Power of Typed and Type-Free Programming Languages. 195-238 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Fehr84 2003-11-19 Using Fast Matrix Multiplication to Find Basic Solutions. 307-316 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#BelingM98 http://dx.doi.org/10.1016/S0304-3975(98)00003-6 2003-11-19 A Fundamental Effect in Computations on Real Numbers. 321-324 1977 5 3 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Luckhardt77 2003-11-19 New Formally Undecidable Propositions: Non-Trivial Lower Bounds on Proof Complexity and Related Theorems. 169-188 1991 83 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#Luckhardt91 2003-11-19 Remarks on the Complexity of Nondeterministic Counter Languages. 269-288 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Greibach76 2003-11-19 One Way Finite Visit Automata. 175-221 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#Greibach78 2003-11-19 Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks. 61-90 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#HofriK94 2003-11-19 _N. 37-43 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#Feng99 http://dx.doi.org/10.1016/S0304-3975(99)00064-X 2003-11-19 Operational and abstract semantics of the query language G-Log. 521-560 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#CortesiDQT02 http://dx.doi.org/10.1016/S0304-3975(01)00295-X 2003-11-19 Hilbert Q-Modules and Nuclear Ideals in the Category of v-Semilattices with a Duality. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Paseka99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Closedness properties in ex-identification. 367-393 2001 268 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#ApsitisFSS01 http://dx.doi.org/10.1016/S0304-3975(00)00276-0 2003-11-19 Finding approximate repetitions under Hamming distance. 135-156 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00448-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#KolpakovK03 2003-11-19 On the Interpolation of D0L-Sequences. 107-108 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Prodinger80 2003-11-19 Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet. 243-251 1992 100 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Prodinger92 2003-11-19 On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees. 181-194 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Prodinger97 http://dx.doi.org/10.1016/S0304-3975(96)00269-1 2003-11-19 A proof of the Krohn-Rhodes Decomposition Theorem. 287-300 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#Esik00 http://dx.doi.org/10.1016/S0304-3975(99)00315-1 2003-11-19 Axiomatizing the subsumption and subword preorders on finite and infinite partial words. 225-248 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#Esik02 http://dx.doi.org/10.1016/S0304-3975(00)00442-4 2003-11-19 Results on Homomorphic Realization of Automata by alpha_0-Products. 229-249 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Esik91 2003-11-19 Completeness of Park Induction. 217-283 1997 177 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Esik97 http://dx.doi.org/10.1016/S0304-3975(96)00240-X 2003-11-19 An Algebraic Approach to Hybrid Systems. 101-112 1995 138 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#GrossmanL95 http://dx.doi.org/10.1016/0304-3975(94)00146-A 2003-11-19 An Inherently Iterative Computation of Ackermanns's Function. 327-330 1988 57 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs57.html#GrossmanZ88 2003-11-19 Planar quorums. 243-268 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Bazzi00 http://dx.doi.org/10.1016/S0304-3975(98)00208-4 2003-11-19 Subset construction complexity for homogeneous automata, position automata and ZPC-structures. 17-34 2001 267 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#Champarnaud01 http://dx.doi.org/10.1016/S0304-3975(00)00293-0 2003-11-19 Efficient Delay Routing. 131-151 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#Ianni98 http://dx.doi.org/10.1016/S0304-3975(97)00198-9 2003-11-19 Submodule Construction as Equation Solving in CCS. 175-202 1989 68 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Parrow89 2003-11-19 Formal logics of discovery and hypothesis formation by machine. 345-357 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#HajekH03 2005-11-30 Algebraic aspects of emission tomography with absorption. 2169-2181 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#HajduT03 2003-11-19 On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets. 185-199 1992 93 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#HiraishiI92 2003-11-19 Classical and Incremental Attribute Evaluation by Means of Recursive Procedures. 25-65 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#File87 2004-04-20 Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. 185-206 1996 164 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs164.html#Fill96 http://dx.doi.org/10.1016/0304-3975(95)00210-3 2003-11-19 A new lower bound for the bipartite crossing number with applications. 281-294 2000 245 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#ShahrokhiSSV00 http://dx.doi.org/10.1016/S0304-3975(99)00285-6 2003-11-19 The Implementation Technology of the Mercury Debugger. 1999 http://www.elsevier.nl/locate/entcs/volume30.html 30 Electr. Notes Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#SomogyiH99 2003-11-19 A priori optimization for the probabilistic maximum independent set problem. 561-590 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#MuratP02 http://dx.doi.org/10.1016/S0304-3975(01)00005-6 2003-11-19 Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. 271-293 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#VinkR99 http://dx.doi.org/10.1016/S0304-3975(99)00035-3 2003-11-19 The Inclusion Problem for some Classes of Deterministic Multitape Automata. 1-24 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Kinber83 2003-11-19 On Complete Sets of Samples for Generalized Regular Expressions. 101-117 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#Kinber91 2003-11-19 Pushout-Complements and Basic Concepts of Grammars in Toposes. 267-289 1990 77 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Kawahara90 2003-11-19 Maximal Serializability of Iterated Transactions. 1-16 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#FleR85 2003-11-19 Secondary Attribute Retrieval Using Tree Data Structures. 107-116 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Madhavan84 2003-11-19 Coherent Banach Spaces: A Continuous Denotational Semantics. 275-297 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#Girard99a http://dx.doi.org/10.1016/S0304-3975(99)00056-0 2003-11-19 On the Relation between Descriptional Complexity and Algorithmic Probability. 71-93 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Gacs83 2003-11-19 Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. 3-16 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#ArquesFGG88 2003-11-19 List of R. V. Books's Publications. 5-11 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Anonymous98a 2003-11-19 A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons. 345-350 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Johnson86 2003-11-19 A Unified Framework for Disambiguating Finite Transductions. 91-111 1989 63 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Johnson89 2003-11-19 Using Powerdomains to Generalize Relational Databases. 23-55 1991 91 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs91.html#BunemanJO91 2004-02-20 The stable marriage problem with restricted pairs. 391-405 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00319-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#DiasFFS03 2006-06-29 Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks. 171-182 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#GaoH97 http://dx.doi.org/10.1016/S0304-3975(96)00151-X 2003-11-19 Iterative Bayes. 417-430 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Gama03 2003-11-19 Characterising FS domains by means of power domains. 195-203 2001 264 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Heckmann01 http://dx.doi.org/10.1016/S0304-3975(00)00222-X 2003-11-19 Contractivity of linear fractional transformations. 65-82 2002 279 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#Heckmann02 http://dx.doi.org/10.1016/S0304-3975(00)00427-8 2003-11-19 A non-topological view of dcpos as convergence spaces. 159-186 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00706-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Heckmann03 2003-11-19 Power Domains and Second-Order Predicates. 59-88 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#Heckmann93 2003-11-19 Stable Power Domains. 21-56 1994 136 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Heckmann94 2003-11-19 Quantifiers and Approximation. 145-163 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#PanconesiR93 2003-11-19 Daisies, Kayles, and the Silbert-Conway Decomposition in Misère Octal Games. 361-388 1992 96 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#Plambeck92 2003-11-19 Derivation of Efficient Programs for Computing Sequences of Actions. 151-167 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Pettorossi87 2003-11-19 Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem. 1-17 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Gato81 2003-11-19 Codes Engendrant Certains Systemes Sofiques. 253-265 1989 68 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Blanchard89a 2003-11-19 Quelques procédés engendrant des suites infinies. 55-60 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#BlanchardF94 2003-11-19 Some Results on the Deductive Structure of Join Dependencies. 95-105 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Dybjer84 2003-11-19 Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory. 329-335 1997 176 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs176.html#Dybjer97 http://dx.doi.org/10.1016/S0304-3975(96)00145-4 2004-02-03 Global exponential convergence of recurrent neural networks with variable delays. 281-293 2004 312 Theor. Comput. Sci. 2-3 http://dx.doi.org/10.1016/j.tcs.2003.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Yi04 2003-11-19 Systèmes Codés. 17-49 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#BlanchardH86 2003-11-19 Language Complexity of Rotations and Sturmian Sequences. 179-193 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#BlanchardK98 http://dx.doi.org/10.1016/S0304-3975(97)00105-9 2003-11-19 Points d'Orbite Dense de Certains Langages de Mots Infinis. 107-110 1986 44 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs44.html#BlanchardM86 2003-11-19 Dynamical Behaviour of Coven's Aperiodic Cellular Automata. 291-302 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#BlanchardM96 http://dx.doi.org/10.1016/0304-3975(96)00018-7 2003-11-19 On the Covering Problem for Left-Recursive Grammars. 1-11 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Soisalon-Soininen79 2003-11-19 A Linear-Time Recognition Algorithm for P4-Reducible Graphs. 329-344 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#JamisonO95 http://dx.doi.org/10.1016/0304-3975(95)00016-P 2003-11-19 A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. 105-122 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#SchuurmanW00 http://dx.doi.org/10.1016/S0304-3975(98)00157-1 2005-09-07 A constructive theory of point-set nearness. 473-489 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00711-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#VitaB03 2003-11-19 On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree. 149-152 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#Dekking89 2003-11-19 Principal Type Schemes for an Extended Type Theory. 151-169 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#RoccaV84 2003-11-19 On end extensions of models of subsystems of peano arithmetic. 79-84 2001 257 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs257.html#Dimitracopoulos01 http://dx.doi.org/10.1016/S0304-3975(00)00110-9 2003-11-19 A Completeness Result for Allowed Semi-Strict Programs with Respect to Well-Behaved and Allowed Query Clauses. 143-156 1992 97 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Baratella92 2003-11-19 A Class of Programs for which SLDNF Resolution and NAF Rule are Complete. 83-99 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#Baratella93 2003-11-19 A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes. 441-448 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#HuynhT94a 2003-11-19 Satisfying subtype inequalities in polynomial space. 105-117 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#Frey02 http://dx.doi.org/10.1016/S0304-3975(00)00314-5 2003-11-19 Systemes de Numeration et Fonctions Fractales Relatifs aux Substitutions. 153-169 1989 65 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#DumontT89 2003-11-19 The hardness of placing street names in a Manhattan type map. 89-99 2002 285 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs285.html#SeibertU02 http://dx.doi.org/10.1016/S0304-3975(01)00292-4 2003-11-19 Arithmetical complexity of symmetric D0L words. 535-542 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00345-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#Frid03 2003-11-19 On the equivalence of the static and disjunctive well-founded semantics and its computation. 523-553 2001 258 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#BrassDNP01 http://dx.doi.org/10.1016/S0304-3975(00)00045-1 2003-11-19 Speedup and Efficiency of Large-Size Applications on Heterogeneous Networks. 31-44 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#ColombetD98 http://dx.doi.org/10.1016/S0304-3975(97)00194-1 2003-11-19 Tau laws for pi calculus. 55-130 2003 308 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00202-0 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#FuY03a 2003-11-19 On Syntactic Congruences for Omega-Languages. 93-112 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#MalerS97 http://dx.doi.org/10.1016/S0304-3975(96)00312-X 2003-11-19 Automates a File. 221-225 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#VauquelinF80 2003-11-19 A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes. 67-83 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#Murakami90 2003-11-19 On the Size of Unambiguous Context-Free Grammars. 107-110 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Wyrostek86 2003-11-19 Type Inference with Subtypes. 155-175 1990 73 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#FuhM90 2003-11-19 Forword to the Special Issue on Real Numbers and Computers. 1-3 1996 162 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#BajardFMV96 2003-11-19 Balance properties of multi-dimensional words. 197-224 2002 273 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs273.html#BertheT02 http://dx.doi.org/10.1016/S0304-3975(00)00441-2 2003-11-19 The Discrimination Theorem Holds for Combinatory Weak Reduction. 393-394 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Hindley79 2003-11-19 The Completeness Theorem for Typing lambda-Terms. 1-17 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#Hindley83 2003-11-19 Coppo-Dezani Types do not Correspond to Propositional Logic. 235-236 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Hindley84 2003-11-19 BCK-Combinators and Linear lambda-Terms have Types. 97-105 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#Hindley89 2003-11-19 Combinatorial optimization algorithms for radio network planning. 235-245 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#CalegariGKN01 http://dx.doi.org/10.1016/S0304-3975(00)00245-0 2003-11-19 On the Correctness of Modular Systems. 139-177 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#NavarroOS95 http://dx.doi.org/10.1016/0304-3975(94)00207-Y 2003-11-19 A Relation Division Operator: The Conjugate Kernel. 247-272 1993 114 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#DesharnaisJMBM93 2003-11-19 Constant bounds on the moments of the height of binary search trees. 435-444 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#Robson02 http://dx.doi.org/10.1016/S0304-3975(01)00306-1 2003-11-19 Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. 313-317 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Robson90 2003-11-19 An O (T log T) Reduction from RAM Computations to Satisfiability. 141-149 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Robson91 2003-11-19 More Languages of Generalised Star Height 1. 327-335 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Robson92 2003-11-19 Analytic Machines. 151-167 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#ChadzelekH99 http://dx.doi.org/10.1016/S0304-3975(98)00287-4 2003-11-19 On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. 319-338 2003 306 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(03)00288-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#AngelBK03 2003-11-19 Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging. 211-239 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#PaiSV94 2004-09-02 The Equality Problem for Vector Addition Systems is Undecidable. 77-95 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Hack76 2003-11-19 Size of OBDD representation of 2-level redundancies functions. 615-625 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#NikolskaiaN01 http://dx.doi.org/10.1016/S0304-3975(00)00368-6 2003-11-19 Query by committee, linear separation and random walks. 25-51 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#FineGS02 http://dx.doi.org/10.1016/S0304-3975(01)00079-2 2003-11-19 A fully abstract model for the exchange of information in multi-agent systems. 1753-1773 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BoerEHM03 2003-11-19 Annotated Nonmonotonic Rule Systems. 111-146 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#NerodeRS97 http://dx.doi.org/10.1016/S0304-3975(96)00127-2 2003-11-19 Biprefix Codes, Inverse Semigroups and Syntactic Monoids of Injective Automata. 201-213 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Hall84 2003-11-19 Lower bounds for the rate of convergence in nonparametric pattern recognition. 3-24 2002 284 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Antos02 http://dx.doi.org/10.1016/S0304-3975(01)00077-9 2003-11-19 Evaluation Strategies for Functional Logic Programming. 2001 57 Electr. Notes Theor. Comput. Sci. http://www.elsevier.nl/locate/entcs/volume57.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs57.html#Antoy01 2003-11-19 Open and closed scopes for constrained genericity. 215-258 2002 275 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs275.html#DugganO02 http://dx.doi.org/10.1016/S0304-3975(01)00129-3 2003-11-19 Assumption/Guarantee Specifications in Linear-Time Temporal Logic. 47-72 1996 167 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs167.html#JonssonT96 http://dx.doi.org/10.1016/0304-3975(96)00069-2 2003-11-19 Testing preorders for probabilistic processes can be characterized by simulations. 33-51 2002 282 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#JonssonY02 http://dx.doi.org/10.1016/S0304-3975(01)00044-5 2003-11-19 ProveEasy: helping people learn to do proofs. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Burstall00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Approximate Solution of NP Optimization Problems. 1-55 1995 150 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs150.html#AusielloCP95 http://dx.doi.org/10.1016/0304-3975(94)00291-P 2003-11-19 Pattern Growth in Elementary Cellular Automata. 1-26 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#BragaCFV95 http://dx.doi.org/10.1016/0304-3975(94)00155-C 2003-11-19 On the Solvability of Domino Snake Problems. 243-269 1994 131 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#Etzion-PetruschkaHM94 2003-11-19 Mod 3 arithmetic on triangulated Riemann surfaces. 123-137 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Belaga01 http://dx.doi.org/10.1016/S0304-3975(00)00236-X 2003-11-19 Constructive Universal Algebra: An Introduction. 229-238 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Belaga87 2003-11-19 Bilinear Mincing Rank. 299-306 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#Belaga88 2003-11-19 Determinization of transducers over finite and infinite words. 225-251 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BealC02 2003-11-19 Temporal difference learning applied to game playing and the results of application to Shogi. 105-119 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#BealS01 http://dx.doi.org/10.1016/S0304-3975(00)00078-5 2003-11-19 On the Bound of the Synchronization Delay of a Local Automaton. 297-306 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#BealS98 http://dx.doi.org/10.1016/S0304-3975(98)80011-X 2003-11-19 Equivalence of Infinite Behavior of Finite Automata. 297-306 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Alaiwan84 2003-11-19 Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. 83-96 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#AusielloMP80 2003-11-19 Adherences of D0L Languages. 139-149 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Head84 2003-11-19 The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism. 329-333 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Head90 2003-11-19 Some complexity results for polynomial rational expressions. 735-741 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(01)00342-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Heam03 2003-11-19 The Kolmogorov Expressive Power of Boolean Query Languages. 317-361 1998 190 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#Tyszkiewicz98 http://dx.doi.org/10.1016/S0304-3975(97)00094-7 2003-11-19 25 Years. 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#AusielloSM01 2003-11-19 Linear Speed-Up for Cellular Automata Synchronizers and Applications. 45-57 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Heen97 http://dx.doi.org/10.1016/S0304-3975(96)00211-3 2003-11-19 Optimal and pessimal orderings of Steiner triple systems in disk arrays. 103-117 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00634-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#CohenC03 2003-11-19 Products of Finite State Machines with Full Coverage. 57-65 1996 154 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#CohenF96 http://dx.doi.org/10.1016/0304-3975(95)00129-8 2003-11-19 omega-Computations on Turing Machines. 1-23 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#CohenG78 2003-11-19 On the Complexity of omega-Type Turing Acceptors. 249-272 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#CohenG80 2003-11-19 The Theory of (N, +, Vk, V1) is Undecidable. 337-349 1992 106 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Villemaire92 2003-11-19 An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. 863-936 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Gori03 2003-11-19 Completions of Perpetual Logic Programs. 65-78 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Hein92 2003-11-19 Proof Normalization with Nonstandard Objects. 333-351 1991 85 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Goto91 2003-11-19 One application of real-valued interpretation of formal power series. 1931-1946 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Muchnik03a 2006-05-02 Kolmogorov entropy in the context of computability theory. 15-35 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#MuchnikP02 http://dx.doi.org/10.1016/S0304-3975(01)00028-7 2003-11-19 A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes. 227-258 1996 157 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#MuchnikV96 http://dx.doi.org/10.1016/0304-3975(95)00161-1 2003-11-19 Programs as Partial Graphs I: Flow Equivalence and Correctness. 1-25 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Schmidt81 2003-11-19 Approximation Properties of Abstract Data Types. 73-94 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Schmidt83 2003-11-19 The Recursion-Theoretic Structure of Complexity Classes. 143-156 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Schmidt85 2003-11-19 Avoidable Patterns on Two Letters. 1-17 1989 63 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Schmidt89 2003-11-19 On the Complexity of Counting in the Polynomial Hierarchy. 77-95 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Piotrow91 2003-11-19 On the Existence of Acyclic Views in a Database Scheme. 165-177 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#AusiellodM85 2003-11-19 Categorical Aspects of Data Type Constructors. 103-135 1987 50 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs50.html#Gray87 2003-11-19 Transducers and the Decidability of Independence in Free Monoids. 107-117 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#JurgensenSY94 2003-11-19 A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. 335-344 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Hoang92 2003-11-19 A Theory for the Derivation of Combinational C-MOS Circuit Designs. 235-251 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Hoare91 2003-11-19 Theory of genetic algorithms. 1-61 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Schmitt01 http://dx.doi.org/10.1016/S0304-3975(00)00406-0 2003-11-19 Hopf Algebras and Identities in Free Partially Commutative Monoids. 335-340 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Schmitt90 2003-11-19 Stable Trace Automata vs. Full Trace Automata. 45-100 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#Schmitt98 http://dx.doi.org/10.1016/S0304-3975(97)00299-5 2003-11-19 On Logics with Two Variables. 73-113 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#GradelO99 http://dx.doi.org/10.1016/S0304-3975(98)00308-9 2003-11-19 Finite Automata and Ordinals. 119-144 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Bedon96 http://dx.doi.org/10.1016/0304-3975(95)00006-2 2003-11-19 Undecidable properties of monoids with word problem solvable in linear time. 1301-1316 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#KatsuraK03 2003-11-19 The Shuffle Algebra and its Derivations. 359-369 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#KatsuraK93 2003-11-19 Groups of Finite Elementary Codes. 119-149 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#KatsuraT93 2003-11-19 A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. 327-339 1999 210 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#GuPS99 http://dx.doi.org/10.1016/S0304-3975(98)00092-9 2003-11-19 From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. 239-263 1992 101 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#BoerKPR92 2003-11-19 Multiplication is the Easiest Nontrivial Arithmetic Function. 333-339 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Alt85 2003-11-19 Nondeterministic Operations on Finite Relational Structures. 1-44 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#Barthelmann98 http://dx.doi.org/10.1016/S0304-3975(97)00263-6 2003-11-19 Efficient Inference Control for Range SUM Queries. 77-86 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#ChinKL84 2003-11-19 Map Theory. 1-133 1992 102 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Grue92 2003-11-19 Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism. 83-109 1984 28 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#Apt84 2003-11-19 The Essence of Constraint Propagation. 179-210 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#Apt99 http://dx.doi.org/10.1016/S0304-3975(99)00032-8 2003-11-19 On the Acceptance Power of Regular Languages. 207-225 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#Borchert95 http://dx.doi.org/10.1016/0304-3975(95)00032-R 2003-11-19 Latticial Structures in Data Analysis. 407-436 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Duquenne99 http://dx.doi.org/10.1016/S0304-3975(98)00279-5 2003-11-19 An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines. 305-320 1976 3 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Beeri76 2003-11-19 One-way probabilistic reversible and quantum one-counter automata. 963-976 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#YamasakiKTI02 2003-11-19 A Relation of Primal-Dual Lattices and the Complexity of Shortest Lattice Vector Problem. 105-116 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Cai98 http://dx.doi.org/10.1016/S0304-3975(98)00058-9 2003-11-19 Les Boîtes. 17-34 1991 81 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs81.html#Boe91 2003-11-19 Generalizing Completeness Results for Loop Checks in Logic Programming. 3-28 1992 104 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs104.html#Bol92 2003-11-19 A generic causal model for place latency. 1-49 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Durchholz02 2003-11-19 Games on Line Graphs and Sand Piles. 321-349 1993 115 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#ChK93 2003-11-19 Symmetric Discrete Universal Neural Networks. 405-416 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#ChM96 http://dx.doi.org/10.1016/S0304-3975(96)00085-0 2003-11-19 Source reversal and chip firing on graphs. 287-295 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#ChP00 http://dx.doi.org/10.1016/S0304-3975(99)00122-X 2003-11-19 Complexity of Tile Rotation Problems. 129-159 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#ChR97 http://dx.doi.org/10.1016/S0304-3975(96)00291-5 2003-11-19 Tiling Allowing Rotations Only. 285-295 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#ChR99 http://dx.doi.org/10.1016/S0304-3975(98)00327-2 2003-11-19 Generalizations of Opt P to the Polynomial Hierarchy. 183-198 1992 97 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Krentel92 2003-11-19 Locally finite languages. 223-261 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Finkel01 http://dx.doi.org/10.1016/S0304-3975(99)00286-8 2003-11-19 Borel hierarchy and omega context free languages. 1385-1405 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Finkel03 2003-11-19 Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. 137-142 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Finkel85 2003-11-19 A stronger Kolmogorov zero-one law for resource-bounded measure. 723-732 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Dai03 2003-11-19 CTL* and ECTL* as Fragments of the Modal mu-Calculus. 77-96 1994 126 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs126.html#Dam94 2003-11-19 On the Decidability of Process Equivalences for the pi-Calculus. 215-228 1997 183 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Dam97 http://dx.doi.org/10.1016/S0304-3975(96)00325-8 2003-11-19 Some Observations on the Connection Between Counting an Recursion. 131-147 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Wagner86 2003-11-19 More Complicated Questions About Maxima and Minima, and Some Closures of NP. 53-80 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Wagner87 2003-11-19 Algebras, Polynomials and Programs. 3-34 1990 70 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Wagner90 2003-11-19 On the Role of Memory in Object-Based and Object-Oriented Languages. 179-199 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#Wagner95 http://dx.doi.org/10.1016/0304-3975(94)00208-Z 2003-11-19 Liminf Convergence in Omega-Categories. 61-104 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#Wagner97 http://dx.doi.org/10.1016/S0304-3975(96)00223-X 2003-11-19 Online independent sets. 953-962 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#HalldorssonIMT02 2003-11-19 Applications quasi-affines et pavages du plan discret. 245-269 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Col01 http://dx.doi.org/10.1016/S0304-3975(00)00006-2 2003-11-19 About local configurations in arithmetic planes. 183-201 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#Col02 http://dx.doi.org/10.1016/S0304-3975(01)00064-0 2003-11-19 Optimal Wavelength Routing on Directed Fiber Trees. 119-137 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#ErlebachJKMP99 http://dx.doi.org/10.1016/S0304-3975(99)00029-8 2003-11-19 Optimal Estimation on the Order of Local Testability of Finite Automata. 59-74 2000 231 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Trahtman00 http://dx.doi.org/10.1016/S0304-3975(99)00017-1 2003-11-19 Erratum to ``Optimal estimation on the order of local testability of finite automata'' - [TCS 231(2000) 59-74]. 697 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Trahtman01 http://dx.doi.org/10.1016/S0304-3975(00)00071-2 2003-11-19 Applications of Scheduling Theory to Formal Language Theory. 217-243 1985 37 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#GonczarowskiW85 2003-11-19 Manipulating Derivation Forests by Scheduling Techniques. 87-119 1986 45 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs45.html#GonczarowskiW86 2003-11-19 Strong cocycle triviality for Z2 subshifts. 191-213 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Jenkinson01 http://dx.doi.org/10.1016/S0304-3975(00)00189-4 2003-11-19 Equational and implicational classes of coalgebras. 57-69 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Gumm01 http://dx.doi.org/10.1016/S0304-3975(00)00122-5 2003-11-19 Generating Algebraic Laws from Imperative Programs. 385-405 1999 217 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Gumm99 http://dx.doi.org/10.1016/S0304-3975(98)00278-3 2005-03-17 On Edge-Colouring Indifference Graphs. 91-106 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#FigueiredoMM97 http://dx.doi.org/10.1016/S0304-3975(96)00264-2 2003-11-19 C-Expressions: A Variable-Free Calculus for Equational Logic Programming. 209-252 1993 107 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#BelliaO93 2003-11-19 Riemann and Edalat integration on domains. 259-275 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00696-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#LawsonL03 2003-11-19 An Extensional Treatment of Dataflow Deadlock. 3-15 1981 13 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Wadge81 2003-11-19 Left Ideals and Reachability in Machines. 49-56 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Hofer89 2003-11-19 Experiments and Stability in Group Automata. 117-120 1991 80 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#Hofer91 2003-11-19 Edge-isoperimetric problems for cartesian powers of regular graphs. 473-492 2003 307 Theor. Comput. Sci. 3 http://dx.doi.org/10.1016/S0304-3975(03)00232-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#BezrukovE03 2003-11-19 Kolmogorov complexity and cellular automata classification. 271-285 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#DubacqDF01 http://dx.doi.org/10.1016/S0304-3975(00)00012-8 2003-11-19 Fusion of recursive programs with computational effects. 165-207 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Pardo01 http://dx.doi.org/10.1016/S0304-3975(00)00127-4 2003-11-19 On Inefficient Special Cases of NP-Complete Problems. 239-252 1989 63 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#DuB89 2004-01-15 Tree-width and the monadic quantifier hierarchy. 157-170 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00449-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#MakowskyM03 2003-11-19 In Memoriam Ronald V. Book. 1-3 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#DuK98 2003-11-19 Foreword (COCOON'95). 227 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#DuL97 http://dx.doi.org/10.1016/S0304-3975(96)00271-X 2003-11-19 Weak Second Order Characterizations of Various Program Verification Systems. 299-321 1989 66 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#MakowskyS89 2003-11-19 Multiple Returns Under a Bounded Number of Iterations. 139-144 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Kowalski94 2003-11-19 Recursive circulants and their embeddings among hypercubes. 35-62 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#ParkC00 http://dx.doi.org/10.1016/S0304-3975(00)00176-6 2003-11-19 On the Construction of Regular Minimal Broadcast Digraphs. 329-342 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#ParkC94 2003-11-19 Situated Simplification. 235-252 1997 173 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#PodelskiS97 http://dx.doi.org/10.1016/S0304-3975(96)00197-1 2003-11-19 Parallel algorithms for red-black trees. 415-435 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#ParkP01 http://dx.doi.org/10.1016/S0304-3975(00)00287-5 2003-11-19 A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation. 115-142 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#BellinK92 2003-11-19 Computing by Splicing. 321-336 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#PaunRS96 http://dx.doi.org/10.1016/S0304-3975(96)00082-5 2003-11-19 On the pi-Calculus and Linear Logic. 11-65 1994 135 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#BellinS94 2003-11-19 Homotopies for Solving Polynomial Systems Within a Bounded Domain. 165-185 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#VerscheldeH94 2003-11-19 The Binary Network Flow Problem is Logspace Complete for P. 357-363 1990 75 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#LengauerW90 2003-11-19 Efficient Sampling Strategies for Relational Database Operations. 195-226 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#LiptonNSS93 2003-11-19 Using Maximal Independent Sets to Solve Problems in Parallel. 57-65 1995 148 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#ShoudaiM95 http://dx.doi.org/10.1016/0304-3975(94)00221-4 2003-11-19 Transformational Approach to Program Concretization. 37-46 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Kasyanov91 2003-11-19 On Another Boolean Matrix. 49-56 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Pippenger80 2003-11-19 On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets. 279-291 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#FuL93 2003-11-19 Complete distributional problems, hard languages, and resource-bounded measure. 273-286 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#PavanS00 http://dx.doi.org/10.1016/S0304-3975(99)00295-9 2003-11-19 Understanding the mismatch combinator in chi calculus. 779-830 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#FuY03 2003-11-19 Complete Extension of General Logic Programs. 281-294 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Gil92 2003-11-19 Foreword: Real Numbers and Computers. 1-2 1999 210 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#BajardFM99 http://dx.doi.org/10.1016/S0304-3975(98)00094-2 2005-07-25 Infinite trees and completely iterative theories: a coalgebraic view. 1-45 2003 300 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00728-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#AczelAMV03 2003-11-19 Discovering characteristic expressions in literary works. 525-546 2003 292 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#TakedaMFN03 2003-11-19 Towards Efficient Induction Mechanisms in Database Systems. 361-385 1994 133 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Han94 2003-11-19 On the Convergence Rates of Genetic Algorithms. 23-39 1999 229 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs229.html#HeK99 http://dx.doi.org/10.1016/S0304-3975(99)00091-2 2003-11-19 Semantic Models for Concurrent Logic Languages. 3-33 1991 86 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs86.html#BoerRKP91 2003-11-19 Finite Labelling Problem in Event Structures. 9-19 1994 123 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#AssousBCR94 2003-11-19 On Almost Bad Boolean Bases. 419-469 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#Stetsenko94 2003-11-19 A guide to membrane computing. 73-100 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#PaunR02 2003-11-19 Sticker Systems. 183-203 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#PaunR98 http://dx.doi.org/10.1016/S0304-3975(98)00039-5 2003-11-19 Closure Properties of Slender Languages. 293-301 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#PaunS93 2003-11-19 Massively Parallel Factorizations of Polynomials With Many Non-Commuting Variables. 255-263 1997 172 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#Hohl97 http://dx.doi.org/10.1016/S0304-3975(96)00108-9 2003-11-19 Bijections and the Riordan group. 403-413 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00227-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Shapiro03 2003-11-19 Hot Topics in Reduction Strategies - A Panelist's View. 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#Ida01 2003-11-19 Coherence Completions of Categories. 153-184 1999 227 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#HuJ99 http://dx.doi.org/10.1016/S0304-3975(99)00051-1 2003-11-19 Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. 129-140 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#Hofbauer92 2003-11-19 A Tradeoff Theorem for Space and Reversal. 221-224 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Hong84 2003-11-19 Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#Hamada00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. 107-140 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#HowellRHY86 2003-11-19 Tail Recursion Through Universal Invariants. 151-189 1993 115 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs115.html#Jay93 2003-11-19 Covariant Types. 237-258 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Jay97 http://dx.doi.org/10.1016/S0304-3975(97)00045-5 2003-11-19 A Proof on Simon's Theorem on Piecewise Testable Languages. 257-264 1997 178 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#Higgins97 http://dx.doi.org/10.1016/S0304-3975(96)00230-7 2003-11-19 Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. 161-184 1996 169 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#GlobermanH96 http://dx.doi.org/10.1016/S0304-3975(96)00119-3 2003-11-19 Schranken für Balanced Trees bei ausgewogenen Verteilungen. 51-59 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Hotz76 2003-11-19 Eine neue Invariante für Kontextfreie Sprachen. 107-116 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Hotz80 2003-11-19 Decomposition of a hypergraph by partial-edge separators. 57-79 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#MalvestutoM00 http://dx.doi.org/10.1016/S0304-3975(98)00128-5 2003-11-19 Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets. 101-124 1992 94 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#MancaS92 2003-11-19 The Memory Game. 169-196 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#ZwickP93 2003-11-19 The Complexity of Mean Payoff Games on Graphs. 343-359 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#ZwickP96 http://dx.doi.org/10.1016/0304-3975(95)00188-3 2003-11-19 Multi-Valued Logic Programming Semantics: An Algebraic Approach. 77-109 1997 171 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs171.html#MobasherPS97 http://dx.doi.org/10.1016/S0304-3975(96)00126-0 2003-11-19 Some Complexity Bounds for Subtype Inequalities. 3-27 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#Benke99 http://dx.doi.org/10.1016/S0304-3975(98)00134-0 2003-11-19 A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. 341-372 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#HowellRY91a 2003-11-19 Indexings of Subrecursive Classes. 277-301 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#Kozen80a 2003-11-19 On polynomial-time approximation algorithms for the variable length scheduling problem. 489-495 2003 1-3 Theor. Comput. Sci. 302 http://dx.doi.org/10.1016/S0304-3975(03)00141-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#CzumajGGKRZ03 2003-11-19 An Elementary Proof of the Completness of PDL. 113-118 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#KozenP81 2003-11-19 Double Greibach operator grammars. 247-264 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Kim01 http://dx.doi.org/10.1016/S0304-3975(99)00138-3 2003-11-19 Two undecidability results for chain code picture languages. 969-976 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Kim02 http://dx.doi.org/10.1016/S0304-3975(01)00195-5 2003-11-19 Complexity and Decidability for Restricted Classes of Picture Languages. 295-311 1990 73 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#Kim90 2003-11-19 Retreat Bounded Picture Languages. 85-112 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Kim94 2003-11-19 New Values in Domineering. 263-280 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Kim96 http://dx.doi.org/10.1016/0304-3975(95)00150-6 2003-11-19 A Hierarchy of eNCE Families of Graph Languages. 157-169 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#Kim97 http://dx.doi.org/10.1016/S0304-3975(97)86542-5 2003-11-19 Optimal Bounds for the Change-Making Problem. 377-388 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#KozenZ94 2003-11-19 On the Notion of Infinite Pseudorandom Sequences. 9-33 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Ko86a 2003-11-19 Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. 341-343 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Ko87a 2003-11-19 Unions of non-disjoint theories and combinations of satisfiability procedures. 291-353 2003 290 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#TinelliR03 2003-11-19 Computational Complexity of Real Functions. 323-352 1982 20 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs20.html#KoF82 2003-11-19 Finite maximal solid codes. 333-347 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Lam01 http://dx.doi.org/10.1016/S0304-3975(00)00277-2 2003-11-19 Completing comma-free codes. 399-415 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00595-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Lam03 2003-11-19 Hajós Factorizations and Completion of Codes. 245-256 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#Lam97 http://dx.doi.org/10.1016/S0304-3975(97)00032-7 2003-11-19 On stable cutsets in line graphs. 463-475 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(03)00048-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#LeR03 2003-11-19 Generating well-shaped d-dimensional Delaunay Meshes. 145-165 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00437-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Li03a 2003-11-19 On Simple and Creative Sets in NP. 169-180 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Homer86 2003-11-19 On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. 1-41 1992 93 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#KfouryTU92 2003-11-19 A General Context-Free Parsing Algorithm Running in Linear Time on Every LR (k) Grammar Without Using Lookahead. 165-176 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Leo91 2003-11-19 Independent triangles covering given vertices of a graph. 333-344 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#LiL01 http://dx.doi.org/10.1016/S0304-3975(00)00253-X 2003-11-19 Local and global cyclicity in free semigroups. 25-36 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Holub01 http://dx.doi.org/10.1016/S0304-3975(00)00156-0 2003-11-19 Résolutions universelles pour des problèmes NP-complets. 137-150 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#Portier98 http://dx.doi.org/10.1016/S0304-3975(97)00029-7 2003-11-19 A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. 259-275 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Lin97 http://dx.doi.org/10.1016/S0304-3975(97)00046-7 2003-11-19 Universality and decidability of number-conserving cellular automata. 711-721 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Moreira03 2003-11-19 Dynamic scheduling of parallel computations. 239-252 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Liu00 http://dx.doi.org/10.1016/S0304-3975(99)00081-X 2003-11-19 Regular component decomposition of regular languages. 743-749 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00064-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Liu03 2003-11-19 On Combinatory Algebras and their Expansions. 31-40 1984 31 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#BruceL84 2003-11-19 An Improved Shellsort Algorithm. 241-247 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Liu97 http://dx.doi.org/10.1016/S0304-3975(97)00100-X 2003-11-19 A Logic for Rewriting Strategies. 2001 58 Electr. Notes Theor. Comput. Sci. 2 http://www.elsevier.nl/locate/entcs/volume58.html http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#Kieburtz01 2003-11-19 Speedup of Determinism by Alternation for Multidimensional Turing Machines. 427-453 1994 134 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Mak94 2003-11-19 Approximation of some NP-hard optimization problems by finite machines, in probability. 323-339 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#HongB01 http://dx.doi.org/10.1016/S0304-3975(00)00016-5 2003-11-19 Lower Bounds on Communication Overlap of Networks. 323-328 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#HongZ86 2003-11-19 Une breve biographie scientifique de Maurice Nivat. 3-23 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Curien02 http://dx.doi.org/10.1016/S0304-3975(02)00004-X 2003-11-19 An Abstract Framework for Environment Machines. 389-402 1991 82 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Curien91 2003-11-19 A Hierarchy of Temporal Logics with Past. 303-324 1995 148 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs148.html#LaroussinieS95 http://dx.doi.org/10.1016/0304-3975(95)00035-U 2004-01-27 Topology of Strings: Median String is NP-Complete. 39-48 2000 230 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#HigueraC00 http://dx.doi.org/10.1016/S0304-3975(97)00240-5 2003-11-19 Finite Games for a Predicate Logic Without Contractions. 341-349 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Mey94 2003-11-19 On the Construction of Parallel Computers from Various Bases of Boolean Functions. 43-58 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#GoldschlagerP86 2004-01-27 Drawing and Encoding Two-Dimensional Posets. 293-308 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#HigueraN97 http://dx.doi.org/10.1016/S0304-3975(96)00205-8 2003-11-19 Real number computation through Gray code embedding. 467-485 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Tsuiki02 http://dx.doi.org/10.1016/S0304-3975(01)00104-9 2003-11-19 A domain-theoretic semantics of lax generic functions. 307-331 2003 294 Theor. Comput. Sci. 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs294.html#Tsuiki03 2003-11-19 A domain-theoretic semantics of lax generic functions. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Tsuiki99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem. 347-356 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#WanYK97 http://dx.doi.org/10.1016/S0304-3975(96)00279-4 2003-11-19 Analogical Program Derivation Based on Type Theory. 259-272 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#LuX93 2003-11-19 Three-dimensional convex hull as a fruitful source of diagrams. 325-337 2000 235 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Sugihara00 http://dx.doi.org/10.1016/S0304-3975(99)00202-9 2003-11-19 Recursive Assertions are not enough - or are they? 73-87 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#AptBM79 2003-11-19 Process Algebra with Language Matching. 425-458 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Wamel97 http://dx.doi.org/10.1016/S0304-3975(97)88197-2 2003-11-19 A shrinking lemma for random forbidding context languages. 149-158 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#WaltE00 http://dx.doi.org/10.1016/S0304-3975(98)00160-1 2003-11-19 A property of random context picture grammars. 313-320 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00588-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#WaltE03 2003-11-19 Selected papers from COCOON 1998 - Foreword. 211 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#HsuK01 http://dx.doi.org/10.1016/S0304-3975(00)00139-0 2003-11-19 PC trees and circular-ones arrangements. 99-116 2003 296 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/S0304-3975(02)00435-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#HsuM03 2003-11-19 Efficient Massively Parallel Implementation of some Combinatorial Algorithms. 297-322 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#HsuR96 http://dx.doi.org/10.1016/0304-3975(96)00034-5 2003-11-19 Infinite lambda-Calculus and Types. 29-75 1999 212 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs212.html#BerarducciD99 http://dx.doi.org/10.1016/S0304-3975(98)00135-2 2003-11-19 Some New Results on Easy lambda-Terms. 71-88 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#BerarducciI93 2003-11-19 Logical analysis of data with decomposable structures. 977-995 2002 289 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#OnoMI02 2003-11-19 The List Update Problem and the Retrieval of Sets. 101-123 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#dAmoreL94 2003-11-19 A new routing algorithm for multirate rearrangeable Clos networks. 2157-2167 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Ngo03 2003-11-19 Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. 377-401 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Wang00a http://dx.doi.org/10.1016/S0304-3975(98)00334-X 2003-11-19 Simulating the CRCW PRAM on Reconfigurable Networks. 231-242 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Wang98a http://dx.doi.org/10.1016/S0304-3975(97)00096-0 2003-11-19 On Rational Series and Rational Languages. 329-336 1998 205 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#Wang98b http://dx.doi.org/10.1016/S0304-3975(98)00103-0 2003-11-19 Corrigendum to Galmiche's and Perrier's ``On Proof Normalization in Linear Logic''. 353-354 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Perrier98 http://dx.doi.org/10.1016/S0304-3975(98)00145-5 2003-11-19 A PSPACE-complete Fragment of Second-order Linear Logic. 267-289 1999 224 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Perrier99 http://dx.doi.org/10.1016/S0304-3975(98)00315-6 2003-11-19 An Optimization Problem in Virtual Endoscopy. 203-216 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#WangG98 http://dx.doi.org/10.1016/S0304-3975(98)00065-6 2003-11-19 Fixed Topology Steiner Trees and Spanning Forests. 359-370 1999 215 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#WangJ99 http://dx.doi.org/10.1016/S0304-3975(98)00216-3 2003-11-19 Srl Yantra Geometry. 609-628 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Huet02 http://dx.doi.org/10.1016/S0304-3975(02)00028-2 2003-11-19 A Unification Algorithm for Typed lambda-Calculus. 27-57 1975 1 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Huet75 2003-11-19 An Analysis of Böhm's Theorem. 145-167 1993 121 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#Huet93 2003-11-19 Three-dimensional weak visibility: Complexity and applications. 219-232 2000 234 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#WangZ00 http://dx.doi.org/10.1016/S0304-3975(98)00132-7 2003-11-19 Euclidian Geometry in Terms of Automata Theory. 71-87 1989 68 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Huckenbeck89 2003-11-19 A Result about the Power of Geometric Oracle Machines. 231-251 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Huckenbeck91 2003-11-19 Fair Termination Revisited-With Delay. 65-84 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#AptPS84 2003-11-19 Graphs determined by polynomial invariants. 365-384 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00225-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Noy03 2003-11-19 Sur les Monoides À un Relateur qui sont des Groupes. 331-334 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#PerrinS84 2003-11-19 Non-Finite Specifiability of Projections of Functional Dependency Families. 239-265 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Hull85 2003-11-19 Relating CASL with other specification languages: the institution level. 367-475 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Mossakowski02 2003-11-19 Unsupervised learning in neural computation. 187-207 2002 287 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#Oja02 2003-11-19 Investigating topological chaos by elementary cellular automata dynamics. 219-241 2000 244 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs244.html#CattaneoFM00 http://dx.doi.org/10.1016/S0304-3975(98)00345-4 2003-11-19 Tile invariants: new horizons. 303-331 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00495-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Pak03 2003-11-19 The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations. 117-138 1984 33 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Pan84 2003-11-19 Complexity of Parallel Matrix Computations. 65-85 1987 54 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#Pan87 2003-11-19 Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields. 173-223 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#Pan96 http://dx.doi.org/10.1016/0304-3975(96)00030-8 2003-11-19 Foreword: Non-standard Logics and Logical Aspects of Computer Science. 1 1997 175 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Ono97 http://dx.doi.org/10.1016/S0304-3975(96)00166-1 2003-11-19 QRT FIFO Automata, Breath-First Grammars and Their Relations. 171-203 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#CherubiniCCM91 2003-11-19 On universally easy classes for NP-complete problems. 471-476 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00286-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#DemaineLM03 2003-11-19 Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. 243-286 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#GinsburgH83a 2003-11-19 Sequential and Concurrent Behaviour in Petri Net Theory. 87-136 1987 55 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#BestD87 2003-11-19 Some Uniformly Erasable Families of Languages. 29-44 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#GinsburgGG76 2003-11-19 Petri Net Semantics of Priority Systems. 175-174 1992 96 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#BestK92 2003-11-19 Algebraic tools for the concatenation product. 317-342 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Pin03 2003-11-19 Sur le Monoide Syntactique de L Lorsque L est un Langage Fini. 211-215 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Pin78 2003-11-19 Polynomial Closure of Group Languages and Open Sets of the Hall Topology. 185-200 1996 169 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Pin96 http://dx.doi.org/10.1016/S0304-3975(96)00120-X 2003-11-19 Reconnaissance parallele des langages rationnels sur automates cellulaires plans. 251-289 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#DelormeM02 http://dx.doi.org/10.1016/S0304-3975(02)00016-6 2003-11-19 Logical systems for structured specifications. 197-245 2002 286 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Borzyszkowski02 2003-11-19 Decidability of DPDA equivalence. 1-31 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Stirling01 http://dx.doi.org/10.1016/S0304-3975(00)00389-3 2003-11-19 A Proof-Theoretic Characterization of Observational Equivalence. 27-45 1985 39 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs39.html#Stirling85 2003-11-19 Modal Logics for Communicating Systems. 311-347 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Stirling87 2003-11-19 A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language. 347-359 1988 58 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs58.html#Stirling88 2003-11-19 Decidability of Bisimulation Equivalence for Normed Pushdown Processes. 113-131 1998 195 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#Stirling98 http://dx.doi.org/10.1016/S0304-3975(97)00216-8 2003-11-19 On lengths of words in context-free languages. 327-359 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Ilie00 http://dx.doi.org/10.1016/S0304-3975(98)00266-7 2003-11-19 On a Conjecture about Slender Context-Free Languages. 427-434 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Ilie94 2003-11-19 On Computational Complexity of Contextual Languages. 33-44 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Ilie97 http://dx.doi.org/10.1016/S0304-3975(96)00309-X 2003-11-19 Branch and bound on the network model. 107-123 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Jain01 http://dx.doi.org/10.1016/S0304-3975(99)00158-9 2003-11-19 Just-in-time: On Strategy Annotations. 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#Pol01 2003-11-19 Operational Semantics of Rewriting with Priorities. 289-312 1998 200 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#Pol98 http://dx.doi.org/10.1016/S0304-3975(97)00283-1 2003-11-19 Synthesis, Structure and Power of Systolic Computations. 47-77 1990 71 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#Gruska90 2003-11-19 Lower Bounds for Polynomials with Algebraic Coefficients. 321-330 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#HeintzS80 2003-11-19 DNA computing based on splicing: universality results. 275-296 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Pun00 http://dx.doi.org/10.1016/S0304-3975(99)00104-8 2004-07-01 Object grammars and bijections. 1915-1929 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DutourF03 2003-11-19 Some characteristics of strong innermost normalization. 141-164 2000 239 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs239.html#Rao00 http://dx.doi.org/10.1016/S0304-3975(99)00215-7 2003-11-19 On Fast Planning of Suboptimal Paths Amidst Polygonal Obstacles in Plane. 265-289 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#Rao95 http://dx.doi.org/10.1016/0304-3975(94)00194-N 2003-11-19 A Framework for Incremental Learning of Logic Programs. 193-213 1997 185 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Rao97 2003-11-19 Modular Aspects of Term Graph Rewriting. 59-86 1998 208 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs208.html#Rao98 http://dx.doi.org/10.1016/S0304-3975(98)00079-6 2003-11-19 Multimodal Logic Programming Using Equational and Order-Sorted Logic. 141-166 1992 105 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#DebartEL92 2003-11-19 Length Considerations in Context-Free Languages. 21-32 1997 183 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#Raz97 http://dx.doi.org/10.1016/S0304-3975(96)00308-8 2003-11-19 The Combinational Complexity of Equivalence. 289-295 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Schnorr76 2003-11-19 Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. 251-261 1978 7 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#Schnorr78 2003-11-19 A 3n-Lower Bound on the Network Complexity of Boolean Functions. 83-92 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Schnorr80 2003-11-19 A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. 201-224 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Schnorr87 2003-11-19 Tree-based picture generation. 1-51 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#Drewes00 http://dx.doi.org/10.1016/S0304-3975(00)00168-7 2003-11-19 Tree-based generation of languages of fractals. 377-414 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#Drewes01 http://dx.doi.org/10.1016/S0304-3975(00)00280-2 2003-11-19 Recognising k-Connected Hypergraphs in Cubic Time. 83-122 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#Drewes93 2003-11-19 If not Empty, NP - P is Topologically Large. 293-310 1993 119 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Zimand93 2003-11-19 On the Topological Size of p-m-Complete Degrees. 137-147 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#Zimand95 http://dx.doi.org/10.1016/0304-3975(94)00240-J 2003-11-19 On the Size of Classes with Weak Membership Properties. 225-235 1998 209 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#Zimand98 http://dx.doi.org/10.1016/S0304-3975(97)00114-X 2003-11-19 Preface: Theoretical Computer Science in Australia and New Zealand. 1 1996 169 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#JayS96 2003-11-19 A Corrected 5NF Definition for Relational Database Design. 379-391 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Vincent97 http://dx.doi.org/10.1016/S0304-3975(97)00050-9 2003-11-19 Clustering to Minimize the Maximum Intercluster Distance. 293-306 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Gonzalez85 2003-11-19 The Complementation Problem for Büchi Automata with Appplications to Temporal Logic. 217-237 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#SistlaVW87 2003-11-19 On the Cell Probe Complexity of Polynomial Evaluation. 167-174 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#Miltersen95 http://dx.doi.org/10.1016/0304-3975(95)80032-5 2003-11-19 A characterization of alternating log time by ramified recurrence. 193-208 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#LeivantM00 http://dx.doi.org/10.1016/S0304-3975(99)00209-1 2003-11-19 How Good is the Information Theory Bound in Sorting? 355-361 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Fredman76 2003-11-19 Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. 59-78 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Sen97 http://dx.doi.org/10.1016/S0304-3975(96)00212-5 2003-11-19 Some Machines Defined bu Directed Graphs. 309-319 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#Bruijn84 2003-11-19 Linear Dynamic Kahn Networks are Deterministic. 3-32 1998 195 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#BruinN98 http://dx.doi.org/10.1016/S0304-3975(97)00156-4 2003-11-19 Dynamic Detection of Determinism in Functional Languages. 59-87 1995 142 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#LoogenW95 http://dx.doi.org/10.1016/0304-3975(94)00225-8 2003-11-19 A unified language processing methodology. 499-536 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#Rus02 http://dx.doi.org/10.1016/S0304-3975(02)00025-7 2003-11-19 Algebraic Construction of Compliers. 271-308 1991 90 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Rus91 2003-11-19 Algebraic Processing of Programming Languages. 105-143 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Rus98 http://dx.doi.org/10.1016/S0304-3975(97)00270-3 2003-11-19 Non-injective knapsack public-key cryptosystems. 401-422 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Koskinen01 http://dx.doi.org/10.1016/S0304-3975(99)00297-2 2003-11-19 Abstract Data Types with Exception Handling: An Initial Approach Based on a Distinction Between Exceptions and Errors. 13-45 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#BernotBC86 2003-11-19 On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions. 115-148 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Tao81 2003-11-19 Observational Specifications and the Indistinguishability Assumption. 275-314 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#BernotBK95 http://dx.doi.org/10.1016/0304-3975(94)00017-D 2003-11-19 Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II. 185-197 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Arai00a http://dx.doi.org/10.1016/S0304-3975(98)00186-8 2003-11-19 Tractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference. 129-144 1996 170 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Arai96a http://dx.doi.org/10.1016/S0304-3975(96)80704-3 2003-11-19 Extended normal form theorems for logical proofs from axioms. 121-132 2000 232 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs232.html#AraiM00 http://dx.doi.org/10.1016/S0304-3975(99)00172-3 2003-11-19 Identities in Search of Identity. 23-38 1993 117 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Zeilberger93 2003-11-19 Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters. 187-205 1992 95 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Ollagnier92 2003-11-19 Algorithms and Methods in Differential Algebra. 115-127 1996 157 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#Ollagnier96 http://dx.doi.org/10.1016/0304-3975(95)00179-4 2003-11-19 Game tree algorithms and solution trees. 197-215 2001 252 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#PijlsB01 http://dx.doi.org/10.1016/S0304-3975(00)00082-7 2003-11-19 Some results on Hahn-Banach-type theorems for continuous D-cones. 205-218 2001 264 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Tix01 http://dx.doi.org/10.1016/S0304-3975(00)00223-1 2003-11-19 An Algebraic Generalization of Frege Structures-Binding Algebras. 189-232 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#Sun99 http://dx.doi.org/10.1016/S0304-3975(97)00170-9 2003-11-19 On Parsing Coupled-Context-Free Languages. 205-233 1996 161 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#HotzP96 http://dx.doi.org/10.1016/0304-3975(95)00114-X 2003-11-19 Determining the Exit Time Distribution for a Closed Cyclic Network. 149-165 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#BaccelliMW94 2003-11-19 The growth function of context-free languages. 601-605 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Incitti01 http://dx.doi.org/10.1016/S0304-3975(00)00152-3 2003-11-19 Completing the Temporal Picture. 91-130 1991 83 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs83.html#MannaP91 2003-11-19 The Convergence of Functions to Fixedpoints of Recursive Definitions. 109-141 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#MannaS78 2003-11-19 Domains in H. 171-193 2001 264 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#FioreR01 http://dx.doi.org/10.1016/S0304-3975(00)00221-8 2003-11-19 Ensembles Code-Compatibles et une Généralisation du Théorème de Sardinas-Patterson. 123-132 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Van85 2003-11-19 Specification and proof in membership equational logic. 35-132 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#BouhoulaJM00 http://dx.doi.org/10.1016/S0304-3975(99)00206-6 2003-11-19 Polymorphic Lambda Calculus: The Church-Rosser Property. 365-371 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Koletsos91 2003-11-19 Equational Type Logic. 131-159 1990 77 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#MancaSS90 2003-11-19 Completeness of Resolution Revisited. 227-237 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Bezem90 2003-11-19 An Algebraic Approach to Semantics of Programming Languages. 267-288 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#LastovetskyG94 2003-11-19 TWDM Multichannel Lightwave Hypercube Networks. 123-136 1998 194 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs194.html#Wan98 http://dx.doi.org/10.1016/S0304-3975(97)00003-0 2003-11-19 Lower Bounds for the Approximative Complexity. 329-338 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#Griesser86 2003-11-19 Correctness of Fixpoint Transformations. 123-142 1994 129 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Wei94 2003-11-19 Towards a practical snapshot algorithm. 163-201 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#RianyST01 http://dx.doi.org/10.1016/S0304-3975(00)00412-6 2003-11-19 Complexity, Combinatorial Group Theory and the Language of Palutators. 253-275 1988 56 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Tretkoff88 2003-11-19 Stratified negation in temporal logic programming and the cycle-sum test. 663-676 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Rondogiannis01 http://dx.doi.org/10.1016/S0304-3975(00)00374-1 2003-11-19 Time-Space Tradeoffs for Set Operations. 99-129 1993 110 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs110.html#Patt-ShamirP93 2003-11-19 A probabilistic analysis of randomly generated binary constraint satisfaction problems. 1815-1828 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#DyerFM03 2003-11-19 An Augmented Voronoi Roadmap for 3D Translational Motion Planning for a Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles. 205-230 1995 140 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#DattasharmaK95 http://dx.doi.org/10.1016/0304-3975(94)00191-K 2003-11-19 Ordinal Mind Change Complexity of Language Identification. 323-343 1999 220 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#AmbainisJS99 http://dx.doi.org/10.1016/S0304-3975(99)00005-5 2003-11-19 The Ajtai Random Class of Lattices. 29-36 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#Cusick99 http://dx.doi.org/10.1016/S0304-3975(99)00063-8 2003-11-19 Dynamic connectors for concurrency. 131-176 2002 281 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#BruniM02 http://dx.doi.org/10.1016/S0304-3975(02)00011-7 2003-11-19 Expressiveness of matchgates. 457-471 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Valiant02 2003-11-19 The Complexity of Computing the Permanent. 189-201 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Valiant79 2003-11-19 Negation can be Exponentially Powerful. 303-314 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Valiant80 2003-11-19 A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group. 55-63 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Xin89 2003-11-19 Approximation algorithms for channel assignment with constraints. 649-667 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#JanssenN01 http://dx.doi.org/10.1016/S0304-3975(00)00388-1 2003-11-19 Properties of Complexity Measures for Prams and Wrams. 53-73 1986 48 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#BublitzSW86 2003-11-19 On the Time-Space Tradeoff for Sorting with Linear Queries. 203-218 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Yao82 2004-11-22 Analysis of randomized load distribution for reproduction trees in linear arrays and rings. 195-214 2004 321 Theor. Comput. Sci. 2-3 http://dx.doi.org/10.1016/j.tcs.2004.03.033 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Li04 2003-11-19 Algebraic Decision Trees and Euler Characteristics. 133-150 1995 141 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#Yao95 http://dx.doi.org/10.1016/0304-3975(94)00082-T 2003-11-19 Some Consequences of Non-Uniform Conditions on Uniform Classes. 287-300 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Yap83 2003-11-19 Specification languages in algebraic compilers. 351-385 2003 291 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#Wyk03 2003-11-19 Equivalence of Computations in Actor Grammars. 145-180 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#Janssens93 2003-11-19 Finite-dimensional T-colorings of graphs. 275-281 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Yeh01 http://dx.doi.org/10.1016/S0304-3975(00)00249-8 2003-11-19 A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems. 263-287 1992 98 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Yen92 2003-11-19 On Reachability Equivalence for BPP-Nets. 301-317 1997 179 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#Yen97 http://dx.doi.org/10.1016/S0304-3975(96)00147-8 2003-11-19 A cost-effective estimation of uncaught exceptions in Standard ML programs. 185-217 2002 277 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs277.html#YiR02 http://dx.doi.org/10.1016/S0304-3975(00)00317-0 2003-11-19 Semigroups and Algebraic Engineering - Foreword. 1 2000 245 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#ItoN00 http://dx.doi.org/10.1016/S0304-3975(99)00272-8 2003-11-19 On Universality of Concurrent Expressions with Synchronization Primitives. 105-115 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#ItoN82 2003-11-19 Analogy Calculus. 211-230 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#YiX93 2003-11-19 Primitive 2-structures with the (n-2)-Property. 151-178 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Bonizzoni94 2006-03-14 Congruences, Infix and Cohesive Prefix Codes. 471-485 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#ItoT94 2003-11-19 A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM. 555-568 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Xue01 http://dx.doi.org/10.1016/S0304-3975(99)00326-6 2003-11-19 An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations. 157-169 1998 197 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs197.html#Xue98 http://dx.doi.org/10.1016/S0304-3975(97)00232-6 2003-11-19 On uncertainty versus size in branching programs. 1851-1867 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Zak03 2003-11-19 A Turing Machine Time Hierarchy. 327-333 1983 26 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#Zak83 2003-11-19 Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs. 249-265 1995 147 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#YuC95 http://dx.doi.org/10.1016/0304-3975(94)00220-D 2003-11-19 Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines. 357-378 1997 181 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#YuY97 http://dx.doi.org/10.1016/S0304-3975(96)00280-0 2003-11-19 An Intensional Characterization of the Largest Bisimulation. 335-343 1987 53 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#Hallnas87 2003-11-19 Partial Inductive Definitions. 115-142 1991 87 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Hallnas91 2003-11-19 A sublinear parallel algorithm for stable matching. 297-308 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#FederMP00 http://dx.doi.org/10.1016/S0304-3975(99)00125-5 2003-11-19 The Largest Tree in a Random Graph. 273-286 1983 23 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Marchetti-SpaccamelaP83 2003-11-19 Sur la Liaison Entre Problemes Combinatoires et Algorithmiques. 33-41 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#Vazenin81 2003-11-19 Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. 101-115 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#KaoW01 http://dx.doi.org/10.1016/S0304-3975(00)00183-3 2003-11-19 An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences. 35-49 1991 82 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs82.html#Hebrard91 2003-11-19 A Linear Algorithm for Renaming a Set of Clauses as a Horn Set. 343-350 1994 124 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Hebrard94 2003-11-19 Synchronizing finite automata on Eulerian digraphs. 223-232 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00405-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Kari03 2003-11-19 Kolmogorov complexity conditional to large integers. 59-67 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Vereshchagin02 http://dx.doi.org/10.1016/S0304-3975(01)00031-7 2003-11-19 Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms. 45-53 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Kari89 2003-11-19 Rice's Theorem for the Limit Sets of Cellular Automata. 229-254 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#Kari94 2003-11-19 Randomized Boolean Decision Trees: Several Remarks. 329-342 1998 207 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Vereshchagin98 http://dx.doi.org/10.1016/S0304-3975(98)00071-1 2003-11-19 Weak Logic Theory. 295-321 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Holden91 2003-11-19 An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine. 205-212 1991 85 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#Michel91 2003-11-19 A Survey of Space Complexity. 99-132 1992 101 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs101.html#Michel92 2003-11-19 On Conservative Extensions of Syntax in System Development. 209-233 1991 90 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#BlikleTT91 2003-11-19 A Short Proof of Representability of Fork Algebras. 211-220 1997 188 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs188.html#Gyuris97 http://dx.doi.org/10.1016/S0304-3975(96)00299-X 2003-11-19 On Time-Space Classes and their Relation to the Theory of Real Addition. 59-69 1980 11 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs11.html#BrussM80 2003-11-19 A k-Structure Generalization of the Theory of 2-Structures. 209-227 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#EhrenfeuchtM94 2003-11-19 Forbidding-enforcing systems. 611-638 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#EhrenfeuchtR03 2003-11-19 E0L Languages are not Codings of FP0L Languages. 327-341 1978 6 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs6.html#EhrenfeuchtR78 2003-11-19 Every Two Equivalent D0L Systems have a Regular True Envelope. 45-52 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#EhrenfeuchtR80 2003-11-19 On the Subword Complexity of Square-Free D0L Languages. 25-32 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#EhrenfeuchtR81 2003-11-19 Representation Theorems Using DOS Languages. 75-90 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#EhrenfeuchtR82 2003-11-19 Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. 277-303 1990 70 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#EhrenfeuchtR90 2003-11-19 Angular 2-Structures. 227-248 1992 92 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#EhrenfeuchtR92 2003-11-19 ⁿalgorithm for k-SAT based on local search. 69-83 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#DantsinGHKKPRS02 2003-11-19 Semantics of Distributed Definite Clause Programs. 203-220 1989 68 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#Ramanujam89 2003-11-19 A characterization of c.e. random reals. 3-14 2002 271 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Calude02 http://dx.doi.org/10.1016/S0304-3975(01)00027-5 2003-11-19 Relativized Topological Size of Sets of Partial Recursive Functions. 347-352 1991 87 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Calude91 2003-11-19 Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. 277-298 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#MaonSV86 2003-11-19 The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. 187-198 1981 16 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#RaihaU81 2003-11-19 Constant time parallel computations in lambda-calculus. 975-985 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Joly01 http://dx.doi.org/10.1016/S0304-3975(00)00380-7 2003-11-19 Near-Optimal, Distributed Edge Colouring via the Nibble Method. 225-251 1998 203 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#DubhashiGP98 http://dx.doi.org/10.1016/S0304-3975(98)00022-X 2004-11-22 Folding and tiling. 285-296 2004 322 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/j.tcs.2004.03.013 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Ch04 2003-11-19 An Approach to the Subgraph Homeomorphism Problem. 249-267 1985 38 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs38.html#Asano85 2004-02-03 Comparisons of Parikh's Condition to Other Conditions for Context-free Languages. 231-244 1998 202 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs202.html#Ramos-JimenezLM98 http://dx.doi.org/10.1016/S0304-3975(97)00262-4 2003-11-19 Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities. 39-70 1996 156 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs156.html#Kemp96 http://dx.doi.org/10.1016/0304-3975(95)00302-9 2003-11-19 No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs. 527-532 1994 136 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#KiwiNTC94 2003-11-19 Algebraic Structures in Categorial Grammar. 5-24 1998 199 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs199.html#Buszkowski98 http://dx.doi.org/10.1016/S0304-3975(97)00266-1 2003-11-19 Equations and Monoid Varieties of Dot-Depth One and Two. 239-258 1994 123 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#Blanchet-Sadri94 2003-11-19 Derivation lengths and order types of Knuth-Bendix orders. 433-450 2001 269 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs269.html#Lepper01 http://dx.doi.org/10.1016/S0304-3975(01)00015-9 2003-11-19 Moez Alimohamed, 1967-1994. 1-3 1995 146 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#ScedrovDZ95 2003-11-19 The Nielsen Reduction and P-Complete Problems in Free Groups. 61-76 1984 32 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs32.html#AvenhausM84 2003-11-19 Axiomatisation des Tests. 89-107 1985 35 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#Benoit85 2003-11-19 A Complete Equational Axiomatization for MPA with String Iteration. 339-374 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#AcetoG99 http://dx.doi.org/10.1016/S0304-3975(97)00182-5 2003-11-19 A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours. 251-268 1995 152 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#AcetoJ95 http://dx.doi.org/10.1016/0304-3975(94)00285-9 2003-11-19 SnS Can be Modally Characterized. 239-248 1990 74 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs74.html#Huttel90 2003-11-19 On probabilistic timed automata. 65-84 2003 292 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Beauquier03 2003-11-19 Generateurs Algebriques et Systemes de Paires Iterantes. 293-323 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Beauquier79 2003-11-19 Substitution of Semi-AFL'S. 187-193 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Beauquier81 2003-11-19 Minimal Automaton for a Factorial, Transitive and Rational Language. 65-73 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Beauquier89 2003-11-19 Two Distributed Problems Involving Byzantine Processes. 169-185 1992 95 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#Beauquier92 2003-11-19 Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. 175-201 1994 130 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#AlonKRS94 2003-11-19 Nested Annealing: A Provable Improvement to Simulated Annealing. 157-176 1992 99 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#RajasekaranR92 2003-11-19 Smaller solutions for the firing squad. 83-109 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#SettleS02 http://dx.doi.org/10.1016/S0304-3975(01)00191-8 2003-11-19 Which Kleene Semigroups are Finite? 251-264 1991 84 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#Rupert91 2003-11-19 Two Theorems Concerning Recognizable N-Subsets of sigma*. 317-323 1976 1 Theor. Comput. Sci. 4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs1.html#Karhumaki76 2003-11-19 <i>N</i>-Rational Series. 211-217 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#Karhumaki77 2003-11-19 On Commutative DT0L Systems. 207-220 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Karhumaki79 2003-11-19 The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids. 285-308 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Karhumaki84 2003-11-19 On Three-Element Codes. 3-11 1985 40 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs40.html#Karhumaki85 2003-11-19 Multiplicities: A Deterministsic View of Nondeterminism. 15-25 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Karhumaki92 2003-11-19 Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory. 103-118 1993 108 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Karhumaki93 2003-11-19 A Short Biography of Arto Salomaa. 3-5 1999 226 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs226.html#Karhumaki99 http://dx.doi.org/10.1016/S0304-3975(99)00060-2 2003-11-19 wMSO theories as grammar formalisms. 291-320 2003 293 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#Rogers03 2003-11-19 On the Syntax of Martin-Löf's Type Theories. 1-26 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Troelstra87 2003-11-19 From Constructivism to Computer Science. 233-252 1999 211 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs211.html#Troelstra99 http://dx.doi.org/10.1016/S0304-3975(97)00172-2 2003-11-19 A New Subsumption Method in the Connection Graph Proof Procedure. 283-309 1992 103 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#KimC92 2003-11-19 Multirate multicast switching networks. 241-251 2001 261 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs261.html#KimD01 http://dx.doi.org/10.1016/S0304-3975(00)00142-0 2003-11-19 HRNCE Grammars - a Hypergraph Generating System with an eNCE Way of Rewriting. 143-178 1999 223 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs223.html#KimJ99 http://dx.doi.org/10.1016/S0304-3975(99)00258-3 2003-11-19 Separating k-Separated eNCE Graph Languages. 247-259 1993 120 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#KimL93 2003-11-19 Leftmove-bounded picture languages. 183-195 2000 237 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#KimS00 http://dx.doi.org/10.1016/S0304-3975(98)00164-9 2003-11-19 The Membership and Equivalence Problems for Picture Languages. 177-191 1987 52 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs52.html#KimS87 2003-11-19 An Approximate String-Matching Algorithm. 107-117 1992 92 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#KimS92 2003-11-19 Iteration Theorems for Families of Strict Deterministic Languages. 317-333 1980 10 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#King80 2003-11-19 Alternating Multihead Finite Automata. 149-174 1988 61 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs61.html#King88 2003-11-19 Satisfiability Problems on Intervals and Unit Intervals. 349-372 1997 175 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#PeerS97 http://dx.doi.org/10.1016/S0304-3975(96)00208-3 2003-11-19 Algebraic testing and weight distributions of codes. 81-106 2003 1-3 Theor. Comput. Sci. 299 http://dx.doi.org/10.1016/S0304-3975(02)00816-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Kiwi03 2003-11-19 Approximation algorithms for maximum two-dimensional pattern matching. 51-62 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#ArikatiDLM01 http://dx.doi.org/10.1016/S0304-3975(99)00153-X 2003-11-19 Cartesian Closed Categories of Algebraic CPOs. 233-250 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Jung90 2003-11-19 The Dependent Product Construction in Various Categories of Domains. 359-363 1991 79 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Jung91 2003-11-19 0-1 Laws by Preservation. 237-245 1997 184 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs184.html#Lacoste97 http://dx.doi.org/10.1016/S0304-3975(97)00086-8 2003-11-19 Stabilizing Time-Adaptive Protocols. 93-111 1999 220 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#KuttenP99 http://dx.doi.org/10.1016/S0304-3975(98)00238-2 2003-11-19 Preface. 1 2003 291 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#KuttenS03 2003-11-19 Equivalence, Reduction and Minimization of Finite Automata over Semirings. 269-285 1991 88 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#Peeva91 2003-11-19 A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. 259-278 1982 17 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs17.html#AndrekaNS82a 2003-11-19 Preface. 219-221 2003 291 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#TinelliR03a 2003-11-19 A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score. 357-369 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Benson95 http://dx.doi.org/10.1016/0304-3975(95)92848-R 2003-11-19 Effectively closed sets and graphs of computable real functions. 279-318 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#CenzerR02 http://dx.doi.org/10.1016/S0304-3975(01)00069-X 2003-11-19 Index Sets in Computable Analysis. 111-150 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#CenzerR99 http://dx.doi.org/10.1016/S0304-3975(98)00286-2 2003-11-19 Une Démonstration Simple du Théorème de Skolem-Mahler-Lech. 91-98 1986 43 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Hansel86 2003-11-19 Systèmes de numération indépendants et syndéticité. 119-130 1998 204 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs204.html#Hansel98 http://dx.doi.org/10.1016/S0304-3975(98)00035-8 2003-11-19 On One-Way Functions and Polynomial-Time Isomorphisms. 263-276 1986 47 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#KoLD86 2003-11-19 An Improved Scheme for Set Equality Testing and Updating. 85-97 1998 201 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs201.html#LamL98 http://dx.doi.org/10.1016/S0304-3975(97)00024-8 2003-11-19 Forcing numbers of stop signs. 409-416 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00499-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#LamP03 2003-11-19 On Finite Semigroups of Matrices. 101-111 1977 5 2 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#MandelS77 2003-11-19 Foreword. 197 2002 284 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#KoNW02 http://dx.doi.org/10.1016/S0304-3975(01)00056-1 2003-11-19 Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. 23-52 1991 84 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#BrassardCY91 2003-11-19 On primitive recursive algorithms and the greatest common divisor function. 1-30 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00487-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Moschovakis03 2003-11-19 Computable Concurrent Processes. 243-273 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Moschovakis95 http://dx.doi.org/10.1016/0304-3975(94)00117-2 2003-11-19 New Curry-Howard Terms for Full Linear Logic. 217-235 1997 185 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#AlbrechtCJ97 http://dx.doi.org/10.1016/S0304-3975(97)00044-3 2003-11-19 Termination of term rewriting using dependency pairs. 133-178 2000 236 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs236.html#ArtsG00 http://dx.doi.org/10.1016/S0304-3975(99)00207-8 2003-11-19 Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. 57-74 1997 181 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#Fernandez-BacaS97 http://dx.doi.org/10.1016/S0304-3975(96)00262-9 2003-11-19 Complexity, Convexity and Combinations of Theories. 291-302 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Oppen80 2003-11-19 On the number of hexagonal polyominoes. 433-453 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00229-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#VogeG03 2003-11-19 On the simulation of quantum turing machines. 103-128 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00054-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Carpentieri03 2003-11-19 Nonapplicable Nulls. 67-82 1986 46 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#LeratL86 2003-11-19 Enumerating all connected maximal common subgraphs in two graphs. 1-30 2001 250 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs250.html#Koch01 http://dx.doi.org/10.1016/S0304-3975(00)00286-3 2003-11-19 Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming. 157-215 1990 75 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#Devienne90 2003-11-19 Internal Languages for Autonomous and *-Autonomous Categories. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#KohO99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 Contractions in Comparing Concurrency Semantics. 179-222 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#KokR90 2003-11-19 Honest Polynomial Degrees and P=?NP. 265-280 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#HomerL87 2003-11-19 Oracle-Dependent Properties of the Lattice of NP Sets. 279-289 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#HomerM83 2006-04-19 On the competitiveness of the move-to-front rule. 313-325 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#MartinezR00 http://dx.doi.org/10.1016/S0304-3975(98)00264-3 2003-11-19 Tautology Testing with a Generalized Matrix Reduction Method. 31-44 1979 8 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs8.html#Bibel79 2003-11-19 Topological adjacency relations on Zn. 3-28 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#Kong02 http://dx.doi.org/10.1016/S0304-3975(01)00050-0 2003-11-19 ⁿwhose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets. 221-235 2003 305 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/S0304-3975(02)00710-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Kong03 2003-11-19 Approximate evaluations of characteristic polynomials of Boolean functions. 37-68 2001 262 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#LeeW01 http://dx.doi.org/10.1016/S0304-3975(00)00151-1 2003-11-19 Weakly Adaptive Comparison Searching. 105-111 1989 66 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#Pelc89a 2003-11-19 Generating and characterizing the perfect elimination orderings of a chordal graph. 303-317 2003 307 Theor. Comput. Sci. 2 http://dx.doi.org/10.1016/S0304-3975(03)00221-4 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#ChandranIRS03 2003-11-19 Sums and Rational Multiples of q-Automatic Sequences are q-Automatic. 385-391 1993 108 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#Lehr93 2003-11-19 On Projective and Separable Properties. 135-156 1997 186 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs186.html#Peled97 http://dx.doi.org/10.1016/S0304-3975(96)00225-3 2003-11-19 Local majorities, coalitions and monopolies in graphs: a review. 231-257 2002 282 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#Peleg02 http://dx.doi.org/10.1016/S0304-3975(01)00055-X 2003-11-19 Concurrent Program Schemes and Their Logics. 1-45 1987 55 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs55.html#Peleg87 2003-11-19 On the complexity of coordinated display of multimedia objects. 169-197 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Escobar-MolanoG00 http://dx.doi.org/10.1016/S0304-3975(98)00217-5 2003-11-19 Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs. 213-230 1992 99 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Nummenmaa92 2003-11-19 Hierarchical structures in Sturmian dynamical systems. 463-490 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(03)00207-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Lenz03 2003-11-19 Declarative Debugging of Functional Logic Programs. 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#AlpuenteCF01 2003-11-19 Size Bounds for Superconcentrators. 233-251 1983 22 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs22.html#LevV83 2003-11-19 A Recursive and a Grammatical Characterization of the Exponential-Time Languages. 61-74 1976 3 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs3.html#Monien76 2003-11-19 Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms. 97-108 1980 12 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Monier80 2003-11-19 Incremental Constraint Satisfaction for Equational Logic Programming. 27-57 1995 142 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#AlpuenteFL95 http://dx.doi.org/10.1016/0304-3975(94)00224-7 2003-11-19 A Compositional µ-Calculus Proof System for Statecharts Processes. 271-310 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#Levi99 http://dx.doi.org/10.1016/S0304-3975(97)00245-4 2003-11-19 A Compositional Semantic Basis for the Analysis of Equational Horn Programs. 133-169 1996 165 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#AlpuenteFV96 http://dx.doi.org/10.1016/0304-3975(96)00043-6 2003-11-19 <i>lambda beta</i><i>lambda</i>-Calculus. 97-114 1976 2 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Levy76 2003-11-19 An ordinal measure based procedure for termination of functions. 63-94 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#MoninS01 http://dx.doi.org/10.1016/S0304-3975(99)00118-8 2003-11-19 On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. 43-61 1989 63 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs63.html#Ambos-Spies89 2003-11-19 On Sparse Hard Sets for Counting Classes. 255-275 1993 112 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#OgiwaraL93 2003-11-19 k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion. 97-112 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#ManabeBRA98 http://dx.doi.org/10.1016/S0304-3975(97)00303-4 2003-11-19 Fair Petri Nets and Structural Induction for Rings of Processes. 377-404 1994 135 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs135.html#LiSY94 2003-11-19 On Interleaving Behaviour of PT-Nets. 25-38 1989 64 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#JojczykKK89 2003-11-19 Some Examples of Formal Series Used in Non-Commutative Algebra. 111-135 1991 79 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs79.html#Krob91 2003-11-19 A Constraint Logic Programming Framwork in 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#FerreiraA99 2003-11-19 Approximate string matching using factor automata. 305-311 2000 249 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#HolubM00 http://dx.doi.org/10.1016/S0304-3975(00)00064-5 2003-11-19 Randomized Routing on Generalized Hypercubes. 53-64 1996 158 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#FerreiraG96 http://dx.doi.org/10.1016/0304-3975(95)00041-0 2003-11-19 A Behavioural Theory of First-Order CML. 55-107 1999 216 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs216.html#FerreiraH99 http://dx.doi.org/10.1016/S0304-3975(98)00049-8 2003-11-19 Exponentiation Using Canonical Recoding. 407-417 1994 129 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#EgeciogluK94 2003-11-19 Foreword to the Special Issue on Parallelism. 171-172 1996 162 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#FerreiraR96 2003-11-19 Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. 81-84 1987 49 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#GuibasSC87 2003-11-19 Bisimulations in the join-calculus. 569-603 2001 266 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#FournetL01 http://dx.doi.org/10.1016/S0304-3975(00)00283-8 2003-11-19 On the parametric complexity of schedules to minimize tardy tasks. 317-324 2003 2 Theor. Comput. Sci. 298 http://dx.doi.org/10.1016/S0304-3975(02)00811-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#FellowsM03 2003-11-19 Finite-Valued Distance Automata. 225-251 1994 134 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs134.html#Weber94 2003-11-19 A space-efficient Huffman decoding algorithm and its parallelism. 227-238 2000 246 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs246.html#LinC00 http://dx.doi.org/10.1016/S0304-3975(99)00080-8 2003-11-19 Towards area requirements for drawing hierarchically planar graphs. 679-695 2003 292 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#LinE03 2003-11-19 Equality and Abductive Residua for Horn Clauses. 1-44 1993 120 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#KnillCP93 2003-11-19 Signed genome rearrangement by reversals and transpositions: models and approximations. 513-531 2001 259 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#LinX01 http://dx.doi.org/10.1016/S0304-3975(00)00038-4 2003-11-19 <i>K</i><i>K</i>-Median Problems in Graded Distances. 181-192 1998 207 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#LinX98 http://dx.doi.org/10.1016/S0304-3975(98)00063-2 2003-11-19 An omega-automata approach to the compression of bi-level images. 2000 31 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#LinY00 http://www.elsevier.nl/locate/entcs/volume31.html 2003-11-19 On categorical equivalence of Gentzen-style derivations in IMLL. 245-260 2003 1 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00454-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#SolovievO03 2003-11-19 A Generalized Setting for Fixpoint Theory. 243-256 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#AshcroftF79 2003-11-19 Verification, refinement and scheduling of real-time programs. 119-152 2001 253 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs253.html#LiuJ01 http://dx.doi.org/10.1016/S0304-3975(00)00091-8 2003-11-19 Verification of Reactive Systems Using Temporal Logic with Clocks. 377-408 1999 220 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#LiuO99 http://dx.doi.org/10.1016/S0304-3975(99)00008-0 2003-11-19 Partial Confluence of Proceses and Systems of Objects. 127-162 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#LiuW98 http://dx.doi.org/10.1016/S0304-3975(97)00111-4 2003-11-19 On the expressiveness of linear-constraint query languages for spatial databases. 423-463 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#VandeurzenGG01 http://dx.doi.org/10.1016/S0304-3975(99)00316-3 2003-11-19 An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems. 221-227 1987 51 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Vyskoc87 2003-11-19 Corrigendum: An O(n^lgk . 2^n/2) Time and O(k . 2^n/2) Space Algorithm for Certain NP-Complete Problems. 273-274 1990 70 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Vyskoc90 2003-11-19 Computing similarity between RNA structures. 111-132 2002 276 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#MaWZ02 http://dx.doi.org/10.1016/S0304-3975(01)00192-X 2003-11-19 A True Concurrency Model of CCS Semantics. 231-258 1993 113 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#Ruqian93 2003-11-19 An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives. 1-20 1983 24 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#Wedde83 2003-11-19 The Computational Complexity of Universal Hashing. 121-133 1993 107 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#MansourNT93 2003-11-19 Effective Properties of Sets and Functions in Metric Spaces with Computability Structure. 467-486 1999 219 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#YasugiMT99 http://dx.doi.org/10.1016/S0304-3975(98)00301-6 2003-11-19 Specifying coalgebras with modal logic. 119-138 2001 260 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs260.html#Kurz01 http://dx.doi.org/10.1016/S0304-3975(00)00125-0 2003-11-19 Sparse NP-complete problems over the reals with addition. 607-610 2001 255 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#Fournier01 http://dx.doi.org/10.1016/S0304-3975(00)00203-6 2003-11-19 Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. 333-351 2003 2-3 Theor. Comput. Sci. 303 http://dx.doi.org/10.1016/S0304-3975(02)00496-6 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Fournier03 2003-11-19 Pavage des figures planes sans trous par des dominos: Fondement graphique de l'algorithme de Thurston, parallélisation, unicité et décomposition. 105-128 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Fournier96 http://dx.doi.org/10.1016/0304-3975(95)00204-9 2003-11-19 Decidability of the Restriction Equational Theory in the Partial Lambda Calculus. 129-139 1989 67 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Perez89 2003-11-19 More on morphisms and almost-periodicity. 205-215 2000 231 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#Maes00 http://dx.doi.org/10.1016/S0304-3975(99)00101-2 2003-11-19 On the Complexity of Edge Labelings for Trees. 1-16 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#PerlZ82 2003-11-19 Optimization of Static Traffic Allocation Policies. 17-43 1994 125 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#CombeB94 2003-11-19 Fixpoint operators for domain equations. 323-333 2002 278 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#PowerR02 http://dx.doi.org/10.1016/S0304-3975(00)00341-8 2003-11-19 A Coalgebraic Foundation for Linear Time Semantics. 1999 29 Electr. Notes Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#PowerT99 http://www.elsevier.nl/locate/entcs/volume29.html 2003-11-19 A Pumping Lemma for Real-Time Deterministic Context-Free Languages. 89-97 1985 36 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Igarashi85 2003-11-19 Combining a monad and a comonad. 137-162 2002 280 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#PowerW02 http://dx.doi.org/10.1016/S0304-3975(01)00024-X 2003-11-19 Complete Proof Rules for Strong Fairness and Strong Extreme Fairness. 125-143 1993 111 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs111.html#Main93 2003-11-19 The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 111-145 1995 145 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#Creignou95 http://dx.doi.org/10.1016/0304-3975(94)00182-I 2003-11-19 Covers and Fans of Polynomial Ideals. 167-178 1997 187 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Mall97 http://dx.doi.org/10.1016/S0304-3975(97)00063-7 2003-11-19 On the Computational Power of Dynamical Systems and Hybrid Systems. 417-459 1996 168 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#BournezC96 http://dx.doi.org/10.1016/S0304-3975(96)00086-2 2003-11-19 On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages. 105-107 1985 41 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Maon85 2003-11-19 Reversible Simulation of Space-Bounded Computations. 159-165 1995 143 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#CrescenziP95 http://dx.doi.org/10.1016/0304-3975(95)80031-4 2003-11-19 Strictly-upward Drawings of Ordered Search Trees. 51-67 1998 203 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#CrescenziP98 http://dx.doi.org/10.1016/S0304-3975(97)00287-9 2003-11-19 On the Hamming distance of constraint satisfaction problems. 85-100 2002 288 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#CrescenziR02 2003-11-19 On Reduction-Based Process Semantics. 437-486 1995 151 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#HondaY95 http://dx.doi.org/10.1016/0304-3975(95)00074-7 2003-11-19 Game-Theoretic Analysis of Call-by-Value Computation. 393-456 1999 221 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs221.html#HondaY99 http://dx.doi.org/10.1016/S0304-3975(99)00039-0 2003-11-19 Max NP-completeness Made Easy. 65-79 1999 225 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#CrescenziT99 http://dx.doi.org/10.1016/S0304-3975(98)00200-X 2003-11-19 Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. 683-690 2001 254 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#LeveneL01 http://dx.doi.org/10.1016/S0304-3975(00)00394-7 2003-11-19 Axiomatisation of Functional Dependencies in Incomplete Relations. 283-300 1998 206 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#LeveneL98 http://dx.doi.org/10.1016/S0304-3975(98)80029-7 2003-11-19 Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. 1-70 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#Matz02 http://dx.doi.org/10.1016/S0304-3975(01)00277-8 2003-11-19 Multi-head finite automata: data-independent versus data-dependent computations. 97-116 2002 286 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Holzer02 http://dx.doi.org/10.1016/S0304-3975(01)00237-7 2003-11-19 The asymptotic distribution of elements in automatic sequences. 285-312 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00587-X http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#Peter03 2003-11-19 Threshold counters with increments and decrements. 811-826 2002 270 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#BuschDHM02 http://dx.doi.org/10.1016/S0304-3975(01)00113-X 2003-11-19 Decidability of model checking with the temporal logic EF. 31-62 2001 256 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#Mayr01 http://dx.doi.org/10.1016/S0304-3975(00)00101-8 2003-11-19 Undecidable problems in unreliable computations. 337-354 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00646-1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#Mayr03 2003-11-19 Distribution and Synchronized Automata. 285-308 1990 76 Theor. Comput. Sci. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#Petit90 2003-11-19 Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. 75-85 1984 29 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#Frederickson84 2003-11-19 Parameterized Circuit Complexity and the W Hierarchy. 97-115 1998 191 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#DowneyFR98 http://dx.doi.org/10.1016/S0304-3975(96)00317-9 2003-11-19 On the Logic of UNITY. 27-67 1995 139 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Pappinghaus95 http://dx.doi.org/10.1016/0304-3975(94)00043-I 2003-11-19 Nets, Time and Space. 3-48 1996 153 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#Petri96 http://dx.doi.org/10.1016/0304-3975(95)00116-6 2003-11-19 Note on Optimal Gossiping in Some Weak-Connected Graphs. 395-402 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#HromkovicJM94 2003-11-19 Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. 123-147 1994 127 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#HromkovicKK94 2004-07-01 Attibute Grammars are Useful for Combinatorics. 65-76 1992 98 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#DelestF92 2003-11-19 Algebraic Languages and Polyominoes Enumeration. 169-206 1984 34 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#DelestV84 2003-11-19 Size of Ordered Binary Decision Diagrams Representing Threshold Functions. 47-60 1997 180 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#HosakaTKY97 http://dx.doi.org/10.1016/S0304-3975(97)83807-8 2003-11-19 Tolerating Faults in a Mesh with a Row of Spare Nodes. 241-252 1994 128 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#BruckCH94 2003-11-19 Periodic graphs and connectivity of the rational digital hyperplanes. 171-182 2002 283 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#Gerard02 http://dx.doi.org/10.1016/S0304-3975(01)00063-9 2003-11-19 "Deco" Polyominoes, Permutations and Random Generation. 29-42 1996 159 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#BarcucciLP96 http://dx.doi.org/10.1016/0304-3975(95)00199-9 2003-11-19 Random Generation of Trees and Other Combinatorial Objects. 219-232 1999 218 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs218.html#BarcucciLP99 http://dx.doi.org/10.1016/S0304-3975(98)00322-3 2003-11-19 Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. 319-336 1994 132 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#HromkovicRS94 2003-11-19 Improved bounds about on-line learning of smooth-functions of a single variable. 25-35 2000 241 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#Long00 http://dx.doi.org/10.1016/S0304-3975(99)00264-9 2003-11-19 On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. 91-101 1981 14 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#Long81 2003-11-19 Strong Nondeterministic Polynomial-Time Reducibilities. 1-25 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Long82 2003-11-19 On Group Codes. 259-267 1996 163 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs163.html#Long96 http://dx.doi.org/10.1016/0304-3975(95)00238-3 2003-11-19 The Random Generation of Directed Animals. 333-350 1994 127 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#BarcucciPS94 2003-11-19 Counting problems over the reals. 41-58 2000 242 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Meer00 http://dx.doi.org/10.1016/S0304-3975(98)00190-X 2003-11-19 On the Complexity of Quadratic Programming in Real Number Models of Computation. 85-84 1994 133 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs133.html#Meer94 2003-11-19 Algebraic rewritings for optimizing regular path queries. 453-471 2003 3 Theor. Comput. Sci. 296 http://dx.doi.org/10.1016/S0304-3975(02)00739-9 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#GrahneT03 2003-11-19 List Scheduling in the Presence of Branches: A Theoretical Evaluation. 347-363 1998 196 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#GasperoniS98 http://dx.doi.org/10.1016/S0304-3975(97)00207-7 2003-11-19 A Space Bound for One-Tape Multidimensional Turing Machines. 311-320 1981 15 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Loui81 2003-11-19 Simulations Among Multidimensional Turing Machines. 145-161 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Loui82 2003-11-19 Algebraic Approach to Single-Pushout Graph Transformation. 181-224 1993 109 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#Lowe93 2003-11-19 Probabilistic and Prioritized Models of Timed CSP. 315-352 1995 138 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#Lowe95 http://dx.doi.org/10.1016/0304-3975(94)00171-E 2003-11-19 Translations Between Modal Logics of Reactive Systems. 53-71 1995 140 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs140.html#LaroussiniePS95 http://dx.doi.org/10.1016/0304-3975(94)00204-V 2003-11-19 Mechanizing Structural Induction Part I: Formal System. 329-345 1979 9 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Aubin79 2003-11-19 Marvellous Interpretations Differ Little but Decisively from Ordinary Interpretations of EOL Forms. 163-178 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Ainhirn82 2003-11-19 On the expressivity and complexity of quantitative branching-time temporal logics. 297-315 2003 1-3 Theor. Comput. Sci. 297 http://dx.doi.org/10.1016/S0304-3975(02)00644-8 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#LaroussinieST03 2003-11-19 Intersection types for lambda-trees. 3-40 2002 272 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#BakelBDV02 http://dx.doi.org/10.1016/S0304-3975(00)00346-7 2003-11-19 The N U System as a Development System for Concurrent Programs: delta N U. 311-334 1992 94 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Mery92 2003-11-19 Detecting equivalence of modular specifications with categorical diagrams. 141-190 2000 247 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#Oriat00 http://dx.doi.org/10.1016/S0304-3975(98)00232-1 2003-11-19 Swinging types=functions+relations+transition systems. 93-165 2000 243 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Padawitz00 http://dx.doi.org/10.1016/S0304-3975(00)00171-7 2003-11-19 Graph Grammars and Operational Semantics. 117-141 1982 19 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs19.html#Padawitz82 2003-11-19 Systolic tree omega-Languages: the operational and the logical view. 1-18 2000 233 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#MontiP00 http://dx.doi.org/10.1016/S0304-3975(97)00257-0 2003-11-19 Equational Unification, Word Unification, and 2nd-Order Equational Unification. 1-47 1998 198 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#OttoND98 http://dx.doi.org/10.1016/S0304-3975(97)00130-8 2003-11-19 Low Complexity Aggregation in GraphLog and Datalog. 95-116 1993 116 Theor. Comput. Sci. 1&2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs116.html#ConsensM93 2003-11-19 Notes on the Methodology of CCS and CSP. 329-349 1997 177 Theor. Comput. Sci. 2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#Glabbeek97 http://dx.doi.org/10.1016/S0304-3975(96)00251-4 2003-11-19 On-line scheduling with tight deadlines. 251-261 2003 1-3 Theor. Comput. Sci. http://dx.doi.org/10.1016/S0304-3975(02)00407-3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#KooLNST03 2003-11-19 Finding the shortest boundary guard of a simple polygon. 113-121 2001 263 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#LuHT01 http://dx.doi.org/10.1016/S0304-3975(00)00235-8 2003-11-19 Sorting with two ordered stacks in series. 205-223 2002 289 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#AtkinsonR02 2003-11-19 Bounded Capacity Priority Queues. 145-157 1997 182 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#AtkinsonT97 http://dx.doi.org/10.1016/S0304-3975(96)00149-1 2003-11-19 A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. 101-112 1990 73 Theor. Comput. Sci. 1 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#HuwigP90 2003-11-19 The Maximum Flow Problem is Log Space Complete for P. 105-111 1982 21 Theor. Comput. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#GoldschlagerSS82 2003-11-19 Deterministic broadcasting time with partial knowledge of the network. 2009-2020 2003 290 Theor. Comput. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#MarcoP03 2003-11-19 A Nim game played on graphs. 387-399 2003 1-3 Theor. Comput. Sci. 304 http://dx.doi.org/10.1016/S0304-3975(03)00292-5 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#Fukuyama03 2003-11-19 Circumscribing DATALOG: Expressive Power and Complexity. 215-244 1998 193 Theor. Comput. Sci. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs193.html#CadoliP98 http://dx.doi.org/10.1016/S0304-3975(97)00108-4 2003-11-19 Efficient minus and signed domination in graphs. 381-397 2003 1-3 Theor. Comput. Sci. 301 http://dx.doi.org/10.1016/S0304-3975(02)00594-7 http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#LuPT03