2003-11-19
Comment Verifier l'Associativite d'une Table de Groupe.
77-82
1977
4
1
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#Vuillemin77
2003-11-19
Inheritance of workflows: an approach to tackling problems related to change.
125-203
2002
270
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs270.html#AalstB02
http://dx.doi.org/10.1016/S0304-3975(00)00321-2
2003-11-19
Buchberger's Algorithm: The Term Rewriter's Point of View.
143-190
1996
159
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs159.html#Bundgen96
http://dx.doi.org/10.1016/0304-3975(95)00061-5
2003-11-19
Representation of Functional Dependencies in Relational Databases Using Linear Graphs.
143-159
1983
24
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#NambiarRT83
2003-11-19
Preface.
1
2002
286
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs286.html#Ruzicka02
http://dx.doi.org/10.1016/S0304-3975(01)00231-6
2003-11-19
<i>(k)</i>Grammars and Languages.
245-276
1977
4
3
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs4.html#GellerH77
2003-11-19
Accurate program analyses for successful specialization of legacy system software.
201-210
2000
248
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs248.html#MullerMV00
http://dx.doi.org/10.1016/S0304-3975(00)00052-9
2003-11-19
Affine Scheduling on Bounded Convex Polyhedric Domains is Asymptotically Optimal.
395-415
1998
196
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#dArgence98
http://dx.doi.org/10.1016/S0304-3975(97)00209-0
2003-11-19
Unit-Cost Pointers versus Logarithmic-Cost Addresses.
377-385
1994
132
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#Ben-Amram94
2003-11-19
Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes.
303-332
1989
67
Theor. Comput. Sci.
2&3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#Kirchner89
2003-11-19
To Prof. Dr. Wolfgang Wechler.
4-5
1992
105
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs105.html#Kirchner92
2003-11-19
Editorial.
139-140
1995
142
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#Kirchner95
http://dx.doi.org/10.1016/0304-3975(94)00273-8
2003-11-19
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity.
233-244
1992
97
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#MullerSS92
2003-11-19
An Algorithm for Dynamic Subset and Intersection Testing.
397-406
1994
129
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Yellin94
2003-11-19
One-Way Simple Multihead Finite Automata.
311-328
1979
9
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#InoueTNA79
2003-11-19
A Semantics for Modular General Logic Programs.
51-80
1998
206
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Etalle98
http://dx.doi.org/10.1016/S0304-3975(97)00191-6
2003-11-19
A new logic for electronic commerce protocols.
223-283
2003
291
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#AdiDM03
2003-11-19
Two-Dimensional Alternating Turing Machines.
61-83
1983
27
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#InoueTT83a
2003-11-19
Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic.
185-197
1995
146
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#BerghammerES95
http://dx.doi.org/10.1016/0304-3975(94)00184-K
2003-11-19
Computable Identities in the Algebra of Formal Matrices.
115-133
1992
98
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#Mourrain92
2003-11-19
On Pi_2 Theories of hp-T Degrees of Low Sets.
315-327
1994
123
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs123.html#AokiST94
2003-11-19
Emerging behavior as binary search trees are symmetrically updated.
425-445
2003
1-3
Theor. Comput. Sci.
297
http://dx.doi.org/10.1016/S0304-3975(02)00651-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#TaylorD03
2003-11-19
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
277-291
1986
43
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#SuzukiMTKO86
2003-11-19
Resolution lower bounds for the weak functional pigeonhole principle.
233-243
2003
1
Theor. Comput. Sci.
303
http://dx.doi.org/10.1016/S0304-3975(02)00453-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#Razborov03
2003-11-19
On the Distributional Complexity of Disjointness.
385-390
1992
106
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#Razborov92
2006-10-31
Pascal in LCF: Semantics and Examples of Proof.
135-177
1977
5
2
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs5.html#AielloAW77
2003-11-19
Process versus Unfolding Semantics for Place/Transition Petri Nets.
171-210
1996
153
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs153.html#MeseguerMS96
http://dx.doi.org/10.1016/0304-3975(95)00121-2
2003-11-19
Operational Semantics of a Kernel of the Language ELECTRE.
83-103
1992
97
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#PerraudRH92
2003-11-19
On a simple sampling lemma.
2000
31
Electr. Notes Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs31.html#GartnerW00
http://www.elsevier.nl/locate/entcs/volume31.html
2003-11-19
On-Line Matching Routing on Trees.
469-488
1999
220
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#RobertsS99
http://dx.doi.org/10.1016/S0304-3975(99)00010-9
2003-11-19
On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search.
251-275
1995
144
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs144.html#Schachinger95
http://dx.doi.org/10.1016/0304-3975(94)00306-4
2003-11-19
A solution to the GHI problem for best-first search.
121-149
2001
252
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs252.html#BreukerHUA01
http://dx.doi.org/10.1016/S0304-3975(00)00079-7
2003-11-19
Asymptotic Properties of Keys and Functional Dependencies in Random Databases.
151-166
1998
190
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs190.html#DemetrovicsKMST98
http://dx.doi.org/10.1016/S0304-3975(97)00089-3
2003-11-19
On feasible cases of checking multi-agent systems behavior.
63-81
2003
1
Theor. Comput. Sci.
303
http://dx.doi.org/10.1016/S0304-3975(02)00445-0
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#DekhtyarDV03
2003-11-19
The Complexity of the Word Problem for Abelian l-Groups.
127-132
1986
48
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs48.html#Weispfenning86
2003-11-19
Some results on tries with adaptive branching.
1009-1026
2002
289
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#Reznik02
2003-11-19
A Bridge Between Constructive Logic and Computer Programming.
253-270
1991
90
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Nepejvoda91
2003-11-19
Extensions and submonoids of automatic monoids.
727-754
2002
289
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#SilvaS02
2003-11-19
Formal systems for gene assembly in ciliates.
199-219
2003
292
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#EhrenfeuchtHPPR03
2003-11-19
Preference Structures and Their Numerical Representations.
359-383
1999
217
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs217.html#Fishburn99
http://dx.doi.org/10.1016/S0304-3975(98)00277-1
2003-11-19
A General Conservative Extension Theorem in Process Algebras with Inequalities.
351-380
1997
177
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#DArgenioV97
http://dx.doi.org/10.1016/S0304-3975(96)00292-7
2003-11-19
Inductively Inferring Valid Logical Models of Continuous-State Dynamical Systems.
201-210
1995
138
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs138.html#LemmonA95
http://dx.doi.org/10.1016/0304-3975(94)00148-C
2003-11-19
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.
267-287
1997
181
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs181.html#DiazGPSST97
http://dx.doi.org/10.1016/S0304-3975(96)00274-5
2003-11-19
Noisy Inference and Oracles.
129-157
1997
185
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs185.html#Stephan97
http://dx.doi.org/10.1016/S0304-3975(97)00018-2
2003-11-19
Smoothness prior approach to explore mean structure in large-scale time series.
431-446
2003
292
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#KitagawaHK03
2003-11-19
The regular spaces with countably based models.
299-310
2003
305
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(02)00700-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs305.html#Martin03a
2003-11-19
Lifting in Z.
2001
42
Electr. Notes Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs42.html#MartinF01
http://www.elsevier.nl/locate/entcs/volume42.html
2003-11-19
<i>F</i>.
303-320
1988
56
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Martino88
2003-11-19
On the Complementation of Asynchronous Cellular Büchi Automata.
123-145
1996
169
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs169.html#Muscholl96
http://dx.doi.org/10.1016/S0304-3975(96)00117-X
2003-11-19
Computational complexity of uniform quantum circuit families and quantum Turing machines.
147-181
2002
276
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#NishimuraO02
http://dx.doi.org/10.1016/S0304-3975(01)00111-6
2003-11-19
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
51-64
2002
279
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs279.html#LesterCL02
http://dx.doi.org/10.1016/S0304-3975(00)00426-6
2003-11-19
The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order.
177-184
1999
225
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs225.html#Gobel99
http://dx.doi.org/10.1016/S0304-3975(98)00340-5
2003-11-19
Conditional Rewrite Rules.
175-193
1984
33
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs33.html#Kaplan84
2003-11-19
Rewriting with a Nondeterministic Choice Operator.
37-57
1988
56
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Kaplan88
2003-11-19
Algebraic Specification of Concurrent Systems.
69-115
1989
69
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#Kaplan89
2003-11-19
On an optimal propositional proof system and the structure of easy subsets of TAUT.
181-193
2002
288
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs288.html#Sadowski02
2003-11-19
A More Complete Model of Communicating Processes.
105-120
1983
26
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#HehnerH83
2003-11-19
A Remark on the Length Problem.
243-248
1988
56
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs56.html#Mohrherr88
2003-11-19
Logically Defined Subsets of N k.
169-183
1992
93
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Peladeau92
2003-11-19
A comparison of Statecharts step semantics.
465-498
2003
290
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#Maggiolo-SchettiniPT03
2003-11-19
Cellular automata and strongly irreducible shifts of finite type.
477-493
2003
1-3
Theor. Comput. Sci.
299
http://dx.doi.org/10.1016/S0304-3975(02)00492-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#Fiorenzi03
2003-11-19
Modeling a Solution for a Control Problem in Distributed Systems by Restrictions.
61-83
1981
13
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Maggiolo-SchettiniWW81
2003-11-19
Games for synthesis of controllers with partial observation.
7-34
2003
1
Theor. Comput. Sci.
303
http://dx.doi.org/10.1016/S0304-3975(02)00442-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs303.html#ArnoldVW03
2003-11-19
On the bottleneck counting argument.
429-437
2000
237
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#SimonT00
http://dx.doi.org/10.1016/S0304-3975(99)00321-7
2003-11-19
On Meije and SCCS: Infinite Sum Operators VS. Non-Guarded Definitions.
133-138
1984
30
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs30.html#Simone84
2003-11-19
Higher-Level Synchronising Devices in Meije-SCCS.
245-267
1985
37
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Simone85
2003-11-19
On-Line Computation of Minimal and Maximal Length Paths.
245-261
1992
95
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs95.html#AusielloIMN92
2003-11-19
A Total AC-Compatible Ordering Based on RPO.
209-227
1995
142
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#RubioN95
http://dx.doi.org/10.1016/0304-3975(94)00276-2
2003-11-19
On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux.
1-28
1994
131
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs131.html#MurrayR94
2003-11-19
mu -Recursion and infinite limits.
123-133
2003
1-3
Theor. Comput. Sci.
302
http://dx.doi.org/10.1016/S0304-3975(02)00744-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#Mycka03
2003-11-19
Computing Minimal Models by Partial Instantiation.
157-177
1996
155
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs155.html#KaganNS96
http://dx.doi.org/10.1016/0304-3975(94)00216-9
2003-11-19
Infinity-Regular Temporal Logic and its Model Checking Problem.
191-204
1992
103
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#HamaguchiHY92
2003-11-19
Subtractive logic.
151-185
2001
254
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#Crolard01
http://dx.doi.org/10.1016/S0304-3975(99)00124-3
2003-11-19
On Compact Representations of Propositional Circumscription.
183-202
1997
182
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs182.html#CadoliDSS97
http://dx.doi.org/10.1016/S0304-3975(96)00182-X
2003-11-19
Computing Functions with Parallel Queries to NP.
175-193
1995
141
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#JennerT95
http://dx.doi.org/10.1016/0304-3975(94)00080-3
2003-11-19
Fast asynchronous systems in dense time.
379-422
2001
254
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs254.html#JennerV01
http://dx.doi.org/10.1016/S0304-3975(99)00304-7
2003-11-19
Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming.
225-256
1993
109
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs109.html#MontanariR93
2003-11-19
Two-sorted Metric Temporal Logics.
187-214
1997
183
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs183.html#MontanariR97
http://dx.doi.org/10.1016/S0304-3975(96)00324-6
2003-11-19
Sofic Shifts with Synchronizing Presentations.
81-115
1996
158
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs158.html#Jonoska96
http://dx.doi.org/10.1016/0304-3975(96)00058-8
2003-11-19
An Algorithm to Decide Whether a Rational Subset of N^k is Recognizable.
51-59
1985
41
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Gohon85
2003-11-19
Location Equivalence in Parametric Setting.
299-332
1995
149
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html#MontanariY95
http://dx.doi.org/10.1016/0304-3975(94)00219-9
2003-11-19
Complexity of the Combinator Reduction Machine.
289-303
1985
41
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Hirokawa85
2003-11-19
Principal Types of BCK-lambda-Terms.
253-276
1993
107
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#Hirokawa93
2003-11-19
Infiniteness of Proof(alpha) is Polynomial-Space Complete.
331-339
1998
206
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#Hirokawa98
http://dx.doi.org/10.1016/S0304-3975(97)00168-0
2003-11-19
Temporal Aspects of the Modal Logic of Subset Spaces.
135-155
1999
224
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Heinemann99
http://dx.doi.org/10.1016/S0304-3975(98)00310-7
2003-11-19
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton.
69-87
1999
215
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#ZiadiC99
http://dx.doi.org/10.1016/S0304-3975(97)00131-X
2003-11-19
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.
245-281
1996
162
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs162.html#HeideSS96
http://dx.doi.org/10.1016/0304-3975(96)00032-1
2003-11-19
Routing on Networks of Optical Crossbars.
181-200
1998
196
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#HeideSS98
http://dx.doi.org/10.1016/S0304-3975(97)86791-6
2003-11-19
About the Implementability and the Power of Equationally Defined Data Abstractions.
305-315
1981
14
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs14.html#CallegarinP81
2003-11-19
Linear Analysis of Genetic Algorithms.
101-134
1998
200
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#SchmittNF98
http://dx.doi.org/10.1016/S0304-3975(98)00004-8
2003-11-19
A Compete Modal Proof for HAL: the Herbrand Agent Language.
127-143
1993
119
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Habbas93
2003-11-19
New types of automata to solve fixed point problems.
183-197
2001
259
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Klimann01
http://dx.doi.org/10.1016/S0304-3975(99)00335-7
2003-11-19
Periodic D0L Languages.
83-89
1986
46
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs46.html#HeadL86
2003-11-19
Bounded D0L Languages.
255-264
1987
51
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#HeadL87
2003-11-19
Finite DOL Languages and Codes.
357-361
1982
21
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#HeadW82
2003-11-19
Code Properties and Homomorphisms of D0L Systems.
295-312
1985
35
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#HeadW85
2003-11-19
A combinatorial approach to Golomb forests.
283-304
2001
263
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs263.html#Golin01
http://dx.doi.org/10.1016/S0304-3975(00)00250-4
2003-11-19
Language Learning Without Overgeneralization.
151-162
1995
141
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#KapurB95
http://dx.doi.org/10.1016/0304-3975(94)00075-T
2003-11-19
Computability with Low-Dimensional Dynamical Systems.
113-128
1994
132
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs132.html#KoiranCG94
2003-11-19
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System.
337-344
1985
35
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs35.html#KapurN85
2003-11-19
Measuring with jugs.
259-270
2002
282
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs282.html#BoldiSV02
http://dx.doi.org/10.1016/S0304-3975(01)00060-3
2003-11-19
Metacircularity in the Polymorphic lambda-Calculus.
137-159
1991
89
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs89.html#PfenningL91
2003-11-19
A Direct Characterization of Completion.
379-385
1996
154
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs154.html#RameshS96
http://dx.doi.org/10.1016/0304-3975(95)00088-7
2003-11-19
Length of Prime Implicants and Number of Solutions of Random CNF Formulae.
1-30
1999
215
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#BoufkhadD99
http://dx.doi.org/10.1016/S0304-3975(95)00184-0
2003-11-19
Preface - Workshop on Optimization and Implementation of Declarative Programs.
1999
http://www.elsevier.nl/locate/entcs/volume30.html
30
Electr. Notes Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#Leuschel99
2003-11-19
Stability for the Zigzag Submonoids.
237-249
1993
108
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs108.html#VanSL93
2003-11-19
Characterizations of Rational omega-Languages by Means of Right Congruences.
1-21
1995
143
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs143.html#VanSL95
http://dx.doi.org/10.1016/0304-3975(95)80022-2
2003-11-19
A Variation on the Boyer-Moore Algorithm.
119-144
1992
92
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs92.html#Lecroq92
2003-11-19
Probleme de mots dans les gerbes libres.
199-213
1992
94
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Dehornoy92a
2006-05-03
On Weyl Sums and Skew Products over Irrational Rotations.
189-196
1989
65
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs65.html#HellekalekL89
2003-11-19
Testing for Unboundedness of FIFO Channels.
93-117
1993
113
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#JeronJ93
2003-11-19
Theorem Proving by Chain Resolution.
163-180
1998
206
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs206.html#DehornoyM98
http://dx.doi.org/10.1016/S0304-3975(97)00128-X
2003-11-19
On the Existence of Free Models in Abstract Algebraic Institutuons.
269-304
1985
37
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#Tarlecki85
2003-11-19
Parallel N-Free Order Recognition.
393-406
1997
175
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs175.html#Viennot97
http://dx.doi.org/10.1016/S0304-3975(96)00210-1
2003-11-19
Characteristics of Graph Languages Generated by Edge Replacement.
81-115
1987
51
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#HabelK87
2003-11-19
On Transformations of Concurrent-Object Programs.
259-289
1998
195
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs195.html#PhilippouW98
http://dx.doi.org/10.1016/S0304-3975(97)00222-3
2003-11-19
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
151-162
1998
203
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs203.html#KranakisKPP98
http://dx.doi.org/10.1016/S0304-3975(97)00293-4
2003-11-19
Undecidability of existential properties in picture languages.
51-74
2000
233
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs233.html#RobilliardS00
http://dx.doi.org/10.1016/S0304-3975(97)00279-X
2003-11-19
A new algorithm for regularizing one-letter context-free grammars.
113-122
2003
306
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00215-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#AndreiCC03
2003-11-19
Deadlock and Fairness in Morphisms of Transition Systems.
235-257
1988
59
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#Hesselink88a
2003-11-19
Fixpoint semantics and simulation.
275-311
2000
238
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs238.html#HesselinkT00
http://dx.doi.org/10.1016/S0304-3975(98)00176-5
2003-11-19
Public data structures: counters as a special case.
401-423
2002
289
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs289.html#BritMT02
2003-12-02
Text sparsification via local maxima.
341-364
2003
1-3
Theor. Comput. Sci.
304
http://dx.doi.org/10.1016/S0304-3975(03)00142-7
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#CrescenziLGLPR03
2003-11-19
Open Maps for Tessellation Automata.
217-224
1983
27
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs27.html#Maruoka83
2003-11-19
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
265-281
1992
106
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs106.html#BernKRS92
2003-11-19
Normal forms and syntactic completeness proofs for functional independencies.
365-405
2001
266
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#WijesekeraGSN01
http://dx.doi.org/10.1016/S0304-3975(00)00195-X
2003-11-19
Preface.
169
2001
264
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#BergerNR01
http://dx.doi.org/10.1016/S0304-3975(00)00220-6
2003-11-19
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System.
215-225
1984
34
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#CohenLP84
2003-11-19
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.
191-201
1989
64
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#BermondF89
2003-11-19
Tree Structure for Distributive Lattices and its Applications.
391-405
1996
165
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs165.html#HabibN96
http://dx.doi.org/10.1016/0304-3975(95)00232-4
2003-11-19
The Complexity of Finding Minimum-Length Generator Sequences.
265-289
1985
36
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs36.html#Jerrum85
2003-11-19
Algebraic Domains of Natural Transformations.
57-78
1994
136
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs136.html#FiechH94
2003-11-19
Polymorphic lambda calculus and subtyping.
111-140
2002
278
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#FiechS02
http://dx.doi.org/10.1016/S0304-3975(00)00333-9
2003-11-19
Using DNA to solve the Bounded Post Correspondence Problem.
193-203
2000
231
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs231.html#KariGY00
http://dx.doi.org/10.1016/S0304-3975(99)00100-0
2003-11-19
Random regular graphs with edge faults: Expansion through cores.
91-125
2001
264
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#Goerdt01a
http://dx.doi.org/10.1016/S0304-3975(00)00215-2
2003-11-19
Two Iteration Theorems for the LL(k) Languages.
193-228
1980
12
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Beatty80
2003-11-19
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions.
45-66
1992
100
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#Goerdt92a
2003-11-19
Simple Chain Grammars and Languages.
287-309
1979
9
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs9.html#Nijholt79
2003-11-19
On Satisfying the LL-Iteration Theorem.
91-94
1983
23
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#Nijholt83
2004-12-02
Analysis of edge deletion processes on faulty random regular graphs.
241-260
2003
1-3
Theor. Comput. Sci.
297
http://dx.doi.org/10.1016/S0304-3975(02)00640-0
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#GoerdtM03
2003-11-19
On the Number of Arithmetical Operations for Finding Fibonacci Numbers.
119-124
1989
64
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#ProtasiT89
2003-11-19
Priority queues with binary priorities.
133-144
2001
262
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#KalorkotiT01
http://dx.doi.org/10.1016/S0304-3975(00)00186-9
2003-11-19
A Comparison of two Variations of a Pebble Game on Graphs.
315-322
1981
13
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Heide81
2003-11-19
Simulating Probabilistic by Deterministic Algebraic Computation Trees.
325-330
1985
41
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#Heide85
2003-11-19
Semantics of Order-Sorted Specifications.
1-35
1992
94
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs94.html#Waldmann92
2003-11-19
An optimal online algorithm for scheduling two machines with release times.
133-143
2001
268
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#NogaS01
http://dx.doi.org/10.1016/S0304-3975(00)00264-4
2003-11-19
Interaction nets for linear logic.
83-140
2000
247
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#Mackie00
http://dx.doi.org/10.1016/S0304-3975(00)00198-5
2003-11-19
Properties of Structure Generating Functions of Automata and their Applications for Linear Systems.
207-220
1982
18
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs18.html#Uchimura82
2003-11-19
Truncations of Infinite Matrices and Algebraic Series Associated with Some CF Grammars.
227-261
1984
31
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs31.html#Uchimura84
2003-11-24
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
121-154
1996
168
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs168.html#KavvadiasPSZ96
http://dx.doi.org/10.1016/S0304-3975(96)00065-5
2003-11-19
Inductive Assertion Method for Logic Programs.
133-155
1988
59
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#DrabentM88
2003-11-19
Représentation symbolique d'espèces moléculaires.
131-136
1993
117
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Chiricota93
2003-11-19
Sharing Out Control in Distributed Processes.
163-186
1995
139
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs139.html#Bergeron95
http://dx.doi.org/10.1016/0304-3975(94)00132-3
2003-11-19
On the Rational Behaviors of Concurrent Timers.
229-237
1997
189
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs189.html#Bergeron97
http://dx.doi.org/10.1016/S0304-3975(97)00074-1
2003-11-19
Rigorous results for mean field models for spin glasses.
69-77
2001
265
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs265.html#Talagrand01
http://dx.doi.org/10.1016/S0304-3975(01)00150-5
2003-11-19
Paraconsistent Logic Programming.
135-154
1989
68
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs68.html#BlairS89
2003-11-19
Problem-Oriented Verification System and its Application to Linear Algebra Programs.
173-185
1993
119
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#NepomniaschyS93
2003-11-19
Genericity and Randomness over Feasible Probability Measures.
245-259
1998
207
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#LorentzL98
http://dx.doi.org/10.1016/S0304-3975(98)00067-X
2006-02-02
A P-Complete Graph Partition Problem.
343-351
1990
76
Theor. Comput. Sci.
2-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs76.html#SarnathH90
2003-11-19
Recursively enumerable reals and Chaitin Omega numbers.
125-149
2001
255
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#CaludeHKW01
http://dx.doi.org/10.1016/S0304-3975(99)00159-0
2003-11-19
Recent results on approximating the Steiner tree problem and its generalizations.
205-216
2000
235
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs235.html#Vazirani00
http://dx.doi.org/10.1016/S0304-3975(99)00192-9
2003-11-19
Metric Completion versus Ideal Completion.
145-171
1996
170
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs170.html#Majster-CederbaumB96
http://dx.doi.org/10.1016/S0304-3975(96)80705-5
2003-11-19
The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP.
1-40
1994
124
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs124.html#Majster-CederbaumZ94
2003-11-19
Deterministic Soliton Automata with a Single Exterior Node.
281-292
1991
84
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs84.html#DassowJ91
2003-11-19
Cooperation in Context-Free Grammars.
353-361
1997
180
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs180.html#DassowM97
http://dx.doi.org/10.1016/S0304-3975(96)00330-1
2003-11-19
Mechanical Software Verification: High Level Control Aspects from a User's Perspective.
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#Goerigk01
2003-11-19
An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice.
229-241
1994
125
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs125.html#LempelP94
2003-11-19
Partial correctness for probabilistic demonic programs.
513-541
2001
266
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#McIverM01a
http://dx.doi.org/10.1016/S0304-3975(00)00208-5
2003-11-19
Nonholonomic Systems: Controllability and Complexity.
101-114
1996
157
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs157.html#LaumondR96
http://dx.doi.org/10.1016/0304-3975(95)00178-6
2003-11-19
A structural property of regular frequency computations.
33-43
2003
292
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#AustinatDH03
2003-11-19
Domain representations of topological spaces.
229-255
2000
247
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#Blanck00
http://dx.doi.org/10.1016/S0304-3975(99)00045-6
2003-11-19
<i>X</i>), the Space of Compact Subsets.
19-48
1999
219
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Blanck99
http://dx.doi.org/10.1016/S0304-3975(98)00282-5
2003-11-19
Online algorithms for page replication in rings.
107-117
2001
268
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs268.html#Glazek01
http://dx.doi.org/10.1016/S0304-3975(00)00262-0
2003-11-19
Label-Selective lambda-Calculus Syntax and Confluence.
353-383
1995
151
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs151.html#Ait-KaciG95
http://dx.doi.org/10.1016/0304-3975(95)00072-5
2003-11-19
A Weakest Precondition Semantics for Communicating Processes.
231-250
1984
29
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#ElradF84
2003-11-19
Relation-Algebraic Semantics.
1-85
1996
160
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#Maddux96
http://dx.doi.org/10.1016/0304-3975(95)00082-8
2003-11-19
Exploration of NP-hard Enumeration Problems by Simulated Annealing - the Spectrum Values of Permanents.
51-68
1999
215
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#NouraniA99
http://dx.doi.org/10.1016/S0304-3975(99)80002-4
2004-07-12
Almost periodic sequences.
1-33
2003
1-3
Theor. Comput. Sci.
304
http://dx.doi.org/10.1016/S0304-3975(02)00847-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs304.html#MuchnikSU03
2003-11-19
A framework for interoperability.
2001
59
Electr. Notes Theor. Comput. Sci.
1
http://www.elsevier.nl/locate/entcs/volume59.html
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#FisherPR01
2003-11-19
Mathematical Metaphysics of Randomness.
263-317
1998
207
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#MuchnikSU98
http://dx.doi.org/10.1016/S0304-3975(98)00069-3
2003-11-19
Figaro: Yet Another Constraint Programming Library.
1999
http://www.elsevier.nl/locate/entcs/volume30.html
30
Electr. Notes Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#HenzB99
2003-11-19
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
125-132
1989
64
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#KorachMZ89
2003-11-19
Nivat's Theorem for Pushdown Transducers.
245-262
1992
97
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs97.html#Karner92
2003-11-19
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
1883-1895
2003
290
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BampisGK03
2003-11-19
Operational Interpretations of Linear Logic.
231-248
1999
227
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs227.html#TurnerW99
http://dx.doi.org/10.1016/S0304-3975(99)00054-7
2003-11-19
A Theory of Sequentiality.
273-291
1993
113
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs113.html#BucciarelliE93
2003-11-19
Relative definability of boolean functions via hypergraphs.
91-110
2002
278
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#BucciarelliM02
http://dx.doi.org/10.1016/S0304-3975(00)00332-7
2003-11-19
Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages.
289-319
1992
98
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs98.html#PalisS92
2003-11-19
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.
1-18
1995
147
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs147.html#BampisKT95
http://dx.doi.org/10.1016/0304-3975(94)00267-M
2003-11-19
The Genericity Theorem and Parametricity in the Polymorphic lambda-Calculus.
323-349
1993
121
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#LongoMS93
2003-11-19
Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem.
319-352
1999
224
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs224.html#Voronkov99
http://dx.doi.org/10.1016/S0304-3975(98)00317-X
2003-11-19
Scalar aggregation in inconsistent databases.
405-434
2003
3
Theor. Comput. Sci.
296
http://dx.doi.org/10.1016/S0304-3975(02)00737-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#ArenasBCHRS03
2003-11-19
Negative Boolean Constraints.
365-380
1996
160
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs160.html#MarriottO96
http://dx.doi.org/10.1016/0304-3975(95)00209-X
2003-11-19
A Confluent Calculus for Concurrent Constraint Programming.
209-233
1997
173
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs173.html#MarriottO97
http://dx.doi.org/10.1016/S0304-3975(96)00196-X
2005-07-25
Presheaf models for CCS-like languages.
47-89
2003
300
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(01)00209-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs300.html#CattaniW03
2003-11-19
From computation to foundations via functions and application: The -calculus and its webbed models.
81-161
2000
249
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs249.html#Berline00
http://dx.doi.org/10.1016/S0304-3975(00)00057-8
2003-11-19
Narrowing vs. SLD-Resolution.
3-23
1988
59
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#BoscoGM88
2003-11-19
Programs as Partial Graphs II: Recursion.
159-179
1981
15
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs15.html#Schmidt81a
2003-11-19
A discipline of evolutionary programming.
3-23
2000
241
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs241.html#Vitanyi00
http://dx.doi.org/10.1016/S0304-3975(99)00263-7
2003-11-19
Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms.
49-71
1976
2
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs2.html#Vitanyi76
2003-11-19
On the Simulation of Many Storage Heads by One.
157-168
1984
34
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#Vitanyi84
2003-11-19
On the algorithmic inversion of the discrete Radon transform.
455-469
2002
281
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs281.html#GritzmannV02
http://dx.doi.org/10.1016/S0304-3975(02)00023-3
2003-11-19
More on weighted servers or FIFO is better than LRU.
305-317
2003
306
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00287-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#EpsteinIS03
2003-11-19
The Temporal Semantics of Concurrent Programs.
45-60
1981
13
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#Pnueli81
2003-11-19
Coalgebras and monads in the semantics of Java.
329-349
2003
291
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs291.html#JacobsP03
2003-11-19
Coalgebraic Methods in Computer Science - Foreword.
1
2002
280
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs280.html#JacobsR02
http://dx.doi.org/10.1016/S0304-3975(01)00018-4
2003-11-19
Explaining updates by minimal sums.
819-838
2001
266
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#SchlechtaD01
http://dx.doi.org/10.1016/S0304-3975(00)00377-7
2003-11-19
A Logical Characterization of Well Branching Event Structures.
35-72
1992
96
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs96.html#MukundT92
2003-11-19
A Classification of Complexity Core Lattices.
121-130
1986
47
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs47.html#Orponen86
2003-11-19
Computing with Truly Asynchronous Threshold Logic Networks.
123-136
1997
174
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Orponen97
http://dx.doi.org/10.1016/S0304-3975(96)00017-5
2003-11-19
Séries indicatrices et q-séries.
169-186
1993
117
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#Decoste93
2003-11-19
<sup>infinity</sup>-functions.
199-206
2002
284
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs284.html#Blaser02
http://dx.doi.org/10.1016/S0304-3975(01)00062-7
2003-11-19
The complexity of bivariate power series arithmetic.
65-83
2003
1-3
Theor. Comput. Sci.
http://dx.doi.org/10.1016/S0304-3975(02)00396-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Blaser03
2003-11-19
<i>RNC</i><i>NC</i>Algorithms for Maximal Path Sets.
89-98
1999
215
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs215.html#UeharaCH99
http://dx.doi.org/10.1016/S0304-3975(97)00132-1
2003-11-19
The Code Problem for Traces - Improving the Boundaries.
309-321
1997
172
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#HoogeboomM97
http://dx.doi.org/10.1016/S0304-3975(96)00216-2
2004-02-24
The counting complexity of group-definable languages.
199-218
2000
242
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#ArvindV00a
http://dx.doi.org/10.1016/S0304-3975(98)00218-7
2003-11-19
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.
193-202
1997
174
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#BermanL97
http://dx.doi.org/10.1016/S0304-3975(96)00024-2
2003-11-19
Propositional Dynamic Logic is Weaker without Tests.
321-328
1981
16
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#BermanP81
2003-11-19
The Sprague-Grundy Function for Wythoff's Game.
311-333
1990
75
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs75.html#BlassF90
2003-11-19
Fine Hierarchy of Regular Omega-Languages.
37-59
1998
191
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs191.html#Selivanov98
http://dx.doi.org/10.1016/S0304-3975(97)00301-0
2003-11-19
Decomposition of Linear Automata over Residue Rings Into Shift-Registers.
11-30
1986
43
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#Scheuing86
2003-11-19
Constructions Effectives sur les Séries Formelles d'Arbres.
237-247
1990
77
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#Bozapalidis90
2003-11-19
Alphabetic Tree Relations.
177-211
1992
99
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs99.html#Bozapalidis92
2003-11-19
<sup>0</sup>.
473-485
2003
3
Theor. Comput. Sci.
296
http://dx.doi.org/10.1016/S0304-3975(02)00740-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs296.html#Hesse03
2003-11-19
Transformation of Shaped Nested Graphs and Diagrams.
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#HoffmannM01
2003-11-19
Results on NLC Grammars with One-Letter Terminal Alphabets.
279-294
1990
73
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs73.html#HoffmannM90
2003-11-19
A Neural Compiler.
1-52
1995
141
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#GruauRW95
http://dx.doi.org/10.1016/0304-3975(94)00200-3
2003-11-19
Flatwords and Post Correspondence Problem.
93-108
1996
161
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#HarjuLM96
http://dx.doi.org/10.1016/0304-3975(95)00092-5
2003-11-19
Three-part partition games on rectangles.
639-661
2001
259
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#Heuer01
http://dx.doi.org/10.1016/S0304-3975(00)00404-7
2003-11-19
Logical Foundation Approach to Users' Domain Restriction in Data Bases.
11-36
1983
23
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs23.html#JankowskiR83
2003-11-19
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits.
197-212
2000
237
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#SenguptaV00
http://dx.doi.org/10.1016/S0304-3975(98)00170-4
2003-11-19
A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent.
389-398
1998
209
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs209.html#SenguptaV98
http://dx.doi.org/10.1016/S0304-3975(98)00130-3
2003-11-19
On the Power of Probabilistic Strategies in Inductive Inference.
111-133
1984
28
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#WiehagenFK84
2003-11-19
Identification of Partial Disjunction, Parity, and Threshold Functions.
131-147
2000
230
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs230.html#UeharaTW00
http://dx.doi.org/10.1016/S0304-3975(99)00154-1
2003-11-19
Chemins de Schröder et hiérarchies aléatoires.
345-361
2001
255
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs255.html#PenaudPPR01
http://dx.doi.org/10.1016/S0304-3975(99)00293-5
2003-11-19
Heaps and Heapsort on Secondary Storage.
345-362
1999
220
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs220.html#FadelJKT99
http://dx.doi.org/10.1016/S0304-3975(99)00006-7
2003-11-19
An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension.
265-273
1997
178
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#KopidakisZ97
http://dx.doi.org/10.1016/S0304-3975(96)00282-4
2003-11-19
A variant of inductive counting.
465-475
2000
237
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs237.html#Geffert00
http://dx.doi.org/10.1016/S0304-3975(99)00338-2
2003-11-19
Space hierarchy theorem revised.
171-187
2003
1-3
Theor. Comput. Sci.
http://dx.doi.org/10.1016/S0304-3975(02)00402-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#Geffert03
2003-11-19
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.
235-249
1988
62
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#Geffert88
2003-11-19
A Speed-Up Theorem Without Tape Compression.
49-79
1993
118
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs118.html#Geffert93
2003-11-19
A Communication Hierarchy of Parallel Computations.
99-130
1998
198
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Geffert98
http://dx.doi.org/10.1016/S0304-3975(97)00033-9
2003-11-19
A Calculus of Stochastic Systems for the Specification, Simulation, and Hidden State Estimation of Mixed Stochastic/Nonstochastic Systems.
171-217
1995
152
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#BenvenisteLFG95
http://dx.doi.org/10.1016/0304-3975(94)00295-1
2005-10-12
An Optimal Distributed Algorithm for Recognizing Mesh-Connected Networks.
261-278
1993
120
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs120.html#SubbiahIRK93
2003-11-19
Recursive Programs and Denotational Semantics in Absolute Logics of Programs.
127-150
1990
70
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs70.html#Pasztor90
2003-11-19
Restrictions and Representations of Vector Controlled Concurrent System Behaviours.
61-102
1997
179
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs179.html#KeesmaatK97
http://dx.doi.org/10.1016/S0304-3975(96)00105-3
2003-11-19
An Algorithm for the Decomposition of Semisimple Lie Algebras.
117-122
1997
187
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Graaf97
http://dx.doi.org/10.1016/S0304-3975(97)00060-1
2005-06-17
Compatibility Problems in the Development of Algebraic Module Specifications.
27-71
1990
77
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs77.html#EhrigFHLJP90
2003-11-19
Some More Independence Results in Complexity Theory.
119-126
1980
12
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Grant80
2003-11-19
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic.
227-237
2003
308
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(02)00731-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs308.html#NourR03
2003-11-19
The Ciao Module System: A New Module System for Prolog.
1999
http://www.elsevier.nl/locate/entcs/volume30.html
30
Electr. Notes Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs30.html#GrasH99
2003-11-19
A Distributed Selection Algorithm and its Expected Communication Complexity.
185-204
1992
100
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs100.html#SantoroSS92
2003-11-19
Finitely Generated bi-omega-Languages.
33-52
1991
85
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs85.html#DevolderL91
2003-11-19
A Classification of Minimal Standard-Path 2x2 Switching Networks.
329-354
1992
102
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#HalpennyS92
2003-11-19
Record Allocation for Minimizing Seek Delay.
307-319
1981
16
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs16.html#GuptaLLPW81
2003-11-19
Asynchronous cellular automata for pomsets.
1-38
2000
247
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs247.html#DrosteGK00
http://dx.doi.org/10.1016/S0304-3975(00)00166-3
2006-04-19
Cube packing.
355-366
2003
1-3
Theor. Comput. Sci.
297
http://dx.doi.org/10.1016/S0304-3975(02)00647-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs297.html#MiyazawaW03
2003-11-19
On the analysis of the (1+1) evolutionary algorithm.
51-81
2002
276
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs276.html#DrosteJW02
http://dx.doi.org/10.1016/S0304-3975(01)00182-7
2003-11-19
An algebraic model of observable properties in distributed systems.
637-668
2003
290
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs290.html#BernardinelloFP03
2006-01-10
A note on differentiable palindromes.
167-178
2003
1-3
Theor. Comput. Sci.
302
http://dx.doi.org/10.1016/S0304-3975(02)00746-6
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs302.html#BrlekL03
2003-11-19
<sup>k</sup>Dédié à Jean Berstel
85-96
2003
292
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#BrlekR03
2003-11-19
Simple Second-order Languages for which Unification is Undecidable.
25-41
1991
87
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs87.html#Farmer91
2003-11-19
Validating firewalls using flow logics.
381-418
2002
283
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs283.html#NielsonNH02
http://dx.doi.org/10.1016/S0304-3975(01)00140-2
2003-11-19
From Regular Expressions to DFA's Using Compressed NFA's.
1-36
1997
178
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs178.html#ChangP97
http://dx.doi.org/10.1016/S0304-3975(96)00140-5
2003-11-19
Characterizing Finite Kripke Structures in Propositional Temporal Logic.
115-131
1988
59
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs59.html#BrowneCG88
2003-11-19
Analogies and differences between quantum and stochastic automata.
69-81
2001
262
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs262.html#BertoniC01
http://dx.doi.org/10.1016/S0304-3975(00)00154-7
2003-11-19
Gossiping in chordal rings under the line model.
53-64
2001
264
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs264.html#BarriereCM01
http://dx.doi.org/10.1016/S0304-3975(00)00213-9
2003-11-19
What is the coalgebraic analogue of Birkhoff's variety theorem?
853-886
2001
266
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs266.html#Goldblatt01
http://dx.doi.org/10.1016/S0304-3975(00)00395-9
2003-11-19
A fully abstract denotational semantics for the pi-calculus.
53-89
2002
278
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs278.html#Hennessy02
http://dx.doi.org/10.1016/S0304-3975(00)00331-5
2003-11-19
Enlargement of Functional Algebras for the Lambda Calculus.
177-200
1998
198
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs198.html#Goldblatt98
http://dx.doi.org/10.1016/S0304-3975(97)00126-6
2003-11-19
An Algebraic Theory of Fair Synchronous Communicating Processes.
121-143
1987
49
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#Hennessy87
2003-11-19
General linear relations between different types of predictive complexity.
181-200
2002
271
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs271.html#Kalnishkan02
http://dx.doi.org/10.1016/S0304-3975(01)00039-1
2003-11-19
Finding houses and holes in graphs.
233-244
2001
259
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs259.html#HoangS01
http://dx.doi.org/10.1016/S0304-3975(00)00005-0
2003-11-19
The complexity of the characteristic and the minimal polynomial.
205-222
2003
1-3
Theor. Comput. Sci.
http://dx.doi.org/10.1016/S0304-3975(02)00404-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs295.html#HoangT03
2003-11-19
Training Sequences.
255-272
1989
66
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs66.html#AngluinGS89
2003-11-19
Optimal Representation in Average Using Kolmogorov Complexity.
261-287
1998
200
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs200.html#RivalsD98
http://dx.doi.org/10.1016/S0304-3975(97)00275-2
2003-11-19
A Third-Order Representation of the lambda-mu-Calculus.
2001
58
Electr. Notes Theor. Comput. Sci.
1
http://www.elsevier.nl/locate/entcs/volume58.html
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs58.html#Abel01
2003-11-19
Precedences in Specifications and Implementations of Programming Languages.
3-26
1995
142
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#Aasa95
http://dx.doi.org/10.1016/0304-3975(95)90680-J
2003-11-19
Termination Modulo Equations by Abstract Commutation with an Application to Iteration.
407-423
1997
177
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs177.html#FokkinkZ97
http://dx.doi.org/10.1016/S0304-3975(96)00254-X
2003-11-19
On hard instances.
301-311
2000
242
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs242.html#Mundhenk00
http://dx.doi.org/10.1016/S0304-3975(98)00262-X
2003-11-19
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency.
87-112
1987
49
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs49.html#BakkerMO87
2003-11-19
On Infinite Computations in Denotational Semantics.
53-82
1983
26
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs26.html#BakkerMZ83
2003-11-19
On Infinite Computations in Denotational Semantics.
229-230
1984
29
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs29.html#BakkerMZ84
2003-11-19
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets.
305-329
1989
64
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs64.html#HowellR89
2003-11-19
Halting Space-Bounded Computations.
335-338
1980
10
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs10.html#Sipser80
2003-11-19
A Note on Real-Time One-Way Alternating Multicounter Machines.
287-296
1991
88
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#InoueIT91
2003-11-19
On 1-inkdot Alternating Turing Machines with Small Space.
171-179
1994
127
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#InoueIT94
2003-11-19
Observational logic, constructor-based logic, and their duality.
471-510
2003
3
Theor. Comput. Sci.
298
http://dx.doi.org/10.1016/S0304-3975(02)00865-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#BidoitHK03
2003-11-19
Induction and Recursion on the Partial Real Line with Applications to Real PCF.
121-157
1999
210
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs210.html#EscardoS99
http://dx.doi.org/10.1016/S0304-3975(98)00099-1
2003-11-19
Generalized Knapsack Problems and Fixed Degree Separations.
301-306
1996
161
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs161.html#CuckerS96
http://dx.doi.org/10.1016/0304-3975(96)00002-3
2003-11-19
A Compositional Semantics for Logic Programs.
3-47
1994
122
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs122.html#BossiGLM94
2003-11-19
The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs.
257-265
1987
53
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs53.html#MullerB87
2003-11-19
Finding the Intersection of two Convex Polyhedra.
217-236
1978
7
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs7.html#MullerP78
2003-11-19
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
99-110
1989
67
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs67.html#InoueTH89
2003-11-19
The Theory of Ends, Pushdown Automata, and Second-Order Logic.
51-75
1985
37
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs37.html#MullerS85
2003-11-19
Alternating Automata on Infinite Trees.
267-276
1987
54
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs54.html#MullerS87
2003-11-19
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra.
69-107
1995
141
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs141.html#MullerS95
http://dx.doi.org/10.1016/0304-3975(94)00214-4
2003-11-19
A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines.
331-336
1983
24
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs24.html#InoueTT83
2003-11-19
Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds.
331-339
1985
41
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs41.html#InoueTV85
2003-11-19
PSPACE has constant-round quantum interactive proof systems.
575-588
2003
292
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs292.html#Watrous03
2003-11-19
Relational Algebraic Semantics of Deterministic and Nondeterministic Programs.
123-147
1986
43
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs43.html#BerghammerZ86
2003-11-19
Objects and their lambda calculus.
209-232
2001
258
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs258.html#Tzouvaras01
http://dx.doi.org/10.1016/S0304-3975(00)00009-8
2003-11-19
Data Structures for Two-Edge Connectivity in Planar Graphs.
139-161
1994
130
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs130.html#HershbergerRS94
2003-11-19
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete.
567-572
2003
307
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/S0304-3975(03)00238-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#Muradian03
2003-11-19
Structural similarity within and among languages.
345-363
2003
293
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs293.html#StablerK03
2003-11-19
Properties of a First-Order Functional Language with Sharing.
69-108
1995
146
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs146.html#AriolaA95
http://dx.doi.org/10.1016/0304-3975(94)00185-L
2006-05-08
Analysis of Dynamic Algorithms in Knuth's Model.
147-167
1990
72
Theor. Comput. Sci.
2&3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs72.html#FranconRS90
2003-11-19
Completeness of intersection and union type assignment systems for call-by-value lambda-models.
197-221
2002
272
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs272.html#IshiharaK02
http://dx.doi.org/10.1016/S0304-3975(00)00351-0
2005-11-15
Parallel RAM Algorithms for Factorizing Words.
53-67
1994
127
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#DaykinIS94
2003-11-19
Automatic Generation of Finite-Element Code by Simultaneous Optimization of Expressions.
231-248
1997
187
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Korelc97
http://dx.doi.org/10.1016/S0304-3975(97)00067-4
2003-11-19
MOCA: A Multiprocessor On-Line Competitive Algorithm for Real-Time System Scheduling.
75-97
1994
128
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs128.html#KorenS94
2003-11-19
An Efficient Recognizer for the Boolean Closure of Context-Free Languages.
53-75
1991
80
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs80.html#HeilbrunnerS91
2003-11-19
Foreword.
1
2001
267
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs267.html#ChamparnaudMZ01
http://dx.doi.org/10.1016/S0304-3975(00)00291-7
2003-11-19
Higher Order Dataflow Schemas.
185-198
1991
90
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs90.html#Tyugu91
2003-11-19
Implementation of the Painlevé Test for Ordinary Differential Systems.
87-104
1997
187
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs187.html#Scheen97
http://dx.doi.org/10.1016/S0304-3975(97)00058-3
2006-02-08
Sur les Facteurs des Suites de Sturm.
381-400
1990
71
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs71.html#DulucqG90
2006-02-08
Complexité d'algorithmes et opérations sur les arbres.
187-198
1993
117
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs117.html#DulucqG93
2003-11-19
RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm.
471-484
2003
306
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00323-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs306.html#DulucqT03
2003-11-19
On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing.
231-246
1997
174
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Mullins97
http://dx.doi.org/10.1016/S0304-3975(96)00027-8
2003-11-19
On Describing the Behavior and Implementation of Distributed Systems.
17-43
1981
13
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs13.html#LynchF81
2003-11-19
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
79-101
2003
1-3
Theor. Comput. Sci.
301
http://dx.doi.org/10.1016/S0304-3975(02)00570-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs301.html#KatsuraKO03
2003-11-19
Introduction to the Theory of Nested Transactions.
123-185
1988
62
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs62.html#LynchM88
2003-11-19
Redundancy Criteria for Constrained Completion.
141-177
1995
142
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs142.html#LynchS95
http://dx.doi.org/10.1016/0304-3975(94)00274-6
2003-11-19
Preface.
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#DutraCGPCK99
2003-11-19
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model.
235-251
2003
1
Theor. Comput. Sci.
298
http://dx.doi.org/10.1016/S0304-3975(02)00425-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs298.html#AkutsuKMM03
2003-11-19
Computability on Random Variables.
287-299
1999
219
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs219.html#Muller99
http://dx.doi.org/10.1016/S0304-3975(98)00292-8
2003-11-19
Echanges de trois intervalles et suites minimales.
171-191
1997
174
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs174.html#Santini-Bouchard97
http://dx.doi.org/10.1016/S0304-3975(96)00023-0
2004-02-03
Right-linear half-monadic term rewrite systems.
195-211
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00239-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Vagvolgyi03c
2004-02-03
Coalgebraic modal logic: soundness, completeness and decidability of local consequence.
177-193
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00201-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Pattinson03
2004-02-03
A format for semantic equivalence comparison.
65-109
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00129-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Galpin03
2004-02-03
Better-quasi-orderings and coinduction.
111-123
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00131-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Forster03
2004-02-03
The differential lambda-calculus.
1-41
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00392-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#EhrhardR03
2004-02-03
Concurrency in timed automata.
503-527
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00316-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#LanotteMT03
2004-02-03
<sub>LGOL</sub>.
469-502
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00315-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#GhicaM03
2004-02-03
Two techniques in the area of the star problem in trace monoids.
381-412
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00313-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#KirstenM03
2004-02-03
Paracategories I: internal paracategories and saturated partial algebras.
125-156
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00135-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#HermidaM03
2004-02-03
Realizability of high-level message sequence charts: closing the gaps.
529-554
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.08.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Lohrey03
2004-02-03
On iterating linear transformations over recognizable sets of integers.
413-468
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00314-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Boigelot03
2004-02-03
Structured theories and institutions.
357-380
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00312-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#DuranM03
2004-02-03
Branching time and orthogonal bisimulation equivalence.
313-355
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00277-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#BergstraPZ03
2004-02-03
Normal conditions for inference relations and injective models.
287-311
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00241-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#ZhuXZZ03
2004-02-03
Power simulation and its relation to traces and failures refinement.
157-176
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00200-7
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Gardiner03
2004-02-03
MELL in the calculus of structures.
213-285
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00240-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Strassburger03
2004-02-03
Order-incompleteness and finite lambda reduction models.
43-63
2003
309
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(02)00038-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs309.html#Selinger03
2004-02-03
Speeding up the detection of evolutive tandem repeats.
309-328
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00423-7
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#GroultLM04
2004-02-03
Finding hidden independent sets in interval graphs.
287-307
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00422-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#BiedlBDHLV04
2004-02-03
Extending Parikh matrices.
233-246
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00396-7
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Serbanuta04
2004-02-03
A channel assignment problem for optical networks modelled by Cayley graphs.
501-511
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00394-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Zhou04
2004-02-03
Undecidability of the trace coding problem and some decidable cases.
393-456
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.08.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Kunc04
2004-02-03
Memoryless determinacy of parity and mean payoff games: a simple proof.
365-378
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00427-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#BjorklundSV04
2004-02-03
Vectorial languages and linear temporal logic.
79-116
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00346-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Serre04
2004-02-03
Mutilated chessboard problem is exponentially hard for resolution.
513-525
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00395-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Alekhnovich04
2004-02-03
On the complexity of finding a local maximum of functions on discrete planar subsets.
355-363
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00426-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Mityagin04
2004-02-03
Minimal schedulability interval for real-time systems of periodic tasks with offsets.
117-134
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00362-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Choquet-GenietG04
2004-02-03
New bounds for multi-label interval routing.
61-77
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00318-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#TseL04
2005-11-10
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
135-146
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00376-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#AngelBG04
2004-02-03
Competitive facility location: the Voronoi game.
457-467
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.09.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#AhnCCGO04
2004-02-03
Synchronization of musical words.
35-60
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00309-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Chemillier04
2004-02-03
A combinatorial error bound for t-point-based sampling.
479-488
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00280-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#DukesL04
2004-02-03
The limitedness problem on distance automata: Hashiguchi's method revisited.
147-158
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00377-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#LeungP04
2004-02-03
Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling.
181-231
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00393-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Schmitt04
2004-02-03
Characterisations of balanced words via orderings.
247-271
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00397-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#JenkinsonZ04
2004-02-03
Finite-state dimension.
1-33
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00244-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#DaiLLM04
2004-02-03
Competitive analysis of incentive compatible on-line auctions.
159-180
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00391-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#LaviN04
2004-02-03
<i>h, k</i><i>h</i><i>k</i>mutual exclusion problem.
379-392
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#ManabeT04
2004-02-03
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.
527-537
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Lopez-OrtizS04
2004-02-03
On factorization forests of finite height.
489-499
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00344-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#ChalopinL04
2004-02-03
Moments of conjugacy classes of binary words.
273-285
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00398-0
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#Chuan04
2004-02-03
Tilings: recursivity and regularity.
469-477
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00242-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#CervelleD04
2004-02-03
Tree spanners on chordal graphs: complexity and algorithms.
329-354
2004
310
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00424-9
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs310.html#BrandstadtDLL04
2004-02-03
Precise interprocedural dependence analysis of parallel programs.
325-388
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.09.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#Muller-Olm04
2004-02-03
A generic type system for the Pi-calculus.
121-163
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00325-6
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#IgarashiK04
2004-02-03
Well-behaved flow event structures for parallel composition and action refinement.
463-478
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.10.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#GlabbeekG04
2004-02-03
On liveness and boundedness of asymmetric choice nets.
165-197
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00359-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#JiaoCL04
2004-02-03
ER modelling from first relational principles.
285-323
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.09.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#DoberkatO04
2004-02-03
Interpolation in Grothendieck Institutions.
439-461
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.10.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#Diaconescu04
2004-02-03
Limiting partial combinatory algebras.
199-220
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00360-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#Akama04
2004-02-03
Principality and type inference for intersection types using expansion variables.
1-70
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.10.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#KfouryW04
2004-02-03
Confluence of the coinductive [lambda]-calculus.
105-119
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00324-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#Joachimski04
2004-02-03
On the decidability of the termination problem of active database systems.
389-437
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.09.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#BaileyDR04
2004-02-03
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory.
71-103
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00317-7
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#HermidaM04
2004-02-03
An efficient algorithm for computing bisimulation equivalence.
221-256
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00361-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#DovierPP04
2004-02-03
Rules + strategies for transforming lazy functional logic programs.
479-525
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.10.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#AlpuenteFMV04
2004-02-03
On tree coalgebras and coalgebra presentations.
257-283
2004
311
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/S0304-3975(03)00378-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#AdamekP04
2004-02-03
Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160].
527
2004
311
Theor. Comput. Sci.
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs311.html#FinkelsteinFL04
http://dx.doi.org/10.1016/j.tcs.2003.09.011
2004-02-03
Catalytic P systems, semilinear sets, and vector addition systems.
379-399
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#IbarraDE04
2004-02-03
On two-way FA with monotonic counters and quadratic Diophantine equations.
359-378
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#IbarraD04
2004-02-03
Improving time bounds on maximum generalised flow computations by contracting the network.
75-97
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00403-1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Radzik04
2004-02-03
Probabilistic quickest path algorithm.
189-201
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.08.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Rao04
2004-02-03
Preface.
1-2
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00399-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#EidenbenzHBRWC04
2004-02-03
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times.
267-280
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.09.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#KarunoN04
2004-02-03
Typical rounding problems.
463-477
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Doerr04
2004-02-03
A new approach to all-pairs shortest paths on real-weighted graphs.
47-74
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00402-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Pettie04
2004-02-03
Measuring the probabilistic powerdomain.
99-119
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00404-3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#MartinMW04
2004-02-03
Characterizations of quantum automata.
479-489
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.08.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#QiuY04
2004-02-03
Inapproximability results for equations over finite groups.
17-45
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00401-8
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#EngebretsenHR04
2004-02-03
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
251-266
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#HashiguchiSJ04
2004-02-03
From regulated rewriting to computing with membranes: collapsing hierarchies.
143-188
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.08.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#FreundMP04
2004-02-03
The conformon-P system: a molecular and cell biology-inspired computability model.
295-319
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Frisco04
2004-02-03
Shuffle on positive varieties of languages.
433-461
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#GomezP04
2004-02-03
Computational aspects of the 2-dimension of partially ordered sets.
401-431
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#HabibNRT04
2004-02-03
Two-dimensional cellular automata and their neighborhoods.
203-222
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.08.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Terrier04
2004-02-03
Correlation immunity and resiliency of symmetric Boolean functions.
321-335
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.09.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#WuD04
2004-02-03
Finding frequent items in data streams.
3-15
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00400-6
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#CharikarCF04
2004-02-03
On the computational complexity of 2-interval pattern matching problems.
223-249
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.08.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#Vialette04
2004-02-03
Games characterizing Levy-Longo trees.
121-142
2004
312
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/S0304-3975(03)00405-5
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#OngG04
2004-02-03
Computing the similarity of two sequences with nested arc annotations.
337-358
2004
312
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.10.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs312.html#AlberGGN04
2004-02-03
Past pushdown timed automata and safety verification.
57-71
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DangBIK04
2004-02-03
Generalized acceptance, succinctness and supernondeterministic finite automata.
159-172
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Zijl04
2004-02-03
Finite automata for compact representation of tuple dictionaries.
45-56
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DaciukN04
2004-02-03
From cascade decompositions to bit-vector algorithms.
3-16
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#BergeronH04
2004-02-03
Bounded-connect noncanonical discriminating-reverse parsers.
73-91
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#FarreG04
2004-02-03
Finite-state transducer cascades to extract named entities in texts.
93-104
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#FriburgerM04
2004-02-03
Learning how to separate.
209-228
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#JainS04
2004-02-03
Loss functions, complexities, and the Legendre transformation.
195-207
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#KalnishkanVV04
2004-02-03
Queries revisited.
175-194
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Angluin04
2004-02-03
Introduction.
1
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#WatsonW04
2004-02-03
Counting the solutions of Presburger equations without enumerating them.
17-29
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#BoigelotL04
2004-02-03
Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
105-117
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Gaal04
2004-02-03
Scheduling hard sporadic tasks with regular languages and generating functions.
119-132
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#GenietD04
2004-02-03
Separation of uniform learning classes.
229-265
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Zilles04
2004-02-03
Derivatives of rational expressions and related theorems.
31-44
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#ChamparnaudD04
2004-02-03
Extraction and recoding of input-[epsiv]-cycles in finite state transducers.
145-158
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Kempe04
2005-01-06
Enhancements of partitioning techniques for image compression using weighted finite automata.
133-144
2004
313
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.10.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#KatritzkeMT04
2004-02-03
Inference of [omega]-languages from prefixes.
295-312
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#HigueraJ04
2004-02-03
Learning regular languages using RFSAs.
267-294
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DenisLT04
2004-02-03
Foreword.
173-174
2004
313
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2003.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#AbeK04
2004-07-01
Appendix A: Report on the First International Clobber Tournament.
533-537
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Grossman04a
2004-07-01
Periodicity and arithmetic-periodicity in hexadecimal games.
463-472
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.08.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#HowseN04
2004-07-01
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
539-543
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.09.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DemaineFFN04
2004-07-01
Periodicity in one-dimensional peg duotaire.
417-425
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Grossman04
2004-07-01
An effective two-level proof-number search algorithm.
511-525
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#WinandsUH04
2004-07-01
Traveling salesmen in the presence of competition.
377-392
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#FeketeFFS04
2004-07-01
Preface: Algorithmic Combinatorial Game Theory.
313
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#FleischerN04
2004-07-01
Assembling molecules in ATOMIX is hard.
447-462
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#HolzerS04
2004-07-01
Note on the game chromatic index of trees.
371-376
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#ErdosFHK04
2004-07-01
On the lengths of symmetry breaking-preserving games on graphs.
427-446
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#HararySV04
2004-07-01
Error analysis in minimax trees.
485-498
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#LorenzM04
2004-07-01
Counting the number of games.
527-532
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.05.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#WolfeF04
2004-07-01
Improved game play by multiple computer hint.
315-324
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.08.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Althofer04
2004-07-01
A Halfliar's game.
353-369
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.09.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DumitriuS04
2004-07-01
European tenure games.
339-351
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Doerr04a
2006-03-08
It is tough to be a plumber.
473-484
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#KralMSTW04
2004-07-01
Solitaire Clobber.
325-338
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#DemaineDF04
2004-07-01
New results of exhaustive search in the game Amazons.
499-509
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Snatzke04
2004-07-01
Complexity, appeal and challenges of combinatorial games.
393-415
2004
303
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2002.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs313.html#Fraenkel04
2004-07-01
Two-dimensional pattern matching with rotations.
173-187
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#AmirBCLS04
2004-07-01
Dichotomies for classes of homomorphism problems involving unary functions.
1-43
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.12.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#FederMS04
2004-07-01
m-Balanced words: A generalization of balanced words.
97-120
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#SanoMK04
2004-07-01
On the sequential access theorem and deque conjecture for splay trees.
459-466
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.01.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Elmasry04
2004-07-01
From object grammars to ECO systems.
57-95
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#DuchiFR04
2004-07-01
Representing recursively enumerable languages by iterated deletion.
451-457
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#DomaratzkiO04
2004-07-01
Linear array and ring embeddings in conditional faulty hypercubes.
431-443
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.01.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Tsai04
2004-07-01
On the complexity of inducing categorical and quantitative association rules.
217-249
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.12.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#AngiulliIP04
2004-07-01
Simple 8-state minimal time solution to the firing squad synchronization problem.
303-334
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/S0304-3975(03)00425-0
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Noguchi04
2004-07-01
Hierarchies of tree series transformations.
387-429
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#FulopGV04
2004-07-01
On the P-NP problem over real matrix rings.
281-285
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Rybalov04
2004-07-01
Local periods and binary partial words: an algorithm.
189-216
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Blanchet-SadriC04
2004-07-01
Routing algorithm for multicast under multi-tree model in optical networks.
293-301
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.12.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#GuHJZ04
2004-07-01
Strategies for the Renyi-Ulam Game with fixed number of lies.
45-55
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Deppe04
2004-07-01
Randomness in secret sharing and visual cryptography schemes.
351-374
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.12.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#BonisS04
2004-07-01
Context-freeness of the power of context-free languages is undecidable.
445-449
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.08.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Bordihn04
2004-07-01
Efficiency and equilibrium in the electronic mail game; the general case.
335-349
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.12.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Dimitri04
2004-07-01
Some properties of Ising automata.
251-279
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.12.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#Yao04
2004-07-01
Forbidden subgraphs in connected graphs.
121-171
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#RavelomananaT04
2004-07-01
Sequential computation of linear Boolean mappings.
287-292
2004
314
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#BurckelM04
2004-07-01
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies.
375-386
2004
314
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.12.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs314.html#ChangGHL04
2004-07-01
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation.
309-318
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BaiC04
2004-07-01
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication.
469-510
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Kaporin04
2004-07-01
Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16.
1-2
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Mislove04
2004-07-01
High probability analysis of the condition number of sparse polynomial systems.
525-555
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#MalajovichR04
2004-07-01
Minimal length test vectors for multiple-fault detection.
191-208
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#FurediK04
2004-07-01
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate.
557-579
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#NoutsosCV04
2004-07-01
Poset-valued sets or how to build models for linear logics.
83-107
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#SchalkP04
2004-07-01
Encoding types in ML-like languages.
151-190
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Yang04
2004-07-01
Preface: Algebraic and Numerical Algorithms.
307-308
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#EmirisMP04
2004-07-01
Fast inversion of triangular Toeplitz matrices.
511-523
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#LinCN04
2005-12-30
Parametrization of approximate algebraic curves by lines.
627-650
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Perez-DiazSS04
2004-07-01
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile.
453-468
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#HeinigR04
2004-07-01
The correspondence between partial metrics and semivaluations.
135-149
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Schellekens04
2004-07-01
Fast arithmetic with general Gauß periods.
419-452
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#GathenN04
2004-07-01
Building continuous webbed models for system F.
3-34
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BerardiB04
2004-07-01
Two-level languages for program optimization.
61-81
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Calcagno04
2004-07-01
Real functions incrementally computable by finite automata.
109-133
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Konecny04
2004-07-01
Possible worlds and resources: the semantics of BI.
257-305
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#PymOY04
2004-07-01
Numerical factorization of multivariate complex polynomials.
651-669
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#SommeseVW04
2004-07-01
Iterative inversion of structured matrices.
581-592
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#PanBWC04
2004-07-01
Semantic models for information flow.
209-256
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#Lowe04
2004-07-01
Bernstein-Bezoutian matrices.
319-333
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BiniG04
2004-07-01
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon.
371-404
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BuragoGS04
2004-07-01
Deformation techniques to solve generalised Pham systems.
593-625
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#PardoM04
2004-07-01
Semantics and logic of object calculi.
191-213
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#ReusS04
2004-07-01
Equilogical spaces.
35-59
2004
315
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BauerBS04
2004-07-01
The abc conjecture and correctly rounded reciprocal square roots.
405-417
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#CrootLZ04
2004-07-01
Polynomial equation solving by lifting procedures for ramified fibers.
335-369
2004
315
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs315.html#BompadreMWW04
2004-07-01
On coalgebra based on classes.
3-23
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.12.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#AdamekMV04
2004-07-01
On the relationship between compact regularity and Gentzen's cut rule.
113-136
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Moshier04
2004-07-01
Entailment systems for stably locally compact locales.
259-296
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Vickers04
2004-07-01
Hierarchies of total functionals over the reals.
137-151
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Normann04
2004-07-01
Domain theory for concurrency.
153-190
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#NygaardW04
2006-02-07
A universal characterization of the double powerlocale.
297-321
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#VickersT04
2004-07-01
Preface: Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott.
1-2
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#BirkedalEJR04
2004-07-01
Intersection types and domain operators.
25-47
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#AlessiDL04
2004-07-01
Idempotent analysis and continuous semilattices.
75-87
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Lawson04
2004-07-01
Posets having continuous intervals.
89-103
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#LawsonX04
2004-07-01
Polynat in PER models.
215-224
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Rummelhoff04
2004-07-01
Left and right adjoint operations on spaces and data types.
105-111
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Lawvere04
2004-07-01
Behavioural inverse limit lambda-models.
49-74
2004
316
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.01.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs316.html#Dezani-CiancagliniGL04
2004-07-01
Continuous-time computation with restricted integration capabilities.
147-165
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Campagnolo04
2004-07-01
Toward a theory of intelligence.
13-30
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Kugel04
2004-07-01
Natural computation and non-Turing models of computation.
115-145
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#MacLennan04
2004-07-01
Hypercomputation with quantum adiabatic processes.
93-104
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Kieu04
2004-07-01
Super-tasks, accelerating Turing machines and uncomputability.
105-114
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Shagrir04
2004-07-01
The concept of computability.
209-225
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Cleland04
2004-07-01
Uncomputability: the problem of induction internalized.
227-249
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Kelly04
2004-07-01
Three aspects of super-recursive algorithms and hypercomputation or finding black swans.
1-11
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#BurginK04
2004-07-01
Hypercomputation: philosophical issues.
251-267
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Copeland04
2004-07-01
The modal argument for hypercomputing minds.
167-190
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#BringsjordA04
2004-07-01
Experience, generations, and limits in machine learning.
71-91
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#BurginK04a
2004-07-01
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines.
61-69
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Wiedermann04
2004-07-01
Hypercomputation by definition.
191-207
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Wells04
2004-07-01
Algorithmic complexity of recursive and inductive algorithms.
31-60
2004
317
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2003.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs317.html#Burgin04
2004-07-01
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion.
181-196
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Leivant04
2004-07-01
On the computational complexity of Longley's H functional.
225-241
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Royer04
2004-07-01
Realizability models for BLL-like languages.
121-137
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#HofmannS04
2004-07-01
On the computational complexity of imperative programming languages.
139-161
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#KristiansenN04
2004-07-01
<i>NC</i>along the delta axis.
57-78
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#BellantoniO04
2004-07-01
Continuous monoids and semirings.
355-372
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.01.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Karner04
2005-04-20
Minimization and NP multifunctions.
105-119
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#DannerP04
2004-07-01
The decidability of a fragment of BB'IW-logic.
373-408
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#BrodaDFS04
2004-07-01
On an interpretation of safe recursion in light affine logic.
197-223
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#MurawskiO04
2004-07-01
Towards the hierarchical verification of reactive systems.
243-296
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.08.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Majster-CederbaumS04
2004-07-01
Editorial: Implicit Computational Complexity.
1
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Marion04
2004-07-01
An arithmetic for non-size-increasing polynomial-time computation.
3-27
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#AehligBHS04
2004-07-01
Optimal paths in weighted timed automata.
297-322
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.10.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#AlurTP04
2004-07-01
Stratified coherence spaces: a denotational semantics for light linear logic.
29-55
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Baillot04
2004-07-01
Soft linear logic and polynomial time.
163-180
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Lafont04
2004-07-01
Metrics for labelled Markov processes.
323-354
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.09.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#DesharnaisGJP04
2004-07-01
Automated higher-order complexity analysis.
79-103
2004
318
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2003.10.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#Benzinger04
2004-07-01
A geometric interpretation of LD-resolution.
435-470
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#BanerjeeB04
2004-07-01
Phase semantics and decidability of elementary affine logic.
409-433
2004
318
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs318.html#LagoM04
2004-07-01
The number of binary words avoiding abelian fourth powers grows exponentially.
441-446
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Currie04
2004-07-01
Algebraic and model-theoretic properties of tilings.
103-126
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Oger04
2004-07-01
Applications of graphical condensation for enumerating matchings and tilings.
29-57
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Kuo04
2004-07-01
A formula for the number of tilings of an octagon by rhombi.
71-81
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#DestainvilleMB04
2004-07-01
Canonical substitutions tilings of Ammann-Beenker type.
241-279
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#HarrissL04
2004-07-01
The NP-completeness of a tomographical problem on bicolored domino tilings.
447-454
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#FrosiniS04
2004-07-01
Two-dimensional iterated morphisms and discrete planes.
145-176
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#ArnouxBS04
2004-07-01
Foreword: Combinatorics of the Discrete Plane and Tilings.
1
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Vuillon04
2004-07-01
Symmetry groups for beta-lattices.
281-305
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#ElkharratFGV04
2004-07-01
Tilings of rectangles with T-tetrominoes.
3-27
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#KornP04
2004-07-01
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines.
127-143
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#DelvenneB04
2004-07-01
Periodicity and local complexity.
229-240
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#QuasZ04
2004-07-01
<sup>n</sup>with norm.
357-366
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#FurediK04a
2004-07-01
Tilings with trichromatic colored-edges triangles.
59-70
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#BodiniR04
2004-07-01
<i>q</i>-enumeration of convex polyominoes by the festoon approach.
333-356
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Feretic04
2004-07-01
A symbolical algorithm on additive basis and double-loop networks.
423-439
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#AguiloAD04
2004-07-01
Leader election in plane cellular automata, only with left-right global convention.
367-384
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#NichitiuPR04
2004-07-01
Lattices and multi-dimensional words.
177-202
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#BertheT04
2004-07-01
Domino tilings and related models: space of configurations of domains with holes.
83-101
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#DesreuxMRR04
2004-07-01
Connectivity of discrete planes.
203-227
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#BrimkovB04
2004-07-01
Counting lattice paths taking steps in infinitely many directions under special access restrictions.
385-409
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#HumphreysN04
2004-07-01
On unique graph 3-colorability and parsimonious reductions in the plane.
455-482
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#Barbanchon04
2004-07-01
Identifying codes in some subgraphs of the square lattice.
411-421
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#DanielGM04
2004-07-01
Distribution results for low-weight binary representations for pairs of integers.
307-331
2004
319
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.02.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs319.html#GrabnerHP04
2004-07-01
String-matching with OBDDs.
187-198
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.11.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#ChoffrutH04
2004-07-01
Real royal road functions for constant population size.
123-134
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.047
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#StorchW04
2004-07-01
The size of SPP.
495-503
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Hitchcock04
2004-07-01
On probabilistic analog automata.
449-464
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Ben-HurRS04
2004-07-01
On the number of nonterminals in linear conjunctive grammars.
419-448
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Okhotin04
2004-07-01
Preface.
1-2
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Rozenberg04
2004-07-01
Deletion along trajectories.
293-313
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Domaratzki04
2004-07-01
Combined super-/substring and super-/subsequence problems.
247-267
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#MiddendorfM04
2004-07-01
Algorithms for multi-level graph planarity testing and layout.
331-344
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#HealyK04
2004-07-01
Neural learning methods yielding functional invariance.
111-121
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#AnguloT04
2004-07-01
A fast natural algorithm for searching.
3-13
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#ArulanandhamCD04
2004-07-01
On the state complexity of reversals of regular languages.
315-329
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#SalomaaWY04
2004-07-01
A note on measuring in P.
229-246
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Powell04
2004-07-01
Classifying RNA pseudoknotted structures.
35-50
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#CondonDRZT04
2004-07-01
Algorithms for four variants of the exact satisfiability problem.
373-394
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#DahllofJB04
2004-07-01
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
199-212
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#YuanLNC04
2004-07-01
On the computational complexity of membrane systems.
89-109
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Ibarra04
2004-12-15
Bounding the firing synchronization problem on a ring.
213-228
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#BerthiaumeBPSS04
2004-07-01
Quantum computing without entanglement.
15-33
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#BihamBKM04
2004-07-01
When a genetic algorithm outperforms hill-climbing.
135-153
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#Prugel-Bennett04
2004-07-01
On groups whose word problem is solved by a~counter automaton.
175-185
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#ElstonO04
2004-07-01
New spectral lower bounds on the bisection width of graphs.
155-174
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.059
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#BezrukovEMPT04
2004-07-01
Neural computation, social networks, and topological spectra.
71-87
2004
320
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#DiligentiGM04
2005-01-21
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures.
269-291
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#BlundoDDP04
2004-07-01
Chebyshev polynomials over finite fields and reversibility of -automata on square grids.
465-483
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#HunzikerMP04
2004-07-01
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances.
345-372
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#CoccoM04
2004-07-01
Paired-domination in inflated graphs.
485-494
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#KangSC04
2004-07-01
An algorithmic view of gene teams.
395-418
2004
320
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.02.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs320.html#BealBCR04
2004-07-14
Linear Embedding for a Quantitative Comparison of Language Expressiveness.
2001
59
Electr. Notes Theor. Comput. Sci.
3
http://www1.elsevier.com/gej-ng/31/29/23/89/54/show/Products/notes/index.htt#004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#BrogiPW01
2004-07-14
As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs.
2001
59
Electr. Notes Theor. Comput. Sci.
3
http://www1.elsevier.com/gej-ng/31/29/23/89/54/show/Products/notes/index.htt#003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#Fruhwirth01
2004-07-14
Quantitative Analysis of the Leakage of Confidential Data.
2001
59
Electr. Notes Theor. Comput. Sci.
3
http://www1.elsevier.com/gej-ng/31/29/23/89/54/show/Products/notes/index.htt#005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#ClarkHM01
2004-07-14
Powerdomains and Zero Finding.
2001
59
Electr. Notes Theor. Comput. Sci.
3
http://www1.elsevier.com/gej-ng/31/29/23/89/54/show/Products/notes/index.htt#002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs59.html#Martin01a
2004-11-22
On the least exponential growth admitting uncountably many closed permutation classes.
271-281
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.056
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Klazar04
2004-11-22
The generalized Weil pairing and the discrete logarithm problem on elliptic curves.
59-72
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Garefalakis04
2004-11-22
The Level Ancestor Problem simplified.
5-12
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#BenderF04
2004-11-22
On dart-free perfectly contractile graphs.
171-194
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2003.11.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#SalesM04
2004-11-22
On Kurtz randomness.
249-270
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.055
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#DowneyGR04
2004-11-22
Average complexity of exact and approximate multiple string matching.
283-290
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.058
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#NavarroF04
2004-11-22
Preface.
1-3
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.02.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#GarayR04
2004-11-22
Evolution and observation--a non-standard way to generate formal languages.
233-248
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#CavaliereL04
2004-11-22
Graph traversal and graph transformation.
215-231
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Holdsworth04
2004-11-22
Sturmian words, beta-shifts, and transcendence.
395-404
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#ChiK04
2004-11-22
Electronic jury voting protocols.
73-94
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#HeviaK04
2004-11-22
Packing arrays.
125-148
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.06.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#StevensM04
2004-11-22
Space-efficient planar convex hull algorithms.
25-40
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#BronnimannIKMMT04
2004-11-22
An efficient algorithm for sequence comparison with block reversals.
95-101
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.05.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#MuthukrishnanS04
2004-11-22
Longest increasing subsequences in sliding windows.
405-414
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.03.057
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#AlbertGHLRS04
2004-11-22
On domain-partitioning induction criteria: worst-case bounds for the worst-case based.
371-382
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#NockN04
2004-11-22
Peg-solitaire, string rewriting systems and finite automata.
383-394
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Ravikumar04
2004-11-22
Tight bounds for online class-constrained packing.
103-123
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.05.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#ShachnaiT04
2004-11-22
On the complexity of resolution with bounded conjunctions.
347-370
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#EstebanGM04
2006-01-09
Seventeen lines and one-hundred-and-one points.
415-421
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#Woginger04
2004-11-22
Flow metrics.
13-24
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#BornsteinV04
2004-11-22
Computing Boolean functions from multiple faulty copies of input bits.
149-170
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#SzegedyC04
2004-11-22
Updatable timed automata.
291-345
2004
321
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#BouyerDFP04
2004-11-22
Searching in random partially ordered sets.
41-57
2004
321
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2003.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs321.html#CarmoDKL04
2004-11-22
Abstractions for fault-tolerant global computing.
567-613
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.09.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#ChothiaD04
2004-11-22
Genetic algorithms for the imitation of genomic styles in protein backtranslation.
297-312
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Moreira04
2004-11-22
Discrete applied problems, cellular automata and lattices: florilegium for E. Goles.
231-232
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#DemongeotM04
2004-11-22
<sup>2</sup>.
369-381
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#MatamalaM04
2004-11-22
For the 50th anniversary of Eric Goles: A few words by Maurice Nivat.
233-235
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Nivat04
2004-11-22
The lattice structure of the set of domino tilings of a polygon.
409-422
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Remila04
2004-11-22
The cyclic genetic code as a constraint satisfaction problem.
313-334
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#WeilHFD04
2004-11-22
Towards a behavioural theory of access and mobility control in distributed systems.
615-669
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.12.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#HennessyMR04
2004-11-22
Private authentication.
427-476
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.12.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#AbadiF04
2004-11-22
Well-behaved principles alternative to bounded induction.
5-16
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#AdamowiczK04
2004-11-22
Three-variable statements of set-pairing.
147-173
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#FormisanoOP04
2004-11-22
On the expressive power of movement and restriction in pure mobile ambients.
477-515
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.10.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#BusiZ04
2006-10-25
On the complexity of decision using destinies in H-bounded structures.
41-67
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Chateau04
2004-11-22
Cellular automata and communication complexity.
355-368
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#DurrRT04
2004-11-22
Subset sum "cubes" and the complexity of primality testing.
203-219
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Woods04
2004-11-22
Arithmetical definability and computational complexity.
137-146
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Hachaichi04
2004-11-22
Closure properties of locally finite omega-languages.
69-84
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Finkel04
2004-11-22
Recursion and topology on 2<=omega for possibly infinite computations.
85-136
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#BecherG04
2004-11-22
Student admissions and faculty recruitment.
245-265
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#BaiouB04
2004-11-22
On some generalizations of the primitive recursive arithmetic.
221-230
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.067
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Zaslavsky04
2004-11-22
Dynamics of a class of ants on a one-dimensional lattice.
267-283
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#GajardoC04
2004-11-22
EMSO-logic and automata related to homogeneous flow event structures.
181-201
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#ShahbazyanS04
2004-11-22
Sandpile models and lattices: a comprehensive survey.
383-407
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#GolesLMMP04
2004-11-22
A spatial logic for concurrency - II.
517-565
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2003.10.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#CairesC04
2004-11-22
A strong induction scheme that leads to polynomially computable realizations.
17-39
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Beltiukov04
2004-11-22
On limit cycles of monotone functions with symmetric connection graph.
237-244
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#AracenaDC04
2004-11-22
Real-time recognition of languages on an two-dimensional Archimedean thread.
335-354
2004
322
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#DelormeM04
2004-11-22
Preface.
423-426
2004
322
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Sassone04
2004-11-22
Winning strategies for infinite games: from large cardinals to computer science extended abstract.
175-179
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#Ressayre04
2004-11-22
Foreword.
1-3
2004
322
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs322.html#CegielskiM04
2004-11-22
Formalizing the trading theorem in Coq.
399-442
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#DehlingerD04a
2004-11-22
Nominal unification.
473-497
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#UrbanPG04
2004-11-22
Domain and event structure semantics for Petri nets with read and inhibitor arcs.
129-189
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#BaldanBCP04
2004-11-22
Formalizing generalized maps in Coq.
351-397
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#DehlingerD04
2004-11-22
Interpreted systems and Kripke models for multiagent systems from a categorical perspective.
235-266
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.04.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#Porter04
2004-11-22
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine.
191-233
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#HieronsH04
2004-11-22
The first order theory of primal grammars is decidable.
267-320
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.04.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#Peltier04
2004-11-22
Reasoning with power defaults.
321-350
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.04.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#ZhangR04
2004-11-22
Getting results from programs extracted from classical proofs.
49-70
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#Raffalli04
2004-11-22
Sound generalizations in mathematical induction.
443-471
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#UrsoK04
2004-11-22
A theory of bisimulation for a fragment of concurrent ML with local names.
1-48
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#JeffreyR04
2004-11-22
Pattern matching as cut elimination.
71-127
2004
323
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.03.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs323.html#CerritoK04
2004-11-22
Online learning in online auctions.
137-146
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#BlumKRW04
2005-06-16
The best expert versus the smartest algorithm.
361-380
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#ChenD04
2004-11-22
Semi-clairvoyant scheduling.
325-335
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#BecchettiLMP04
2004-11-22
Online companion caching.
183-200
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#Seiden04
2004-11-22
Unary algebras, semigroups and congruences on free semigroups.
87-105
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.054
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#PetkovicCB04
2004-11-22
The weighted 2-server problem.
289-312
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#ChrobakS04
2004-11-22
Two optimal parallel algorithms on the commutation class of a word.
107-131
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.048
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#SchottS04
2004-11-22
The CNN problem and other k-server variants.
347-359
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#KoutsoupiasT04
2004-11-22
Combining request scheduling with web caching.
201-218
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#FederMPSSZ04
2004-11-22
Inductive star-semirings.
3-33
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.050
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#EsikK04
2004-11-22
Foreword.
1-
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.049
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#Ito04
2004-11-22
On-line generalized Steiner problem.
313-324
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#AwerbuchAB04
2004-11-22
New results for online page replication.
219-251
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#FleischerGS04
2004-11-22
Foreword.
133-135
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#FiatI04
2005-02-07
On the power of membrane division in P systems.
61-85
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.053
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#PunSTY04
2004-11-22
Many aspects of defect theorems.
35-54
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.051
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#HarjuK04
2004-11-22
Competitive caching of query results in search engines.
253-271
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#LempelM04
2004-11-22
On the competitive ratio of the work function algorithm for the k-server problem.
337-345
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#BartalK04
2004-11-22
Well-quasi-orders and regular omega-languages.
55-60
2004
324
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.052
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#Ogawa04
2004-11-22
Linear time approximation schemes for vehicle scheduling problems.
147-160
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#AugustineS04
2004-11-22
Harmonic buffer management policy for shared memory switches.
161-182
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#KesselmanM04
2004-11-22
Competitive online routing in geometric graphs.
273-288
2004
324
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.05.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs324.html#BoseM04
2004-11-22
The complexity of Boolean matrix root computation.
373-390
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Kutz04
2004-11-22
A multi-scale constraint programming model of alternative splicing regulation.
3-24
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.062
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#EveillardRJBB04
2004-11-22
BioAmbients: an abstraction for biological compartments.
141-167
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.061
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#RegevPSCS04
2004-11-22
A space-efficient algorithm for sequence alignment with inversions and reversals.
361-372
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#ChenGLNWW04
2004-11-22
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice.
45-67
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.064
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#AntoniottiPPSM04
2004-11-22
Randomized approximation of the stable marriage problem.
439-465
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#HalldorssonIMY04
2004-11-22
Modeling and querying biomolecular interaction networks.
25-44
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.063
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Chabrier-RivierCDFS04
2004-11-22
Genomic Distances under Deletions and Insertions.
347-360
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#MarronSM04
2004-11-22
Scheduling broadcasts with deadlines.
479-488
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.047
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#KimC04
2004-11-22
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme.
329-344
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#ToffoliCM04
2004-11-22
Improved competitive algorithms for online scheduling with partial job values.
467-478
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#ChinF04
2004-11-22
Approximate and dynamic rank aggregation.
409-424
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#ChinDFZ04
2004-11-22
The complexity of reversible cellular automata.
317-328
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Sutner04
2004-11-22
Prefac.
1-2
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.060
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Priami04
2004-11-22
Modelling biochemical pathways through enhanced pi-calculus.
111-140
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.066
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#CurtiDPB04
2004-11-22
Solution of some conjectures about topological properties of linear cellular automata.
249-271
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#CattaneoDM04
2004-11-22
On conservative and monotone one-dimensional cellular automata and their particle representation.
285-316
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#MoreiraBC04
2004-11-22
The structure and number of global roundings of a graph.
425-437
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#AsanoKTT04
2004-11-22
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata.
273-284
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Czeizler04
2004-11-22
Preface.
169-
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Kari04
2004-11-22
Formal molecular biology.
69-110
2004
325
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.03.065
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#DanosL04
2004-11-22
Preface.
345-346
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#WarnowZ04
2004-11-22
Efficient data mappings for parity-declustered data layouts.
391-407
2004
325
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#SchwabeS04
2004-11-22
The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups.
171-214
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#BarbeH04
2004-11-22
Efficient exhaustive listings of reversible one dimensional cellular automata.
215-247
2004
325
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs325.html#Boykett04
2004-11-22
Random generation of 2 times 2 times ... times 2 times J contingency tables.
117-135
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#MatsuiMO04
2004-11-22
Limiting distributions for additive functionals on Catalan trees.
69-102
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#FillK04
2004-11-22
On the ultimate complexity of factorials.
419-429
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#Cheng04
2004-11-22
Cross-monotonic cost sharing methods for connected facility location games.
431-442
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#LeonardiS04
2004-11-22
Least-recently-used caching with dependent requests.
293-327
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#JelenkovicR04
2004-11-22
On maximal instances for the original syntenic distance.
29-43
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#ChauveF04
2004-11-22
Complexity of pairwise shortest path routing in the grid.
155-185
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#GonzalezS04
2004-11-22
Lower bounds and the hardness of counting properties.
1-28
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#HemaspaandraT04
2004-11-22
Performance evaluation for energy efficient topologic control in ad hoc wireless networks.
399-408
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#LiHSH04
2004-11-22
Linear-time computation of local periods.
229-240
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#DuvalKKLL04
2004-11-22
On average sequence complexity.
213-227
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#JansonLS04
2004-11-22
The chilean highway problem.
329-342
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#KiwiR04
2004-11-22
On distance constrained labeling of disk graphs.
261-292
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#FialaFF04
2004-11-22
Characterization of networks supporting multi-dimensional linear interval routing schemes.
103-116
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#GanjaliH04
2004-11-22
Rotation sequences and edge-colouring of binary tree pairs.
409-418
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#GibbonsS04
2004-11-22
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
137-153
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#BockenhauerBHKPSU04
2004-11-22
Authenticated key agreement in dynamic peer groups.
363-382
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#Yi04a
2004-11-22
On representations of positive integers in the Fibonacci base.
241-260
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#EdsonZ04
2004-11-22
The complexity of computing the MCD-estimator.
383-398
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#BernholtF04
2004-11-22
Optimal graph exploration without good maps.
343-362
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#DessmarkP04
2004-11-22
On the complexity of fixed parameter clique and dominating set.
57-67
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#EisenbrandG04
2004-11-22
Computability in linear algebra.
187-211
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#ZieglerB04
2004-11-22
Small Turing machines and generalized busy beaver competition.
45-56
2004
326
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs326.html#Michel04
2004-11-22
On deterministic finite automata and syntactic monoid size.
319-347
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.04.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#HolzerK04
2004-11-22
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.
349-373
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.049
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#KlimannLMP04
2004-11-22
Preface.
1-2
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#Gumm04
2004-11-22
Minimizing finite automata is computationally hard.
375-390
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.03.070
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#Malcher04
2004-11-22
Well quasi-orders and context-free grammars.
255-268
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.03.069
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#DAlessandroV04
2004-11-22
Category theory for operational semantics.
135-154
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#LenisaPW04
2004-11-22
A coalgebraic approach to Kleene algebra with tests.
23-44
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#ChenP04
2004-11-22
A hierarchy of probabilistic system types.
3-22
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#BartelsSV04
2004-11-22
Stone coalgebras.
109-134
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#KupkeKV04
2004-11-22
Simulations in coalgebra.
71-108
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#HughesJ04
2004-11-22
Deleting string rewriting systems preserve regularity.
301-317
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.04.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#HofbauerW04
2004-11-22
A compositional approach to defining logics for coalgebras.
45-69
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#Cirstea04
2004-11-22
NFA reduction algorithms by means of regular inequalities.
241-253
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.02.048
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#ChamparnaudC04
2004-11-22
Frequency of symbol occurrences in bicomponent stochastic models.
269-300
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.05.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#FalcoGL04
2004-11-22
Foreword.
223-224
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.07.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#EsikF04
2004-11-22
A coalgebraic view on positive modal logic.
175-195
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#Palmigiano04
2004-11-22
Behavioral abstraction is hiding information.
197-221
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#Rosu04
2004-11-22
Synchronizing monotonic automata.
225-239
2004
327
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.03.068
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#AnanichevV04
2004-11-22
Substitution in non-wellfounded syntax with variable binding.
155-174
2004
327
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs327.html#MatthesU04
2005-04-25
Weak minimization of DFA - an algorithm and applications.
113-133
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#RavikumarE04
2004-11-22
<sub>UCANSON</sub>.
77-96
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#LombardyRS04
2004-11-22
An optimal pre-determinization algorithm for weighted transducers.
3-18
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#AllauzenM04
2004-11-22
Conversation protocols: a formalism for specification and verification of reactive electronic services.
19-37
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#FuBS04
2004-11-22
Acyclic networks maximizing the printing complexity.
39-51
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#GuingneNK04
2004-11-22
Reducing the time complexity of testing for local threshold testability.
151-160
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#Trahtman04
2004-11-22
Bideterministic automata and minimal representations of regular languages.
135-149
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#TammU04
2004-11-22
Branching automata with costs - a way of reflecting parallelism in costs star.
53-75
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#KuskeM04
2004-11-22
Editorial.
1-
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#Ibarra04a
2004-11-22
Ternary directed acyclic word graphs.
97-111
2004
328
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs328.html#MiyamotoITS04
2005-05-06
The complexity of counting homomorphisms seen from the other side.
315-323
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#DalmauJ04
2005-05-06
Codes, orderings, and partial words.
177-202
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Blanchet-Sadri04
2005-05-06
On Robson's convergence and boundedness conjectures concerning the height of binary search trees.
47-70
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Drmota04
2005-05-06
A proof-theoretic characterization of the basic feasible functionals.
159-176
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Strahm04
2005-05-06
The factor composition matrix of sequences.
251-269
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#PeyriereTWW04
2005-05-06
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
1-45
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Coja-OghlanGLS04
2005-05-06
An improved deterministic local search algorithm for 3-SAT.
303-313
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#BrueggemannK04
2005-05-06
w-Regular languages are testable with a constant number of queries.
71-92
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#ChocklerK04
2005-05-06
Storage-to-tree transducers with look-ahead.
115-158
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#HornungV04
2005-05-06
On the complexities of multipoint evaluation and interpolation.
223-235
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#BostanS04
2005-05-06
Polynomial time learning of simple deterministic languages via queries and a representative sample.
203-221
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#TajimaTWT04
2005-05-06
The Generalized XOR Lemma.
331-337
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#ZhengZ04
2005-05-06
Recognizing frozen variables in constraint satisfaction problems.
93-113
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#JonssonK04
2005-05-06
Uniquely decodable n-gram embeddings.
271-284
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Kontorovich04
2005-05-06
A greedy approximation for minimum connected dominating sets.
325-330
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#RuanDJWLK04
2005-05-06
Some minimum merging networks.
237-250
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#MorohashiI04
2005-05-06
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll.
285-301
2004
329
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs329.html#Malewicz04
2005-05-06
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.
553-575
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Mayr05
2005-05-06
Random generation of DFAs.
221-235
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.072
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#ChamparnaudP05
2005-05-06
On the descriptional power of heads, counters, and pebbles.
311-324
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.04.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Kutrib05
2005-05-06
Elimination of spatial connectives in static spatial logics.
475-499
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Lozes05
2005-05-06
Decidability of infinite-state timed CCP processes and first-order LTL.
577-607
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Valencia05
2005-05-06
On the descriptional complexity of finite automata with modified acceptance conditions.
267-285
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#HolzerK05
2005-05-06
Regular frequency computations.
15-21
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#AustinatDHP05
2005-05-06
On the power of randomized multicounter machines.
135-144
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#HromkovicS05
2005-05-06
Succinct representations of languages by DFA with different levels of reliability.
299-310
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.04.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#KappesN05
2005-05-06
On the computational strength of pure ambient calculi.
501-551
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#MaffeisP05
2005-05-06
Complementing unary nondeterministic automata.
349-360
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.04.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#MeraP05
2005-05-06
Tissue P systems with channel states.
101-116
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#FreundPP05
2005-05-06
On two-way nondeterministic finite automata with one reversal-bounded counter.
59-79
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#DangIS05
2005-05-06
The language equivalence problem for HD0L systems having D0L growths.
123-133
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Honkala05
2005-05-06
Context-free insertion-deletion systems.
339-348
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#MargensternPRV05
2005-05-06
Preface: Insightful Theory.
1
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#KarhumakiR05
2005-05-06
CCS with Hennessy's merge has no finite-equational axiomatization.
377-405
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#AcetoFIL05
2005-05-06
State complexity of some operations on binary regular languages.
287-298
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.04.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Jiraskova05
2005-05-06
EDITORIAL: Selected papers of the tenth international workshop on expressiveness in concurrency (EXPRESS 2003).
375-376
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#CorradiniN05
2005-05-06
On the equation in a free semigroup.
117-121
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#HarjuN05
2005-05-06
Synchronizing generalized monotonic automata.
3-13
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#AnanichevV05
2005-05-06
A hierarchy of failures-based models: theory and application.
407-438
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#BoltonL05
2005-05-06
Completions in measure of languages and related combinatorial problems.
35-57
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#CarpiL05
2005-05-06
On two-way communication in cellular automata with a fixed number of cells.
325-338
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.04.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Malcher05
2005-05-06
On the representation of McCarthy's amb in the Pi-calculus.
439-473
2005
330
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#CarayolHS05
2005-05-06
On the size complexity of hybrid networks of evolutionary processors.
205-220
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.07.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#CastellanosLM05
2005-05-06
On the descriptional complexity of some rewriting mechanisms regulated by context conditions.
361-373
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Vaszil05
2005-05-06
Explicit test sets for iterated morphisms in free monoids and metabelian groups.
171-191
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Ruohonen05
2005-05-06
On the number of components in cooperating distributed grammar systems.
195-204
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.03.071
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#Bordihn05
2006-09-12
Mergible states in large NFA.
23-34
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#CampeanuSY05
2005-05-06
Template-guided DNA recombination.
237-250
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#DaleyM05
2005-05-06
Computationally universal P systems without priorities: two catalysts are sufficient.
251-266
2005
330
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2004.06.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#FreundKOS05
2005-05-06
A coding theory construction of new systematic authentication codes.
81-99
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#DingW05
2005-05-06
Decision problems for semi-Thue systems with a few rules.
145-169
2005
330
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs330.html#MatiyasevichS05
2005-05-06
Preface: Automata, Languages and Programming .
1-2
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#OrejasL05
2005-05-06
Realizability and verification of MSC graphs.
97-114
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#AlurEY05
2005-05-06
Performance aspects of distributed caches using TTL-based consistency.
73-96
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#CohenHK05
2005-05-06
A behavioural pseudometric for probabilistic transition systems.
115-142
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#BreugelW05
2005-05-06
Faster gossiping on butterfly networks.
53-72
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#Sibeyn05
2005-05-06
A coordination approach to mobile components.
457-483
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#PattinsonW05
2005-05-06
Semantic models of a timed distributed dataspace architecture.
291-323
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#HoomanP05
2005-05-06
Tree automata with one memory set constraints and cryptographic protocols.
143-214
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#ComonC05
2005-05-06
A calculus for reasoning about software composition.
367-396
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#AchermannN05
2005-05-06
Beyond the Alder-Strassen bound.
3-21
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#Blaser05
2005-05-06
An assertion-based proof system for multithreaded Java.
251-290
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#AbrahamBRS05
2005-05-06
Combinatorics and algorithms for low-discrepancy roundings of a real sequence.
23-36
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#SadakaneTT05
2005-05-06
Amalgamation in the semantics of CASL.
215-247
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#SchroderMTKH05
2005-05-06
A compositional approach to CTL* verification.
397-428
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#KestenP05
2005-05-06
Verification and refinement with fine-grained action-based concurrent objects.
429-455
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#Sekerinski05
2005-05-06
Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types.
325-365
2005
331
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.09.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#FerrariMT05
2005-05-06
Testing hypergraph colorability.
37-52
2005
331
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.09.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs331.html#CzumajS05
2005-05-06
Property-preserving subnet reductions for designing manufacturing systems with shared resources.
461-485
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#HuangJC05
2005-05-06
Determination of Q-convex sets by X-rays.
19-45
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#Daurat05
2005-05-06
Resource-sharing system scheduling and circular chromatic number.
447-460
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#YehZ05
2005-05-06
The wide window string matching algorithm.
391-404
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#HeFS05
2005-05-06
Mixed languages.
179-198
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#BerstelBL05
2005-05-06
Aspects of shuffle and deletion on trajectories.
47-61
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#KariS05
2005-05-06
A note on the Burrows - CWheeler transformation.
567-572
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#CrochemoreDP05
2005-05-06
On the one-sided crossing minimization in a bipartite graph with large degrees.
417-446
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#Nagamochi05
2005-05-06
Online matching on a line.
251-264
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#FuchsHK05
2005-05-06
k-Center problems with minimum coverage.
1-17
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#LimRWX05
2005-05-06
Three-player partizan games.
367-389
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#Cincotti05
2005-05-06
Greedy expansions and sets with deleted digits.
313-336
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#Pedicini05
2005-05-06
Uniformity of quantum circuit families for error-free algorithms.
487-496
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#NishimuraO05
2005-06-01
A new framework for addressing temporal range queries and some preliminary results.
109-121
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#ShiJ05
2006-04-27
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing.
337-366
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#WeihrauchZ05
2005-05-06
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices.
543-557
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#GharaviA05
2005-05-06
Designing small keyboards is hard.
405-415
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#CardinalL05
2005-05-06
Weak Muller acceptance conditions for tree automata.
233-250
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#TorreMN05
2005-05-06
The Thue-Morse word contains circular 5/2+ power free words of every length.
573-581
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#AberkaneC05
2005-05-06
Sequencing by hybridization with errors: handling longer sequences.
559-566
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#Tsur05
2005-05-06
New algorithms for Exact Satisfiability.
515-541
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#ByskovMS05
2005-05-06
On-line vertex-covering.
83-108
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.08.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#DemangeP05
2005-05-06
On the differential approximation of MIN SET COVER.
497-513
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#BazganMPS05
2005-05-06
Derivatives of rational expressions with multiplicity.
141-177
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#LombardyS05
2005-12-12
New bounds for randomized busing.
63-81
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#SeidenCLCD05
2005-05-06
Counting models for 2SAT and 3SAT formulae.
265-291
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#DahllofJW05
2005-05-06
A lower bound on compression of unknown alphabets.
293-311
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#JevticOS05
2005-09-23
The approximability of non-Boolean satisfiability problems and restricted integer programming.
123-139
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#SernaTX05
2005-05-06
Finite graph automata for linear and boundary graph languages.
199-232
2005
332
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs332.html#BrandenburgS05
2005-05-06
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.
355-371
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.04.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#KowalskiP05
2005-05-06
Optimal oblivious routing on d-dimensional meshes.
331-346
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.04.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#Osterloh05
2005-06-09
The Do-All problem with Byzantine processor failures.
433-454
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.06.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#FernandezGRS05
2005-05-06
Locating reaction with 2-categories.
297-327
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#SassoneS05
2005-05-06
Game semantics and linear CPS interpretation.
199-224
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#Laird05
2005-05-06
On routing of wavebands for all-to-all communications in all-optical paths and cycles.
401-413
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.05.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#FlamminiNP05
2005-05-06
Ambiguous classes in mu-calculi hierarchies.
265-296
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#SantocanaleA05
2005-05-06
Verification of cryptographic protocols: tagging enforces termination.
67-90
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#BlanchetP05
2005-05-06
Interval routing in reliability networks.
415-432
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#GavoilleN05
2005-05-06
Normalisation for higher-order calculi with explicit substitutions.
91-125
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#Bonelli05
2005-05-06
Iteration and coiteration schemes for higher-order and nested datatypes.
3-66
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#AbelMU05
2005-05-06
Preface for the Special Issue: Foundations of Software Science and Computation Structures.
1
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#Gordon05
2005-06-16
Domain theory, testing and simulation for labelled Markov processes.
171-197
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#BreugelMOW05
2005-05-06
Preface: Structural Information and Communication Complexity.
329-330
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#PelegS05
2005-05-06
Multitree automata that count.
225-263
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#Lugiez05
2005-05-06
When ambients cannot be opened.
127-169
2005
333
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.10.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#BonevaT05
2005-05-06
Single backup table schemes for shortest-path routing.
347-353
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.06.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#ItoIOY05
2005-05-06
The cost of concurrent, low-contention Read&Modify&Write.
373-400
2005
333
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.04.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs333.html#BuschMS05
2005-05-31
The structure of reflexive regular splicing languages via Sch6uuml;tzenberger constants.
71-98
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#BonizzoniFZ05
2005-05-06
Quantum versus deterministic counter automata.
275-297
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#YamasakiKI05
2005-05-06
Quantum branching programs and space-bounded nonuniform quantum complexity.
177-225
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#SauerhoffS05
2005-05-06
Rewriting P systems: improved hierarchies.
161-175
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.06.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#Mutyam05
2005-05-06
Linear constructions for DNA codes.
99-113
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#GaboritK05
2005-05-06
An optical model of computation.
227-258
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#WoodsN05
2005-05-06
Convergence results for the (1, lambda)-SA-ES using the theory of phi-irreducible Markov chains.
35-69
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#Auger05
2005-05-06
On membrane hierarchy in P systems.
115-129
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.05.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#Ibarra05
2005-05-06
Majority-based reversible logic gates.
259-274
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#YangHSP05
2005-05-06
On properties of bond-free DNA languages.
131-159
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#KariKS05
2005-05-06
Theory of cellular automata: A survey.
3-33
2005
334
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs334.html#Kari05
2005-05-06
Guest editors' foreword: Process Algebra.
127-129
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.01.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#AcetoFIE05
2005-05-06
An inexact-suffix-tree-based algorithm for detecting extensible patterns.
3-14
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#ChattarajP05
2005-05-06
Observational congruences for dynamically reconfigurable tile systems.
331-372
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.10.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#BruniMS05
2005-05-06
Modeling and predicting all-alpha transmembrane proteins including helix-helix pairing.
67-92
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#WaldispuhlS05
2005-05-06
On the complexity of finding emerging patterns.
15-27
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#WangZDL05
2005-05-06
A brief history of process algebra.
131-146
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.07.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#Baeten05
2005-05-06
Exact matching of RNA secondary structure patterns.
53-66
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#XuWZL05
2005-05-06
A randomized encoding of the Pi-calculus with mixed choice.
373-404
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#PalamidessiH05
2005-05-06
Foreword: Pattern Discovery in the Post Genome.
1-2
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#ApostolicoG05
2005-05-06
Polynomial and APX-hard cases of the individual haplotyping problem.
109-125
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#BafnaILR05
2005-05-06
Measuring the performance of asynchronous systems with PAFAS.
187-213
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.01.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#CorradiniV05
2005-05-06
Algorithms for pattern matching and discovery in RNA secondary structure.
29-51
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#MauriP05
2005-05-06
On the usability of process algebra: An architectural view.
281-329
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.10.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#AldiniB05
2005-05-06
Computing the maximum agreement of phylogenetic networks.
93-107
2005
335
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.12.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#ChoyJSS05
2005-05-06
Process algebra for hybrid systems.
215-280
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.04.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#BergstraM05
2005-05-06
Decomposition orders another generalisation of the fundamental theorem of arithmetic.
147-186
2005
335
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs335.html#LuttikO05
2005-07-19
Decidable containment of recursive queries.
33-56
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#CalvaneseGV05
2005-07-19
On the complexity of typechecking top-down XML transformations.
153-180
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#MartensN05
2005-07-19
ASM refinement and generalizations of forward simulation in data refinement: a comparison.
403-435
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#Schellhorn05
2005-07-19
A logic for secure memory access of abstract state machines.
343-365
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#NanchenS05
2005-07-19
Preface.
1-
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#Lenzerini05
2005-07-19
Partial updates.
311-342
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#GurevichT05
2005-07-19
Data exchange: semantics and query answering.
89-124
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#FaginKMP05
2005-07-19
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases.
125-151
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#GeertsK05
2005-07-19
Structural properties of XPath fragments.
3-31
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#BenediktFK05
2005-07-19
Formal description and analysis of a distributed location service for mobile ad hoc networks.
285-309
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#GlasserG05
2005-07-19
On reasoning about structural equality in XML: a description logic approach.
181-203
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#TomanW05
2005-07-19
A principled exploration of coordination models.
367-401
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#RomanP05
2005-07-19
XML queries and constraints, containment and reformulation.
57-87
2005
336
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2004.10.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#DeutschT05
2005-07-19
A high-level modular definition of the semantics of C#.
235-284
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#BorgerFGS05
2005-07-19
Combining test case generation and runtime verification.
209-234
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#ArthoBGHKLPRSVW05
2005-07-19
Abstract state machines and high-level system design and analysis.
205-207
2005
336
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2004.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs336.html#Borger05
2005-07-19
On approximating minimum vertex cover for graphs with perfect matching.
305-318
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#ChenK05
2005-07-19
Generating bicliques of a graph in lexicographic order.
240-248
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#DiasFS05
2005-07-19
A survey on tree edit distance and related problems.
217-239
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#Bille05
2005-07-19
Approximation of Walrasian equilibrium in single-minded auctions.
390-398
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#HuangLZ05
2005-07-19
Embedding longest fault-free paths onto star graphs with more vertex faults.
370-378
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#Hsieh05
2005-07-19
The intractability of computing the Hamming distance.
331-346
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.02.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#MantheyR05
2005-07-19
On the complexity of decidable cases of the commutation problem of languages.
105-118
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.03.073
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#KarhumakiPR05
2005-07-19
On state-alternating context-free grammars.
183-216
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#MoriyaHHO05
2005-07-19
Adding symbolic information to picture models: definitions and properties.
51-104
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#CostagliolaFG05
2005-07-19
Semi-on-line multiprocessor scheduling with given total processing time.
134-146
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#ChengKK05
2005-07-19
The plurality problem with three colors and more.
319-330
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#AignerMM05
2005-07-19
Factors of characteristic words of irrational numbers.
169-182
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#Chuan05
2005-07-19
The generative capacity of block-synchronized context-free grammars.
119-133
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#McQuillan05
2005-07-19
<i>k</i><i>k</i>ge2.
249-277
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#ElkinP05
2005-07-19
The computational complexity of distance functions of two-dimensional domains.
360-369
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.11.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#ChouK05
2005-07-19
Gathering of asynchronous robots with limited visibility.
147-168
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#FlocchiniPSW05
2005-07-19
The complexity of Fibonacci-like kneading sequences.
379-389
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#BruinV05
2005-07-19
Computing unsatisfiable k-SAT instances with few occurrences per variable.
347-359
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.02.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#HooryS05
2005-07-19
Transforming semantics by abstract interpretation.
1-50
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#GiacobazziM05
2005-07-19
On the completeness and decidability of duration calculus with iteration.
278-304
2005
337
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs337.html#GuelevH05
2005-07-21
<sub>p</sub>into a class of timed-probabilistic Petri nets.
350-392
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.02.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#BuenoRC05
2005-07-21
Modular verification of multithreaded programs.
153-183
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#FlanaganFQS05
2005-07-21
Ordering default theories and nonmonotonic logic programs.
127-152
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#Sakama05
2005-07-21
Transition systems without transitions.
1-16
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.09.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#BorzyszkowskiD05
2005-07-21
A fully abstract may testing semantics for concurrent objects.
17-63
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#JeffreyR05
2005-07-21
An axiomatization of bisimulation quantifiers via the mu-calculus.
64-95
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.10.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#DAgostinoL05
2005-07-21
A complexity analysis of functional interpretations.
200-246
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#HernestK05
2005-07-21
Simulation relations for alternating Büchi automata.
275-314
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#FritzW05
2005-07-21
Functions with local state: Regularity and undecidability.
315-349
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#Murawski05
2005-07-21
A method for symbolic analysis of security protocols.
393-425
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#BorealeB05
2005-07-21
On the final sequence of a finitary set functor.
184-199
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#Worrell05
2005-07-21
An NP decision procedure for protocol insecurity with XOR.
247-274
2005
338
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.01.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs338.html#ChevalierKRT05
2005-07-21
Sturmian words and a criterium by Michaux-Villemaire.
88-102
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#AraujoB05
2005-07-21
Pattern avoidance: themes and variations.
7-18
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Currie05
2005-07-21
Preface.
1-2
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#HarjuKR05
2005-07-21
On queuing lengths in on-line switching.
333-343
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#DamaschkeZ05
2005-07-21
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness.
272-292
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#BazganEP05
2005-07-21
A proof of the extended Duval's conjecture.
61-67
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Holub05
2005-07-21
The super connectivity of the pancake graphs and the super laceability of the star graphs.
257-271
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#LinHH05
2005-11-30
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group.
344-371
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Elder05
2005-07-21
Machine-based methods in parameterized complexity theory.
167-199
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#ChenFG05
2005-07-21
Space efficient search for maximal repetitions.
35-48
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#GasieniecKP05
2005-07-21
Optimal semi-online preemptive algorithms for machine covering on two uniform machines.
293-314
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.02.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#HeJ05
2005-07-21
The algebra of binary search trees.
129-165
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#HivertNT05
2005-07-21
Sequences of linear arithmetical complexity.
68-87
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Frid05
2005-07-21
On the power of Ambainis lower bounds.
241-256
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.01.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Zhang05
2005-07-21
Generalised fine and Wilf's theorem for arbitrary number of periods.
49-60
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#ConstantinescuI05
2005-07-21
Divisibility problem for one relator monoids.
3-6
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Adian05
2005-07-21
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations.
200-240
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.02.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#Maletti05
2005-07-21
Short length Menger's theorem and reliable optical routing.
315-332
2005
339
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#BagchiCK05
2005-07-21
Avoiding large squares in infinite binary words.
19-34
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#RampersadSW05
2005-07-21
On a conjecture about finite fixed points of morphisms.
103-128
2005
339
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.01.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs339.html#LeveR05
2005-07-22
Counting bordered and primitive words with a fixed weight.
273-279
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#HarjuN05a
2005-07-22
Collage of two-dimensional words.
364-380
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#ChoffrutD05
2005-07-22
An enhanced property of factorizing codes.
240-256
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Felice05
2005-07-22
A computational interpretation of Dolev-Yao adversaries.
57-81
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Herzog05
2005-07-22
Regular splicing languages and subclasses.
349-363
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#BonizzoniM05
2005-07-22
Algebraic recognizability of regular tree languages.
291-321
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#EsikW05
2005-07-22
Growth of repetition-free words -- a review.
280-290
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Berstel05
2005-07-22
Small size quantum automata recognizing some regular languages.
394-407
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#BertoniMP05
2005-07-22
Codes and sofic constraints.
381-393
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#BealP05
2005-07-22
Codes of central Sturmian words.
220-239
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#CarpiL05a
2005-07-22
Measuring the confinement of probabilistic systems.
3-56
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#PierroHW05
2005-07-22
A semantics for web services authentication.
102-153
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#BhargavanFG05
2005-07-22
Tile rewriting grammars and picture languages.
257-272
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Crespi-ReghizziP05
2005-07-22
Parsing with a finite dictionary.
432-442
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#ClementDGPR05
2005-07-22
Using data-independence in the analysis of intrusion detection systems.
82-101
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#RohrmairL05
2005-07-22
Weakening the perfect encryption assumption in Dolev-Yao adversaries.
154-178
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#ZuninoD05
2005-07-22
A topological approach to transductions.
443-456
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#PinS05
2005-07-22
Palindromic factors of billiard words.
334-348
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#BorelR05
2005-07-22
Preface.
179-185
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#LucaMPR05
2005-07-22
Connections between subwords and certain matrix mappings.
188-203
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Salomaa05
2005-07-22
Words derivated from Sturmian words.
204-219
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#AraujoB05a
2005-07-22
Commutation with codes.
322-333
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#KarhumakiLP05
2005-07-22
Theoretical foundations of security analysis and design II.
1-2
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#GorrieriM05
2005-07-22
New operations and regular expressions for two-dimensional languages over one-letter alphabet.
408-431
2005
340
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.03.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#AnselmoGM05
2006-01-10
<i>pi</i>-calculus.
539-576
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#MontanariP05
2006-01-10
Informative labeling schemes for graphs.
577-593
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Peleg05
2006-01-10
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000.
457-458
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#NielsenR05
2006-01-10
A hierarchy result for read-once branching programs with restricted parity nondeterminism.
594-605
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#SavickyS05
2006-01-10
<i>lambda</i>-terms using intersection types.
459-495
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#Dezani-CiancagliniHM05
2006-01-10
Radiocoloring in planar graphs: Complexity and approximations.
514-538
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#FotakisNPS05
2006-01-10
Explicit fusions.
606-630
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#WischikG05
2006-01-10
Subtractive reductions and complete problems for counting complexity classes.
496-513
2005
340
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.03.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs340.html#DurandHK05
2006-01-10
<i>D</i><i>L</i>systems.
247-262
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#CasesM05
2006-01-10
Continuity and computability of reachable sets.
162-195
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.05.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#Collins05
2006-01-10
Oblivious polynomial evaluation and oblivious neural learning.
39-54
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.049
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#ChangL05
2006-01-10
Probabilistic analysis of algorithms for the Dutch national flag problem.
398-410
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.047
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#Chen05
2006-01-10
Synchronized shuffles.
263-275
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#BeekMM05
2006-01-10
Topology matters: Smoothed competitiveness of metrical task systems.
216-246
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#SchaferS05
2006-01-10
The size of subsequence automaton.
379-384
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#TronicekS05
2006-01-10
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography.
55-72
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.050
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#HeubergerKPR05
2006-01-10
<sup>,</sup>.
411-440
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#HungC05
2006-01-10
Uniform test of algorithmic randomness over a general space.
91-137
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.054
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#Gacs05
2006-01-10
Oracles for vertex elimination orderings.
73-90
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.051
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#Sawada05
2006-01-10
Improved approximation of the minimum cover time.
22-38
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#ChlamtacF05
2006-01-10
<i>e</i><sup>,</sup>.
344-363
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.06.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#DangIS05a
2006-01-10
Inequalities characterizing standard Sturmian and episturmian words.
276-292
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#Pirillo05
2006-01-10
A robust algorithm for bisecting a triconnected graph with two resource sets.
364-378
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.06.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#NagamochiII05
2006-01-10
Strong Rabin numbers of folded hypercubes.
196-215
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.02.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#LaiC05
2006-01-10
The approximability of the weighted Hamiltonian path completion problem on a tree.
385-397
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.03.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#WuLL05
2006-01-10
Results on multiples of primitive polynomials and their products over GF(2).
311-343
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#MaitraGV05
2006-01-11
An improved model-based method to test circuit faults.
150-161
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#ChengOYZ05
2006-01-10
Some properties of one-pebble Turing machines with sublogarithmic space.
138-149
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#InoueIIO05
2006-01-10
Smooth words over arbitrary alphabets.
293-310
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.04.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#BertheBC05
2006-01-10
Constructing divisions into power groups.
1-21
2005
341
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2004.12.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs341.html#AuingerS05
2006-01-10
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects.
149-172
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#AgerDM05
2006-01-10
Containers: Constructing strictly positive types.
3-27
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#AbbottAG05
2006-01-10
Probabilistic temporal logics via the modal mu-calculus.
316-350
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.048
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#CleavelandIN05
2006-01-10
Locally Boolean domains.
132-148
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#Laird05a
2006-01-10
Bisimulation relations for dynamical, control, and hybrid systems.
229-261
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#HaghverdiTP05
2006-01-10
Modelling dynamic web data.
104-131
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#GardnerM05
2006-01-10
Extracting a data flow analyser in constructive logic.
56-78
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#CacheraJPR05
2006-01-10
The recognizability of sets of graphs is a robust property.
173-228
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#CourcelleW05
2006-01-10
On a monadic semantics for freshness.
28-55
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#ShinwellP05
2006-01-10
Temporal stratification tests for linear and branching-time deductive databases.
382-415
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.05.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#NomikosRG05
2006-01-10
Any-world assumptions in logic programming.
351-381
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.04.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#LoyerS05
2006-01-10
Precedence-inclusion patterns and relational learning.
262-315
2005
342
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#Oles05
2006-01-10
Applied semantics: Selected topics.
1-2
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#Moggi05
2006-01-10
Weak linearization of the lambda calculus.
79-103
2005
342
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs342.html#AlvesF05
2006-01-10
The first order definability of graphs with separators via the Ehrenfeucht game.
158-176
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Verbitsky05
2006-01-10
Non-cooperative computation: Boolean functions with correctness and exclusivity.
97-113
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#ShohamT05
2006-01-10
Syntax vs. semantics: A polarized approach.
177-206
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Laurent05
2006-01-10
Games for complexity of second-order call-by-name programs.
207-236
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Murawski05a
2006-01-10
A proof outline logic for object-oriented programming.
413-442
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#PierikB05
2006-01-10
Polarized process algebra with reactive composition.
285-304
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#BergstraB05
2006-01-10
Sequential algorithms and strongly stable functions.
237-281
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Mellies05
2006-01-10
Formal specification and verification of the C# thread model.
482-508
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Stark05
2006-01-10
Parameterised boolean equation systems.
332-369
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#GrooteW05
2006-01-10
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
27-41
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#AmbuhlCPRS05
2006-01-10
Games on triangulations.
42-71
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#AichholzerBDHKKRSU05
2006-01-10
A mathematical model for the TCP Tragedy of the Commons.
4-26
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#LopezAPF05
2006-01-10
Slicing techniques for verification re-use.
509-528
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Wehrheim05
2006-01-10
Preface.
283-284
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#BoerB05
2006-01-10
Semantic essence of AsmL.
370-412
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#GurevichRS05
2006-01-10
Computation in a distributed information market.
114-132
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#FeigenbaumFPS05
2006-01-10
Behavioural specification for hierarchical object composition.
305-331
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Diaconescu05
2006-01-10
A tutorial on coinductive stream calculus and signal flow graphs.
443-481
2005
343
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#Rutten05
2006-01-10
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation.
72-96
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#HearnD05
2006-01-10
Structure and complexity of extreme Nash equilibria.
133-157
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#GairingLMMS05
2006-01-10
Game Theory Meets Theoretical Computer Science.
1-3
2005
343
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs343.html#AbramskyM05
2006-01-10
Preface.
1-2
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#NikoletseasR05
2006-01-10
Towards a dynamical model for wireless sensor networks.
69-85
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#LeoneR05
2006-01-10
The one-dimensional Ising model: Mutation versus recombination.
208-225
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#FischerW05
2006-01-10
On determinism versus nondeterminism in P systems.
120-133
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.052
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Ibarra05a
2006-01-10
On a conjecture related to geometric routing.
3-14
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#PapadimitriouR05
2006-01-10
Theoretical aspects of connectivity-based multi-hop positioning.
47-68
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#ODellW05
2006-01-10
Ant colony optimization theory: A survey.
243-278
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.05.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#DorigoB05
2006-01-10
Scale-free aggregation in sensor networks.
15-29
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#EnachescuGGM05
2006-01-10
A boundary result on enhanced time-varying distributed H systems with parallel computations.
226-242
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.056
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Verlan05
2006-01-10
The computational power of Benenson automata.
279-297
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#SoloveichikW05
2006-01-10
Preface.
101-102
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Rozenberg05
2006-01-10
A theory of computation based on quantum logic (I).
134-207
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Ying05
2006-01-10
Quantum and classical tradeoffs.
335-345
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.03.053
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Shi05
2006-01-10
The expected uncertainty of range-free localization protocols in sensor networks.
86-99
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#StuppS05
2006-01-10
From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data.
298-334
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#Goulon-Sigwalt-AbramDD05
2006-01-10
Exact and approximate balanced data gathering in energy-constrained sensor networks.
30-46
2005
344
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.06.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#FloreenKKO05
2006-09-01
Absolute exponential stability of a class of recurrent neural networks with multiple and variable delays.
103-119
2005
344
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs344.html#LuSC05
2006-01-10
From complementation to certification.
83-100
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#KupfermanV05
2006-01-10
The dual of concatenation.
425-447
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#Okhotin05
2006-01-10
One query reducibilities between partial information classes.
173-189
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BabN05
2006-01-10
Special issue.
1
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#JensenP05
2006-01-10
A reducibility for the dot-depth hierarchy.
448-472
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#SelivanovW05
2006-01-10
Decidability of trajectory-based equations.
304-330
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#DomaratzkiS05
2006-01-10
Graph exploration by a finite automaton.
331-344
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#FraigniaudIPPP05
2006-01-10
A class of polynomially solvable range constraints for interval analysis without widenings.
122-138
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#SuW05
2006-01-10
The complexity of equivalence and isomorphism of systems of equations over finite groups.
406-424
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#Nordh05
2006-01-10
More efficient on-the-fly LTL verification with Tarjan's algorithm.
60-82
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#GeldenhuysV05
2006-01-10
The enumerability of P collapses P to NC.
248-259
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BeygelzimerO05
2006-01-10
A new dimension sensitive property for cellular automata.
235-247
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BernardiDFK05
2006-01-10
Preface.
171-172
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#KoubekK05
2006-01-10
<i>xyz</i><i>zvx</i>: A short proof.
296-303
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#Czeizler05
2006-01-10
Sublogarithmic ambiguity.
473-504
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#Wich05
2006-01-10
Resource bounded symmetry of information revisited.
386-405
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#LeeR05
2006-01-10
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes.
2-26
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BaierHKH05
2006-01-10
A generalization of repetition threshold.
359-369
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#IlieOS05
2006-01-10
Model checking discounted temporal properties.
139-170
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#AlfaroFHMS05
2006-01-10
A hierarchy of shift equivalent sofic shifts.
190-205
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BealFP05
2006-01-10
Generation problems.
260-295
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BohlerGSW05
2006-01-10
All superlinear inverse schemes are coNP-hard.
345-358
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#HemaspaandraHH05
2006-01-10
An interpolating theorem prover.
101-121
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#McMillan05
2006-01-10
A partial order semantics approach to the clock explosion problem of timed automata.
27-59
2005
345
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.07.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#LugiezNZ05
2006-01-10
Universal test for quantum one-way permutations.
370-385
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#KawachiKKP05
2006-01-10
<sup>,</sup>.
206-234
2005
345
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs345.html#BeaudryFH05
2006-04-18
Three dimensional Narayana and Schröder numbers.
455-468
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Sulanke05
2006-04-18
In memoriam: Alberto Del Lungo (1965-2003).
184-188
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#PergolaR05a
2006-04-18
On finite-state approximants for probabilistic computation tree logic.
113-134
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Huth05
2006-04-19
A semantic framework for the abstract model checking of tccp programs.
58-95
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#AlpuenteGPV05
2006-04-18
A solution to the tennis ball problem.
254-264
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#MierN05
2006-04-18
Separable equilibrium state probabilities via time reversal in Markovian process algebra.
161-182
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#HarrisonL05
2006-04-18
Quantitative mu-calculus and CTL defined over constraint semirings.
135-160
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Lluch-LafuenteM05
2006-04-18
Reconstruction of convex polyominoes from orthogonal projections of their contours.
439-454
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Picouleau05
2006-04-18
Quantitative information in the tuple space coordination model.
28-57
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#BravettiGLZ05
2006-04-18
<i>HOL</i>.
96-112
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#HurdMM05
2006-04-18
Implicit surface visualization of reconstructed biological molecules.
281-299
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#GardunoH05
2006-04-18
A multidimensional critical factorization theorem.
265-280
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#EpifanioM05
2006-04-18
<i>D</i>-gon tilings.
226-253
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#ChavanonLMRV05
2006-04-18
The discrete Green Theorem and some applications in discrete geometry.
200-225
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#BrlekLL05
2006-04-18
A theory for execution-time derivation in real-time programs.
3-27
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#LermerFH05
2006-04-18
Preface.
183
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#PergolaR05
2006-04-18
Rauzy substitutions and multi-dimensional Sturmian words.
469-489
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Tijdeman05
2006-04-18
A sufficient condition for non-uniqueness in binary tomography with absorption.
335-357
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#KubaN05
2006-04-18
Efficient iteration in admissible combinatorial classes.
388-417
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#MartinezM05
2006-04-18
Minimal change list for Lucas strings and some graph theoretic consequences.
189-199
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#BarilV05
2006-04-18
Reduction from three-dimensional discrete tomography to multicommodity flow problem.
300-306
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Gerard05
2006-04-18
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis.
358-387
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Louchard05
2006-04-18
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice.
307-334
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#Gouyou-BeauchampsL05
2006-04-18
Preface.
1-2
2005
346
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.08.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#CeroneP05
2006-04-18
On computing the coefficients of bivariate holonomic formal series.
418-438
2005
346
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.08.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs346.html#MassazzaR05
2006-04-18
<i>mu</i><i>lambda</i>-semirings.
423-431
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.08.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#FengZJ05
2006-04-18
A characterization of periodicity of bi-infinite words.
419-422
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2004.08.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#HarjuLN05
2006-04-18
Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253].
437-440
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#ChamparnaudC05
2006-04-18
Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars.
167-190
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Asveld05
2006-04-18
Linear deterministic multi bottom-up tree transducers.
276-287
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#FulopKV05
2006-04-18
Additive sparse spanners for graphs with bounded length of largest induced cycle.
54-75
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#ChepoiDY05
2006-04-18
The conflict-free Reduction Geometry.
465-497
2005
347
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2004.07.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#KhasidashviliG05
2006-04-18
A structural approach to reversible computation.
441-464
2005
347
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.07.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Abramsky05
2006-04-18
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.
288-298
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#LiuC05
2006-04-18
On Floyd and Rivest's SELECT algorithm.
214-238
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Kiwiel05
2006-04-18
Some necessary clarifications about the chords' problem and the Partial Digest Problem.
432-436
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#DauratGN05
2006-04-18
Random generation of Q-convex sets.
393-414
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#BrunettiD05
2006-04-18
Enumeration of L-convex polyominoes by rows and columns.
336-352
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#CastiglioneFRR05
2006-04-18
Reconciling a gene tree to a species tree under the duplication cost model.
36-53
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#BonizzoniVD05
2006-04-18
Sequential and indexed two-dimensional combinatorial template matching allowing rotations.
239-275
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#FredrikssonNU05
2006-04-18
On converting CNF to DNF.
325-335
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#MiltersenRW05
2006-04-18
There is no efficient reverse derivation mode for discrete derivatives.
299-305
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Schost05
2006-04-18
Cayley continuants.
353-369
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#MunariniT05
2006-04-18
An introduction to periodical discrete sets from a tomographical perspective.
370-392
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#FrosiniNV05
2006-04-18
Positive varieties of tree languages.
1-35
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#PetkovicS05
2006-04-18
On the relationship between NLC-width and linear NLC-width.
76-89
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#GurskiW05
2006-04-18
A representation theorem for Boolean contact algebras.
498-512
2005
347
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#DuntschW05
2006-04-18
Dependences related to strict binary relations.
306-324
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#HsiaoYY05
2006-04-18
Fuzzy context-free languages - Part 2: Recognition and parsing algorithms.
191-213
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.06.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Asveld05a
2006-04-18
A note on the circuit complexity of PP.
415-418
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.07.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#Vinodchandran05
2006-04-18
Efficient gossip and robust distributed computation.
130-166
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.05.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#GeorgiouKS05
2006-04-18
Resource bounded immunity and simplicity.
90-129
2005
347
Theor. Comput. Sci.
1-2
http://dx.doi.org/10.1016/j.tcs.2005.03.055
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs347.html#YamakamiS05
2006-04-18
Efficiently computing succinct trade-off curves.
334-356
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#VassilvitskiiY05
2006-04-18
A time lower bound for satisfiability.
311-320
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#MelkebeekR05
2006-04-18
Simple permutations mix well.
251-261
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#HooryMMR05
2006-04-18
Learning taxonomic relation by case-based reasoning.
58-69
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Satoh05
2006-04-18
Selfish unsplittable flows.
226-239
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#FotakisKS05
2006-04-18
LA, permutations, and the Hajós Calculus.
321-333
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Soltys05
2006-04-18
Linear tolls suffice: New bounds and algorithms for tolls in single source networks.
217-225
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Fleischer05
2006-04-18
Inductive inference of approximations for recursive concepts.
15-40
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#LangeGZ05
2006-04-18
Preface.
1-2
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#ArimuraJ05
2006-04-18
On approximate learning by multi-layered feedforward circuits.
95-127
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#DasGuptaH05
2006-04-18
Preface.
129
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#DiazK05
2006-04-18
Prediction-hardness of acyclic conjunctive queries.
84-94
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Hirata05
2006-04-18
Sequential sampling techniques for algorithmic learning theory.
3-14
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Watanabe05
2006-04-18
Learning erasing pattern languages with queries.
41-57
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#NesselL05
2006-04-18
The minimum-entropy set cover problem.
240-250
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#HalperinK05
2006-04-19
Locally consistent constraint satisfaction problems.
187-206
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#DvorakKP05
2006-04-18
Learning from positive and unlabeled examples.
70-83
2005
348
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#DenisGL05
2006-04-18
On graph problems in a semi-streaming model.
207-216
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#FeigenbaumKMSZ05
2006-04-18
A new algorithm for optimal 2-constraint satisfaction and its implications.
357-365
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Williams05
2006-04-18
Regular solutions of language inequalities and well quasi-orders.
277-293
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#Kunc05
2006-04-18
The complexity of partition functions.
148-186
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#BulatovG05
2006-04-18
Elementarily computable functions over the real numbers and R-sub-recursive functions.
130-147
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#BournezH05
2006-04-18
Close to optimal decentralized routing in long-range contact networks.
294-310
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#LebharS05
2006-04-18
The black-box complexity of nearest-neighbor search.
262-276
2005
348
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.09.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs348.html#KrauthgamerL05
2006-04-18
The complexity of Kemeny elections.
382-391
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.08.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#HemaspaandraSV05
2006-04-18
Static analysis based on formal models and incremental computation in Go programming.
184-201
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Nakamura05
2006-04-18
List matrix partitions of chordal graphs.
52-66
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#FederHKNP05
2006-04-18
On the expected time for Herman's probabilistic self-stabilizing algorithm.
475-483
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.05.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Nakata05
2006-04-18
<i>L</i><i>d</i><i>s</i>)-labelings.
92-98
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#KohlSTV05
2006-04-18
Foreword.
121-122
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#HerikI05
2006-04-18
Learning to score final positions in the game of Go.
168-183
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#WerfHU05
2006-04-18
Some results about the chaotic behavior of cellular automata.
318-336
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.06.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BlanchardCF05
2006-04-18
<i>p</i><i>k</i>)-coloring problems in line graphs.
462-474
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.09.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#DemangeEW05
2006-04-18
<i>P</i><sub>5</sub>, gem)-free graphs.
2-21
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BodlaenderBKRS05
2006-04-19
Permuting machines and priority queues.
309-317
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.07.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#AldredADHHM05
2006-04-18
Conway's Angel in three dimensions.
443-451
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.08.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Kutz05
2006-04-18
Graphical condensation of plane graphs: A combinatorial approach.
452-461
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.09.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#YanYZ05
2006-04-18
Locating factors of the infinite Fibonacci word.
429-442
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.08.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#ChuanH05
2006-04-18
Unresolved systems of language equations: Expressive power and decision problems.
283-308
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.07.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Okhotin05a
2006-04-27
D2B: A de Bruijn based content-addressable network.
65-79
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#FraigniaudG06
2006-04-18
Fano colourings of cubic graphs and the Fulkerson Conjecture.
112-120
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#MacajovaS05
2006-04-18
Selecting evaluation functions in Opponent-Model search.
245-267
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.049
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#DonkersHU05
2006-04-18
Chess endgames: 6-man data and strategy.
140-157
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BourzutschkyTH05
2006-04-18
A complete complexity classification of the role assignment problem.
67-81
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#FialaP05
2006-04-18
<sub>2</sub><sup>P</sup>-complete.
99-111
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Kral05
2006-04-18
The chord version for SONET ADMs minimization.
337-346
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.07.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#EpsteinL05
2006-04-18
Combinatorial structure and randomized subexponential algorithms for infinite games.
347-360
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.07.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BjorklundV05
2006-04-18
Solving 7x7 Hex with domination, fill-in, and virtual connections.
123-139
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#HaywardBJKPR05
2006-04-18
<i>Delta</i>-coloring of graphs with low average degree.
82-91
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#KostochkaN05
2006-04-19
Deeper model endgame analysis.
158-167
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#AndristH05
2006-04-18
Equitable colorings of bounded treewidth graphs.
22-30
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BodlaenderF05
2006-04-18
Bias and pathology in minimax search.
268-281
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.073
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#SadikovBK05
2006-04-18
H-Coloring dichotomy revisited.
31-39
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Bulatov05
2006-04-18
The chromatic and clique numbers of random scaled sector graphs.
40-51
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.050
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#DiazSSS05
2006-04-18
<i>c</i>-cliques.
484-490
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.09.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#CazalsK05
2006-04-18
Tuning evaluation functions by maximizing concordance.
202-229
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.047
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#GombocBM05
2006-04-18
Partial Digest is hard to solve for erroneous input data.
361-381
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.08.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#CieliebakEP05
2006-04-18
Segmental partially ordered generalized patterns.
420-428
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.09.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Kitaev05
2006-04-18
Entropy rates and finite-state dimension.
392-406
2005
349
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.09.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#BourkeHV05
2006-04-18
An evaluation function for the game of amazons.
230-244
2005
349
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.048
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#Lieberum05
2006-04-18
Hypothesis finding with proof theoretical appropriateness criteria.
140-162
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#FronhoferY06
2006-04-18
Mathematics based on incremental learning - Excluded middle and inductive inference.
125-139
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Hayashi06
2006-04-18
Games with winning conditions of high Borel complexity.
345-372
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Serre06
2006-04-18
A categorical model for the geometry of interaction.
252-274
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#HaghverdiS06
2006-04-18
Interactive observability in Ludics: The geometry of tests.
213-233
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Faggian06
2006-04-18
Towards an algebraic theory of typed mobile processes.
188-212
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#DengS06
2006-04-18
Tree-walking automata cannot be determinized.
164-173
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#BojanczykC06
2006-04-19
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.
40-48
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#ForsterS06
2006-04-18
Foreword.
1-2
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Cesa-BianchiRZ06
2006-04-18
A non-learnable class of E-pattern languages.
91-102
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Reidenbach06
2006-04-18
Entropy as a fixed point.
292-324
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Martin06
2006-04-18
A calculus of coroutines.
275-291
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Laird06
2006-04-18
Backtracking games and inflationary fixed points.
174-187
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#DawarGK06
2006-04-19
Syntactic control of concurrency.
234-251
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#GhicaMO06
2006-04-18
Preface.
163
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Sannella06
2006-04-19
Unifying logic, topology and learning in Parametric logic.
103-124
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#MartinSS06
2006-04-18
On learning embedded midbit functions.
13-23
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Servedio06
2006-04-18
Ordered term tree languages which are polynomial time inductively inferable from positive data.
63-90
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#SuzukiSUM06
2006-04-18
On the expressive power of monadic least fixed point logic.
325-344
2006
350
Theor. Comput. Sci.
2-3
http://dx.doi.org/10.1016/j.tcs.2005.10.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#Schweikardt06
2006-04-18
Maximizing agreements and coagnostic learning.
24-39
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#BshoutyB06
2006-04-18
On learning monotone Boolean functions under the uniform distribution.
3-12
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#AmanoM06
2006-04-18
The complexity of learning concept classes with polynomial general dimension.
49-62
2006
350
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.10.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs350.html#KoblerL06
2006-04-18
Parameterized algorithms for feedback set problems and their duals in tournaments.
446-458
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#RamanS06
2006-04-18
Parameterized coloring problems on chordal graphs.
407-424
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Marx06a
2006-04-18
Parameterized graph separation problems.
394-406
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Marx06
2006-04-18
Using interval arithmetic to prove that a set is path-connected.
119-128
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.055
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#DelanoueJC06
2006-04-18
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction.
337-350
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Damaschke06
2006-04-18
Components as coalgebras: The refinement dimension.
276-294
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.072
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#MengB06
2006-04-18
A language for configuring multi-level specifications.
146-166
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.065
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#HillV06
2006-04-18
Chordless paths through three vertices.
360-371
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#HaasH06
2006-04-18
Quadrature using 64-bit IEEE arithmetic for integrands over [0, 1] with a singularity at 1.
82-100
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.057
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#HillR06
2006-04-18
Three concepts of decidability for general subsets of uncountable spaces.
2-13
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.052
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Parker06
2006-04-18
Extending separation logic with fixpoints and postponed substitution.
258-275
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.071
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Sims06
2006-04-18
Stability versus speed in a computable algebraic model.
14-26
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.053
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Ziegler06
2006-04-18
Semantics of plan revision in intelligent agents.
240-257
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.070
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#RiemsdijkMB06
2006-04-18
Looking at the stars.
437-445
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#PrietoS06
2006-04-18
Simplifying the weft hierarchy.
303-313
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#BussI06
2006-04-18
The design of the Boost interval arithmetic library.
111-118
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.062
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#BronnimannMP06
2006-04-18
Preface.
129-130
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.063
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#MaharajSR06
2006-04-18
State space reduction for process algebra specifications.
131-145
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.064
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#GaravelS06
2006-04-18
On miniaturized problems in parameterized complexity theory.
314-336
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#ChenF06
2006-04-18
Divergence bounded computable real numbers.
27-38
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.054
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#ZhengLB06
2006-04-18
Admissible digit sets.
61-73
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.059
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#HughesN06
2006-04-18
Specification and refinement of mobile systems in MTLA and mobile UML.
184-202
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.067
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#KnappMWZ06
2006-04-18
Algebras of modal operators and partial correctness.
221-239
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.069
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#MollerS06
2006-04-18
On finding short resolution refutations and small unsatisfiable subsets.
351-359
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#FellowsSW06
2006-04-18
Preface.
1
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.051
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#DaumasR06
2006-04-18
Implementing exact real arithmetic in python, C++ and C.
74-81
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.058
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Briggs06
2006-04-18
Formal design and verification of operational transformation algorithms for copies convergence.
167-183
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.066
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#ImineROM06
2006-04-18
Moving policies in cyclic assembly line scheduling.
425-436
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Muller-HannemannW06
2006-04-18
Choosing starting values for certain Newton-Raphson iterations.
101-110
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.056
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#KornerupM06
2006-04-18
Modelling concurrent interactions.
203-220
2006
351
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.09.068
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Kuster-Filipe06
2006-04-18
Compatibility of unrooted phylogenetic trees is FPT.
296-302
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#BryantL06
2006-09-22
Editorial.
295
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#DowneyLN06
2006-04-18
Computations with effective real numbers.
52-60
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.060
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#Hoeven06
2006-04-18
A certified, corecursive implementation of exact real numbers.
39-51
2006
351
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.061
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#CiaffaglioneG06
2006-04-18
Trees, grids, and MSO decidability: From graphs to matroids.
372-393
2006
351
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.10.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs351.html#HlinenyS06
2006-04-18
Hierarchies for classes of priority algorithms for Job Scheduling.
181-189
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Papakonstantinou06
2006-04-18
A characterization of the words occurring as factors in a minimum number of words.
329-331
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Tomescu06
2006-04-18
Minimum connected dominating sets and maximal independent sets in unit disk graphs.
1-7
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.08.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#WuDJLH06
2006-04-18
Range assignment for energy efficient broadcasting in linear radio networks.
332-341
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#DasDN06
2006-04-18
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields.
293-305
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.045
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Ballet06
2006-04-18
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].
347-348
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#KrumkePPS06
2006-04-18
On the complexity of unsigned translocation distance.
322-328
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.09.078
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#ZhuW06
2006-04-18
<sub>d</sub>N networks under various routing strategies.
232-239
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.048
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#ChangGH06
2006-04-18
A metric index for approximate string matching.
266-279
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#NavarroC06
2006-04-19
Approximate string matching using compressed suffix arrays.
240-249
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#HuynhHLS06
2006-04-18
On the solvability of a class of diophantine equations and applications.
342-346
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#IbarraD06
2006-04-18
The DNF exception problem.
85-96
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#MubayiTZ06
2006-04-18
Rearrangeability of bit permutation networks.
197-214
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.09.077
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#BaoHL06
2006-04-18
The binomial transform and the analysis of skip lists.
136-158
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.041
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#PobleteMP06
2006-04-18
Security analysis of a password-based authentication protocol proposed to IEEE 1363.
280-287
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#ZhaoDW06
2006-04-18
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform.
8-30
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.09.074
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#HitczenkoJH06
2006-04-18
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups.
57-70
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.09.076
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Tanaka06
2006-04-18
On the max-flow min-cut ratio for directed multicommodity flows.
318-321
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#HajiaghayiL06
2006-04-18
Combinatorial properties of smooth infinite words.
306-317
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#BrlekDLV06
2006-04-18
Efficient algorithms for robustness in resource allocation and scheduling problems.
250-265
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#FredericksonS06
2006-04-18
Sequential and parallel algorithms for the NCA problem on pure pointer machines.
108-135
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.040
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#PaluPR06
2006-04-18
<i>K</i><sub>max</sub><i>K</i><sub>min</sub>on computable partially ordered sets.
159-180
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Ferbus-ZandaG06
2006-04-18
On the positional determinacy of edge-labeled games.
190-196
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.046
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#ColcombetN06
2006-04-18
Closure properties of cellular automata.
97-107
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Terrier06
2006-04-18
Set of periods of additive cellular automata.
226-231
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.050
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Moothathu06
2006-04-18
Approximation schemes for knapsack problems with shelf divisions.
71-84
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#XavierM06
2006-04-18
Satgraphs and independent domination. Part 1.
47-56
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.08.038
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Zverovich06
2006-04-18
<i>GF</i><sup><i>n</i></sup>).
288-292
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#YoussefG06
2006-04-18
Occurrences of palindromes in characteristic Sturmian words.
31-46
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.09.075
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#Glen06
2006-04-18
Independent domination in hereditary classes.
215-225
2006
352
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.049
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs352.html#ZverovichZ06
2006-04-18
Similarity between preferential models.
26-52
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.08.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Zhu06
2006-04-18
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols.
118-164
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.044
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#MitchellRST06
2006-04-18
<i>lambda</i>-calculus.
1-25
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.06.037
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Schroder06
2006-04-18
Structure of proofs and the complexity of cut elimination.
63-70
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.07.042
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Zhang06
2006-04-18
Testing against a non-controllable stream X-machine using state counting.
291-316
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Ipate06
2006-04-18
<i>CTL</i><sup>*</sup>model checking for time Petri nets.
208-227
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#BouchenebH06
2006-04-18
Specification, testing and implementation relations for symbolic-probabilistic systems.
228-248
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.047
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#LopezNR06
2006-04-18
Linear and affine logics with temporal, spatial and epistemic operators.
165-207
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Kamide06
2006-04-18
Automatic semigroups and categories.
272-290
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.021
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#Kambites06
2006-04-18
Automatic workflow verification and generation.
71-92
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.10.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#LuBL06
2006-04-18
Complete axiomatization and decidability of Alternating-time temporal logic.
93-117
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.07.043
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#GorankoD06
2006-04-18
Efficient timed model checking for discrete-time systems.
249-271
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.11.020
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#LaroussinieMS06
2006-04-18
On a problem of Fagin concerning multivalued dependencies in relational databases.
53-62
2006
353
Theor. Comput. Sci.
1-3
http://dx.doi.org/10.1016/j.tcs.2005.08.036
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs353.html#HartmannL06
2006-04-18
Preface.
319
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.028
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#LingasG06
2006-04-18
Refinement calculus: A basis for translation validation, debugging and certification.
153-168
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#KundajiS06
2006-04-18
On boundaries of highly visible spaces and applications.
379-390
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.027
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#ReifS06
2006-04-18
<i>mu</i>-calculus.
173-186
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#HenzingerKM06
2006-04-18
Compositionality of Hennessy-Milner logic by structural operational semantics.
421-440
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.035
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#FokkinkGW06
2006-04-18
Metaphors and heuristic-driven theory projection (HDTP).
98-117
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#GustKS06
2006-04-18
Computational depth: Concept and applications.
391-404
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.033
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#AntunesFMV06
2006-04-18
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT.
339-353
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.030
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Asano06
2006-04-18
Closure properties of linear context-free tree languages with an application to optimality theory.
82-97
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#KepserM06
2006-04-18
Compositional analysis for verification of parameterized systems.
211-229
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#BasuR06
2006-04-18
Generating all permutations by context-free grammars in Chomsky normal form.
118-130
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Asveld06
2006-04-18
Schedulability analysis of fixed-priority systems using timed automata.
301-317
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.019
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#FersmanMPY06
2006-04-18
Editorial.
1-3
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#NijholtSM06
2006-04-18
Sorted dependency insertion grammars.
142-152
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#GramatoviciM06
2006-04-18
Efficient transitive closure of sparse matrices over closed semirings.
72-81
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Penn06
2006-04-18
Uniqueness logic.
24-41
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Harrington06
2006-04-18
CSP-CASL - A new integration of process algebra and algebraic specification.
42-71
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Roggenbach06
2006-04-18
TACAS 2003 Special Issue - Preface.
169-172
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#GaravelH06
2006-04-19
Scheduling with timed automata.
272-300
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.018
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#AbdeddaimAM06
2006-04-18
Operations preserving regular languages.
405-420
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.034
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#BerstelBCPP06
2006-04-18
Complexity of approximating bounded variants of optimization problems.
320-338
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.029
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#ChlebikC06
2006-04-18
Modular strategies for recursive game graphs.
230-249
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.017
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#AlurTM06
2006-04-18
Competitive exploration of rectilinear polygons.
367-378
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.032
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#HammarNP06
2006-04-18
Fast periodic correction networks.
354-366
2006
354
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.031
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Stachowiak06
2006-04-18
Strategies for combining decision procedures.
187-210
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#ConchonK06
2006-04-18
Easiness in graph models.
4-23
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#BerlineS06
2006-04-18
Counterexample-guided predicate abstraction of hybrid systems.
250-271
2006
354
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2005.11.026
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#AlurDI06
2006-04-18
Partial algebras, meaning categories and algebraization.
131-141
2006
354
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs354.html#Kracht06
2006-04-18
Graph colorings.
1
2005
349
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.09.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs349.html#NesetrilW05
2006-04-27
Hausdorff dimension and oracle constructions.
382-388
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2006.01.025
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Hitchcock06
2006-04-27
Probability distribution for simple tautologies.
243-260
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Zaionc06
2006-04-27
Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
389-395
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2006.01.024
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#BazganTV06
2006-04-27
Edge-colouring of join graphs.
364-370
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.12.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#SimoneM06
2006-04-27
Asynchronous deterministic rendezvous in graphs.
315-326
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.12.016
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#MarcoGKKPV06
2006-04-27
NL-printable sets and nondeterministic Kolmogorov complexity.
127-138
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Allender06
2006-04-27
Finite derivation type for Rees matrix semigroups.
274-290
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.12.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Malheiro06
2006-04-27
<i>k</i>-path cover problem for cacti.
354-363
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2006.01.023
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#JinL06
2006-04-27
Logic, Language, Information and Computation.
105-107
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#QueirozK06
2006-04-27
The universe of propositional approximations.
153-166
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#FingerW06
2006-04-27
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.
303-314
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2006.01.022
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#WuCW06
2006-04-27
Approximation algorithms for minimizing the total weighted tardiness on a single machine.
261-273
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.11.039
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#KolliopoulosS06
2006-04-27
Efficiently covering complex networks with cliques of similar vertices.
37-47
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#BehrischT06
2006-04-27
Broadcasting in unstructured peer-to-peer overlay networks.
25-36
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.013
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#AnnexsteinBJ06
2006-04-27
Could any graph be turned into a small-world?
96-103
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#DuchonHLS06
2006-04-27
Exploring networks with traceroute-like probes: Theory and simulations.
6-24
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#DallAstaABVV06
2006-04-27
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets.
167-196
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.008
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#HartmannLS06
2006-04-27
Quantifier-free logic for nondeterministic theories.
215-227
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.010
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#LamoW06
2006-04-27
Intersection types and lambda models.
108-126
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#AlessiBD06
2006-04-27
<i>k</i>-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.
139-152
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.006
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#BechetF06
2006-04-27
The scientific works of Rainer Kemp (1949-2004).
371-381
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.04.012
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#FlajoletNP06
2006-04-27
Many hard examples in exact phase transitions.
291-302
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2006.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#XuL06
2006-04-27
Preface.
1-5
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#KumarL06
2006-06-13
Computing queries with higher-order logics.
197-214
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.009
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#HellaT06
2006-04-27
Reductions in binary search trees.
327-353
2006
355
Theor. Comput. Sci.
3
http://dx.doi.org/10.1016/j.tcs.2005.12.015
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Sanchez-CousoF06
2006-04-27
Scalable percolation search on complex networks.
48-64
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.014
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#SarsharBR06
2006-04-27
Revision by comparison as a unifying framework: Severe withdrawal, irrevocable revision and irrefutable revision.
228-242
2006
355
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/j.tcs.2006.01.011
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#Rott06
2006-04-27
Local heuristics and the emergence of spanning subgraphs in complex networks.
80-95
2006
355
Theor. Comput. Sci.
1
http://dx.doi.org/10.1016/j.tcs.2005.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs355.html#StaufferB06
2003-11-27
Guest editorial special issue on artificial immune systems.
225-226
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Dasgupta02
2003-11-27
Guest editorial from biology to hardware and back.
165-166
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#X99
2003-11-27
Remarks on a recent paper on the "no free lunch" theorems.
295-296
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#KoppenWM01
2003-11-27
Evolutionary Algorithms for VLSI CAD [book Review].
251-253
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Drechsler99
2004-01-13
Microgenetic algorithms as generalized hill-climbing operators for GA optimization.
204-217
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#KazarlisPTP01
2006-01-11
Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment.
189-203
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#WeickerSWW03
2003-11-27
Editorial: Welcome To The IEEE Neural Networks Society.
531-532
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Bonissone02
2003-11-27
An evolutionary algorithm for fractal coding of binary images.
172-181
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#DasguptaHN00
2003-11-27
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms.
503-515
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Jensen03a
2005-06-01
Genetic programming III: darwinian invention and problem solving [Book Review].
251-253
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#KozaBAK99
2003-11-27
An evolutionary approach to the design of controllable cellular automata structure for random number generation.
23-36
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#GuanZ03
2003-11-27
Parallelism and evolutionary algorithms.
443-462
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#AlbaT02
2003-11-27
Local search genetic algorithm for optimal design of reliable networks.
179-188
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#DengizAS97
2003-11-27
Artificial worlds modeling of human resource management systems.
542-556
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ChenLK02
2003-11-27
The analysis of a recombinative hill-climber on H-IFF.
417-423
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#DietzfelbingerNHW03
2003-11-27
Genetic algorithm optimization for blind channel identification with higher order cumulant fitting.
259-265
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#ChenWM97
2003-11-27
Ant colony system: a cooperative learning approach to the traveling salesman problem.
53-66
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#DorigoG97
2003-11-27
Using genetic algorithms in process planning for job shop machining.
278-289
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#ZhangZN97
2003-11-27
Evolving computer programs without subtree crossover.
209-216
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Chellapilla97
2003-11-27
Combining mutation operators in evolutionary programming.
91-96
1998
2
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#Chellapilla98
2003-11-27
Guest editorial: special issue on evolutionary multiobjective optimization.
97-99
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Coello03
2005-01-11
Adaptive Computing in Design and Manufacture.
159-159
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Parmee99
2003-11-27
Gradual distributed real-coded genetic algorithms.
43-63
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#HerreraL00
2003-11-27
Adaptive genetic operators based on coevolution with fuzzy behaviors.
149-165
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#HerreraL01
2003-11-27
Evolutionary Games And Equilibrium Selection.
217-218
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Harrald97
2003-11-27
Market power and efficiency in a computational electricity market with discriminatory double-auction pricing.
504-523
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#NicolaisenPT01
2003-11-27
The immune and the chemical crossover.
306-313
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Bersini02
2003-11-27
An evolutionary algorithm for resource-constrained project scheduling.
512-518
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#HindiYF02
2005-06-13
Dimensionality reduction using genetic algorithms.
164-171
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#RaymerPGKJ00
2003-11-27
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization.
580-593
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#HanK02
2003-11-27
Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization.
388-397
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Hart01
2003-11-27
Solving equations by hybrid evolutionary computation techniques.
295-304
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#HeXY00
2003-11-27
The balance between proximity and diversity in multiobjective evolutionary algorithms.
174-188
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#BosmanT03
2004-06-01
Clustering with a genetically optimized approach.
103-112
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#HallOB99
2003-11-27
An efficient evolutionary algorithm for channel resource management in cellular mobile systems.
125-137
1998
2
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#SandalidisSR98
2005-03-01
From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms.
495-511
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#HeY02
2003-11-27
Rank-density-based multiobjective genetic algorithm and benchmark test function study.
325-343
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#LuY03
2003-11-27
A fast and elitist multiobjective genetic algorithm: NSGA-II.
182-197
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#DebAPM02
2003-11-27
Evolving a modular neural network-based behavioral fusion using extended VFF and environment classification for mobile robot navigation .
413-419
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ImOH02
2003-11-27
GENETICA: A computer language that supports general formal expression with evolving data structures.
456-481
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Virirakis03
2003-11-27
Image segmentation using evolutionary computation.
1-21
1999
3
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#BhandarkarZ99
2003-11-27
A genetic algorithm for the multiple destination routing problems.
150-161
1998
2
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#LeungLX98
2003-11-27
The simple genetic algorithm-foundations and theory.
191-192
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Beyer00
2003-11-27
On the performance of (1, Lambda)-evolution strategies for the ridge function class.
218-235
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Beyer01
2003-11-27
Resource sharing and coevolution in evolving cellular automata.
388-393
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#WerfelMC00
2003-11-27
Multiobjective evolutionary computation for supersonic wing-shape optimization.
182-187
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#ObayashiSTH00
2003-11-27
Edge sets: an effective evolutionary coding of spanning trees.
225-239
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#RaidlJ03
2003-11-27
Fuzzy coding of genetic algorithms.
344-355
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#SharmaI03
2003-11-27
A MS-GS VQ codebook design for wireless image communication using genetic algorithms.
35-52
1999
3
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#KimA99
2003-11-27
Evolutionary programming techniques for constrained optimization problems.
129-140
1997
1
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#KimM97
2003-11-27
Effects of phenotypic redundancy in structure optimization.
74-85
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#IgelS02
2003-11-27
An evolutionary approach to automatic synthesis of high-performance analog integrated circuits.
240-252
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#AlpaydinBD03
2005-09-21
Ant Colony Optimization.
422-423
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.827005
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#X04
2005-11-30
Designing a genetic neural fuzzy antilock-brake-system controller.
198-211
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#LeeZ02
2003-11-27
VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions.
390-401
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ValenzuelaW02
2004-03-17
A study of the Lamarckian evolution of recurrent neural networks.
31-42
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#KuMS00
2003-11-27
Evolution of unplanned coordination in a market selection game.
524-534
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#IshibuchiNS01
2003-11-27
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling.
204-223
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#IshibuchiYM03
2003-11-27
Two fast tree-creation algorithms for genetic programming.
274-283
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Luke00
2003-11-27
Macroevolutionary algorithms: a new optimization method on fitness landscapes.
272-286
1999
3
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#MarinS99
2003-11-27
Globally convergent algorithms for DC operating point analysis of nonlinear circuits.
2-10
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#CrutchleyZ03
2003-11-27
Genetic-fuzzy approach to the Boolean satisfiability problem.
519-525
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#PedryczSS02
2003-11-27
Explorations in design space: unconventional electronics design through artificial evolution.
167-196
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#ThompsonLZ99
2003-11-27
Integrating fuzzy knowledge by genetic algorithms.
138-149
1998
2
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#WangHT98
2003-11-27
Genetic algorithms for communications network design - an empirical study of the factors that influence performance.
236-249
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#ChouPC01
2003-11-27
An evolutionary strategy for global minimization and its Markov chain analysis.
77-90
1998
2
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#Francois98
2003-11-27
SOGARG: A self-organized genetic algorithm-based rule generation scheme for fuzzy controllers.
397-415
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#PalP03
2003-11-27
Considerations in engineering parallel multiobjective evolutionary algorithms.
144-173
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#VeldhuizenZL03
2003-11-27
An orthogonal genetic algorithm with quantization for global numerical optimization.
41-53
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#LeungW01
2003-11-27
Guest editorial agent-based modeling of evolutionary economic systems.
437-441
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Tesfatsion01
2003-11-27
Solving constraint satisfaction problems using hybrid evolutionary search.
23-33
1998
2
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#DozierBH98
2003-11-27
Society and civilization: An optimization algorithm based on the simulation of social behavior.
386-396
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#RayL03
2003-11-27
Test-case generator for nonlinear continuous parameter optimization techniques.
197-215
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#MichalewiczDSS00
2003-11-27
An immunity-based technique to characterize intrusions in computer networks.
281-291
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#GonzalezD02
2003-11-27
A new model of simulated evolutionary computation-convergence analysis and specifications.
3-16
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#LeungDXW01
2003-11-27
Nonlinear blind source separation using higher order statistics and a genetic algorithm.
600-612
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#TanW01
2003-11-27
Optimization based on bacterial chemotaxis.
16-29
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#MullerMAK02
2003-11-27
Markov chain models of parallel genetic algorithms.
216-226
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Cantu-Paz00
2003-11-27
Fitness sharing and niching methods revisited.
97-106
1998
2
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#SareniK98
2005-01-14
Evolving oscillators in silico.
197-204
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#HuelsbergenRS99
2003-11-27
On self-adaptive features in real-parameter evolutionary algorithms.
250-270
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#BeyerD01
2003-11-27
Automated synthesis of analog electrical circuits by means of genetic programming.
109-128
1997
1
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#KozaBAKD97
2003-11-27
Nongovernance rather than governance in a multiagent economic society.
535-545
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#TakadamaTS01
2003-11-27
An analysis of the behavior of simplified evolutionary algorithms on trap functions.
11-22
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#NijssenB03
2003-11-27
A voter model of the spatial prisoner's dilemma.
117-121
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#FreanA01
2003-11-27
A case study of scheduling storage tanks using a hybrid genetic algorithm.
283-294
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#DahalBMM01
2003-11-27
Design of optimal disturbance rejection PID controllers using genetic algorithms.
78-82
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#KrohlingR01
2003-11-27
A new mutation rule for evolutionary programming motivated from backpropagation learning.
188-190
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#ChoiO00
2003-11-27
Application of evolutionary programming to adaptive regularization in image restoration.
309-326
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#WongG00
2003-11-27
Multimodal control of reaching-simulating the role of tactile feedback.
122-128
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#SchlesingerP01
2003-11-27
Partial abductive inference in Bayesian belief networks - an evolutionary computation approach by using problem-specific genetic operators.
105-131
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#CamposGM02
2003-11-27
Evolutionary robotics: the biology, intelligence, and technology of self-organizing machines.
429-430
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Xiao01
2003-11-27
Parameter optimization of an on-chip voltage reference circuit using evolutionary programming.
414-421
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#NamSPPK01
2003-11-27
A computational reinforced learning scheme to blind image deconvolution.
2-15
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#YapG02
2003-11-27
Guest editorial - evolutionary computation and cognitive science: modeling evolution and evolving models.
89-92
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#WilesH01
2003-11-27
A framework for evolutionary optimization with approximate fitness functions.
481-494
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#JinOS02
2003-11-27
Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation.
253-274
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#YenL03
2003-11-27
Agent-based simulation-an application to the new electricity trading arrangements of England and Wales.
493-503
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#BunnO01
2003-11-27
The computational complexity of N-K fitness functions.
373-379
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#WrightTZ00
2003-11-27
Using cultural algorithms to support re-engineering of rule-based expert systems in dynamic performance environments: a case study in fraud detection.
225-243
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#SternbergR97
2003-11-27
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach.
257-271
1999
3
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#ZitzlerT99
2003-11-27
An adaptive hybrid genetic algorithm for the three-matching problem .
135-146
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#MagyarJN00
2003-11-27
Synthesizing a predatory search strategy for VLSI layouts.
147-152
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Linhares99
2003-11-27
Training multiple-layer perceptrons to recognize attractors.
244-248
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Greenwood97
2003-11-27
Ant colony optimization for resource-constrained project scheduling.
333-346
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#MerkleMS02
2003-11-27
Parallel hybrid method for SAT that couples genetic algorithms and local search.
323-334
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#FolinoPS01
2003-11-27
Evolutionary computation: comments on the history and current state.
3-17
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#BackHS97
2003-11-27
A scalable cellular implementation of parallel genetic programming.
37-53
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#FolinoPS03
2003-11-27
Using multiple genetic algorithms to generate radar point-scatterer models.
147-163
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#HughesL00
2003-11-27
Modeling of ship trajectory in collision situations by an evolutionary algorithm.
227-241
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#SmierzchalskiM00
2003-11-27
Evolutionary programming made faster.
82-102
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#YaoLL99
2003-11-27
To innovate or not to innovate?
471-481
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#DawidRB01
2003-11-27
Data mining with an ant colony optimization algorithm.
321-332
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ParpinelliLF02
2003-11-27
On the robustness of population-based versus point-based optimization in the presence of noise.
107-119
1998
2
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#NissenP98
2003-11-27
The third nasa/dod workshop on evolvable hardware.
631-633
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Tyrrell01
2006-02-08
Learning and optimization using the clonal selection principle.
239-251
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#CastroZ02
2003-11-27
Combined evolution strategies for dynamic calibration of video-based measurement systems.
271-282
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#CerveriPB01
2003-11-27
A computational laboratory for evolutionary trade networks.
546-560
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#McFadzeanTS01
2003-11-27
Evolution of central pattern generators for bipedal walking in a real-time physics environment.
159-168
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ReilH02
2005-08-08
Evolution of functional link networks.
54-65
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#SierraMC01
2003-11-27
Locating input and output points in facilities design - a comparison of constructive, evolutionary, and exact methods.
192-203
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#NormanSA01
2003-11-27
Genetic drift in genetic algorithm selection schemes.
298-303
1999
3
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#RogersP99
2003-11-27
Evolutionary Programming VI.
218-219
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#English97
2003-11-27
Genetic algorithms with a robust solution searching scheme.
201-208
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#TsutsuiG97
2003-11-27
Synthesis of low-power DSP systems using a genetic algorithm.
27-40
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#BrightA01
2003-11-27
Phase transition in a foreign exchange market-analysis based on an artificial market approach.
456-470
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#IzumiU01
2003-11-27
Evolutionary programming techniques for economic load dispatch.
83-94
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#SinhaCC03
2003-11-27
Spontaneous evolution of linguistic structure-an iterated learning model of the emergence of regularity and irregularity.
102-110
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Kirby01
2003-11-27
Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP.
557-565
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#JungM02
2003-11-27
Adaptive evolutionary planner/navigator for mobile robots.
18-28
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#XiaoMZT97
2003-11-27
On spanning-tree recombination in evolutionary large-scale network problems - application to electrical distribution planning.
623-630
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#CarvalhoFB01
2003-11-27
Grammatical evolution.
349-358
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#ONeillR01
2003-11-27
Chaotic sequences to improve the performance of evolutionary algorithms.
289-304
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#CaponettoFFX03
2003-11-27
Real-world applications of analog and digital evolvable hardware .
220-235
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#HiguchiIKSMKTTSKO99
2003-11-27
Self-adaptive fitness formulation for constrained optimization.
445-455
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#FarmaniW03
2003-11-27
Evolutionary algorithms and gradient search: similarities and differences.
45-55
1998
2
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#Salomon98
2004-03-17
A multistage evolutionary algorithm for the timetable problem.
63-74
1999
3
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#BurkeN99
2003-11-27
Inductive reasoning and bounded rationality reconsidered.
142-146
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#FogelCA99
2003-11-27
Proceedings of the 1998 IEEE International Conference on Evolutionary Computation.
153-156
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Kennedy99
2003-11-27
Schema processing under proportional selection in the presence of random effects.
290-293
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#FogelG97a
2003-11-27
Empirical regularities from interacting long- and short-memory investors in an agent-based stock market.
442-455
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#LeBaron01
2003-11-27
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment.
402-412
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Jaszkiewicz02
2003-11-27
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem.
133-143
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Jaszkiewicz03
2003-11-27
A hybrid evolutionary approach for solving constrained optimization problems over finite domains.
353-372
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Ruiz-AndinoASR00
2003-11-27
Graph-based evolutionary design of arithmetic circuits.
86-100
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ChenAHTH02
2003-11-27
A parallel genetic algorithm for performance-driven VLSI routing.
29-39
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Lienig97
2003-11-27
Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons.
93-113
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#DimopoulosZ00
2003-11-27
A collective-based adaptive symbiotic model for surface reconstruction in area-based stereo.
482-502
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#GoulermasL03
2003-11-27
Bandit problems and the exploration/exploitation tradeoff.
2-22
1998
2
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#MacreadyW98
2005-03-01
From neurocomputation to immunocomputation - a model and algorithm for fluctuation-induced instability and phase transition in biological systems.
292-305
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#RoyKM02
2006-10-27
Stochastic ranking for constrained evolutionary optimization.
284-294
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#RunarssonY00
2003-11-27
An empirical study on the synergy of multiple crossover operators.
212-223
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#YoonM02
2003-11-27
Evolving an expert checkers playing program without using human expertise.
422-428
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#ChellapillaF01
2003-11-27
Simulation and evolutionary optimization of electron-beam lithography with genetic and simplex-downhill algorithms.
69-82
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#RobinOMHB03
2003-11-27
Evolutionary computation applied to mesh optimization of a 3-D facial image.
113-123
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#FujiwaraS99
2005-08-26
An evolutionary autonomous agents approach to image feature extraction.
141-158
1997
1
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#LiuTC97
2003-11-27
Evolutionary ensembles with negative correlation learning.
380-387
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#LiuYH00
2003-11-27
Analysis and modeling of control tasks in dynamic systems.
378-389
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#UrsemKJM02
2003-11-27
Biomolecular computing and programming.
236-250
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#GarzonD99
2003-11-27
Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations.
66-77
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Stroud01
2003-11-27
An artificial immune system architecture for computer security applications.
252-280
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#HarmerWGL02
2003-11-27
The particle swarm - explosion, stability, and convergence in a multidimensional complex space.
58-73
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ClercK02
2003-11-27
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness.
589-599
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#JansenW01
2003-11-27
Performance assessment of multiobjective optimizers: an analysis and review.
117-132
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#ZitzlerTLFF03
2003-11-27
Interval-valued GA-P algorithms.
64-72
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Sanchez00
2003-11-27
Directed variation in evolution strategies.
356-366
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#ZhouL03
2003-11-27
Emerging small-world referral networks in evolutionary labor markets.
482-492
2001
5
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#TassierM01
2003-11-27
Parameter control in evolutionary algorithms.
124-141
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#EibenHM99
2003-11-27
Preferences and their application in evolutionary multiobjective optimization.
42-57
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ParmeeC02
2003-11-27
Applying an evolutionary algorithm to telecommunication network design.
309-322
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#ArabasK01
2003-11-27
A comparison of linear genetic programming and neural networks in medical data mining.
17-26
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#BrameierB01
2003-11-27
Genetic fuzzy learning.
259-273
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Russo00
2003-11-27
Planning multiple paths with evolutionary speciation.
169-191
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#HocaogluS01
2003-11-27
Using unconstrained elite archives for multiobjective optimization.
305-323
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#FieldsendES03
2003-11-27
Coevolutionary augmented Lagrangian methods for constrained optimization.
114-124
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#TahkS00
2003-11-27
Application of genetic programming for multicategory pattern classification.
242-258
2000
4
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#KishorePMA00
2004-05-05
Evolvable systems 1998-Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware (ICES'98) .
157-158
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#SipperMP99
2004-07-20
Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization.
565-588
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#TanLK01
2003-11-27
Genetic algorithms and grouping problems.
297-298
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Reeves01
2003-11-27
A circuit representation technique for automated circuit design.
205-219
1999
3
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#LohnC99
2003-11-27
Automatic discovery of self-replicating structures in cellular automata.
165-178
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#LohnR97
2003-11-27
Swarm intelligence: from natural to artificial systems.
192-193
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#Smith00
2003-11-27
Multi-objective optimization using evolutionary algorithms [Book Review].
526
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Smith02
2003-11-27
Evolving pattern recognition systems.
594-609
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#RizkiZT02
2003-11-27
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem.
337-352
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#MerzF00
2003-11-27
Holder functions and deception of genetic algorithms.
56-71
1998
2
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#LuttonV98
2003-11-27
Memorial tribute to Dr. Michael Conrad.
1-2
2001
5
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#FogelARR01
2003-11-27
Genetic Programming 1997: Proceedings Of The Second Annual Conference On Genetic Programming.
294-295
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Soule97
2003-11-27
Local performance of the (1 + 1)-ES in a noisy environment.
30-41
2002
6
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#ArnoldB02
2004-03-26
A phylogenetic, ontogenetic, and epigenetic view of bio-inspired hardware systems.
83-97
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#SipperSMTPS97
2003-11-27
Evolving artificial neural networks to combine financial forecasts.
40-52
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#HarraldK97
2003-11-27
Hybrid genetic algorithms for constrained placement problems.
266-277
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#SchneckeV97
2003-11-27
Robust design of multilayer optical coatings by means of evolutionary algorithms.
162-167
1998
2
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#WiesmannHB98
2003-11-27
A (/spl mu/ + /spl lambda/) evolutionary algorithm for reconstruction of SPECT data.
533-541
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#KnollKMKKN02
2003-11-27
A comparison of predictive measures of problem difficulty in evolutionary algorithms.
1-15
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#NaudtsK00
2003-11-27
Genetic object recognition using combinations of views.
132-146
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#BebisYLV02
2003-11-27
On synchronized evolution of the network of automata.
147-158
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Inagaki02
2003-11-27
No free lunch theorems for optimization.
67-82
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#DolpertM97
2003-11-27
The second NASA/DoD workshop on evolvable hardware.
298-302
2001
5
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Garis01
2003-11-27
Proceedings of the first NASD/DoD workshop on evolvable hardware.
304-306
1999
3
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Garis99
2003-11-27
System design by constraint adaptation and differential evolution.
22-34
1999
3
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#Storn99
2003-11-27
Ants can solve constraint satisfaction problems.
347-357
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Solnon02
2003-11-27
In memoriam Alex S. Fraser [1923-2002].
429-430
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Fogel02
2003-11-27
Evolutionary Computation: A New Transactions.
1-2
1997
1
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Fogel97
2003-11-27
Evolutionary Algorithms In Engineering Applications.
72
1998
2
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#Fogel98
2005-04-13
Genetic Programming 1998: Proceedings of the Third Annual Conference.
159-161
1999
3
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#KozaBCDDFGGIR99
2003-11-27
Guest editorial: special section on ant colony optimization.
317-319
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#GambardellaDMS02
2003-11-27
Inducing oblique decision trees with evolutionary algorithms.
54-68
2003
7
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Cantu-PazK03
2003-11-27
Self-adaptive mutations may lead to premature convergence.
410-414
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Rudolph01
2003-11-27
Local convergence rates of simple evolutionary algorithms with Cauchy mutations.
249-258
1997
1
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#Rudolph97
2003-11-27
An orthogonal genetic algorithm for multimedia multicast routing.
53-62
1999
3
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#ZhangL99
2003-11-27
Knowledge-intensive genetic discovery in foreign exchange markets .
169-181
2002
6
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#BhattacharyyaPZ02
2003-11-27
Genetic programming and evolutionary generalization.
431-442
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Kushchu02
2003-11-27
NOW G-Net: learning classification programs on networks of workstations.
463-480
2002
6
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#AnglanoB02
2003-11-27
A new evolutionary approach to the degree-constrained minimum spanning tree problem.
125-134
2000
4
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#KnowlesC00
2003-11-27
Properties of an adaptive archiving algorithm for storing nondominated vectors.
100-116
2003
7
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#KnowlesC03
2003-11-27
Modeling crossover-induced linkage in genetic algorithms.
376-387
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Prugel-Bennett01
2003-11-27
Immunotronics - novel finite-state-machine architectures with built-in self-test using self-nonself differentiation.
227-238
2002
6
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#BradleyT02
2003-11-27
A short convergence proof for a class of ant colony optimization algorithms.
358-365
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#StutzleD02
2003-11-27
Designing classifier fusion systems by genetic algorithms.
327-336
2000
4
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#KunchevaJ00
2003-11-27
Dynamics of infinite populations evolving in a landscape of uni and bimodal fitness functions.
398-409
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Karcz-Duleba01
2003-11-27
Speciation as automatic categorical modularization.
101-108
1997
1
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#DarwenY97
2003-11-27
Editorial: transition to a new editor-in-chief.
529-530
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Fogel02a
2003-11-27
A note on representations and variation operators.
159-161
1997
1
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#FogelG97
2003-11-27
Visual routines for eye location using learning and evolution.
73-82
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#HuangW00
2003-11-27
Comparing evolutionary algorithms on binary constraint satisfaction problems.
424-444
2003
7
IEEE Trans. Evolutionary Computation
5
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#CraenenEH03
2003-11-27
A genetic algorithm approach to image reconstruction in electrical impedance tomography.
83-88
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#OlmiBP00
2003-11-27
Design of evolvable computer languages.
420-424
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#OfriaAC02
2003-11-27
A weighted sum genetic algorithm to support multiple-party multiple-objective negotiations.
366-377
2002
6
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#Rubenstein-MontanoM02
2003-11-27
Generating robust and flexible job shop schedules using genetic algorithms.
275-288
2003
7
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Jensen03
2003-11-27
GAVEL - a new tool for genetic algorithm visualization.
335-348
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#HartR01
2003-11-27
Introduction To Artificial Life.
168-170
1998
2
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#Adami98
2003-11-27
Evolutionary search for low autocorrelated binary sequences.
34-39
1998
2
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec2.html#MilitzerZB98
2003-11-27
A hybrid heuristic for the traveling salesman problem.
613-622
2001
5
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#BaragliaHP01
2003-11-27
Evolution of communication and language using signals, symbols, and words.
93-101
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Cangelosi01
2004-11-24
The compact genetic algorithm.
287-297
1999
3
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec3.html#HarikLG99
2003-11-27
Random Boolean nets and features of language.
111-116
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#Hurford01
2003-11-27
Regularization approach to inductive genetic programming.
359-375
2001
5
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#NikolaevI01
2003-11-27
Generating fuzzy rules for target tracking using a steady-state genetic algorithm.
189-200
1997
1
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec1.html#ChanLL97
2003-11-27
Statistical distribution of the convergence time of evolutionary algorithms for long-path problems.
16-30
2000
4
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec4.html#GarnierK00
2003-11-27
Design of evolutionary algorithms-A statistical perspective.
129-148
2001
5
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec5.html#FrancoisL01
2003-11-27
A genetic algorithm for shortest path routing problem and the sizing of populations.
566-579
2002
6
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec6.html#AhnR02
2003-11-27
Elitism-based compact genetic algorithms.
367-385
2003
7
IEEE Trans. Evolutionary Computation
4
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#AhnR03
2004-10-26
A semantically guided and domain-independent evolutionary model for knowledge discovery from texts.
546-560
2003
7
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#Atkinson-AbutridyMA03
2006-09-18
Evolving accurate and compact classification rules with gene expression programming.
519-531
2003
7
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#ZhouXTN03
2004-08-25
Guest editorial data mining and knowledge discovery with evolutionary algorithms.
517-518
2003
7
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#GhoshA03
2006-05-11
Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study.
561-575
2003
7
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#CanoHL03
2004-08-25
A novel evolutionary data mining algorithm with applications to churn prediction.
532-545
2003
7
IEEE Trans. Evolutionary Computation
6
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec7.html#AuCY03
2006-01-17
On the Computation of All Global Minimizers Through Particle Swarm Optimization.
211-224
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#ParsopoulosV04
2005-09-21
The Fully Informed Particle Swarm: Simpler, Maybe Better.
204-210
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#MendesKN04
2005-09-21
<sub>epsilon</sub>gate, and two-phase scheme.
156-169
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#Kim04
2005-09-21
A Cooperative Approach to Particle Swarm Optimization.
225-239
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#vandenBerghE04
2005-09-21
Meta-Lamarckian learning in memetic algorithms.
99-110
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#OngK04
2005-09-21
Toward a theory of generalization and learning in XCS.
28-46
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#ButzKLW04
2005-09-21
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients.
240-255
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#RatnaweeraHW04
2005-09-21
Evolutionary programming using mutations based on the Levy probability distribution.
1-13
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#LeeY04
2005-09-21
Guest Editorial Special Issue on Particle Swarm Optimization.
201-203
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#EberhartS04
2005-09-21
An Approach to Multimodal Biomedical Image Registration Utilizing Particle Swarm Optimization.
289-301
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#WachowiakSZZE04
2005-09-21
A novel approach to design classifiers using genetic programming.
183-196
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#MuniPD04
2005-09-21
Symmetry breaking in population-based optimization.
63-79
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#Prugel-Bennett04
2005-09-21
Learning to Play Games Using a PSO-Based Competitive Learning Approach.
280-288
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#MesserschmidtE04
2005-09-21
Symbiosis of evolutionary techniques and statistical natural language processing.
14-27
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#Araujo04
2005-09-21
Diversity in genetic programming: an analysis of measures and correlation with fitness.
47-62
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#BurkeGK04
2005-09-21
Systematic integration of parameterized local search into evolutionary algorithms.
137-155
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#BambhaBTZ04
2005-09-21
Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions.
170-182
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#LaumannsTZ04
2005-09-21
Handling Multiple Objectives With Particle Swarm Optimization.
256-279
2004
8
IEEE Trans. Evolutionary Computation
3
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#CoelloPL04
2005-09-21
A family of compact genetic algorithms for intrinsic evolvable hardware.
111-126
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#GallagherVK04
2005-09-21
On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm.
80-93
2004
8
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#Zhang04
2005-09-21
On the convergence of a class of estimation of distribution algorithms.
127-136
2004
8
IEEE Trans. Evolutionary Computation
2
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#ZhangM04
2005-09-21
A robust stochastic genetic algorithm (StGA) for global numerical optimization.
456-470
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.831258
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#TuL04
2005-09-21
On-line genetic design of anti-windup unstructured controllers for electric drives with variable load.
347-364
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.827823
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#CupertinoMNTS04
2005-09-21
A multiobjective module-order model for software quality enhancement.
593-608
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/10.1109/TEVC.2004.837108
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#KhoshgoftaarLS04
2005-09-21
Hybrid coevolutionary programming for Nash equilibrium search in games with local optima.
305-315
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.832862
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#SonB04
2005-09-21
Intelligent evolutionary algorithms for large parameter optimization problems.
522-541
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/10.1109/TEVC.2004.835176
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#HoSC04
2005-09-21
The preservation of favored building blocks in the struggle for fitness: the puzzle algorithm.
443-455
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.831260
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#ZaritskyS04
2005-09-21
A GA-based design space exploration framework for parameterized system-on-a-chip platforms.
329-346
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/0.1109/TEVC.2004.826389
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#AsciaCP04
2005-09-21
Hybrid Taguchi-genetic algorithm for global numerical optimization.
365-377
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.826895
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#TsaiLC04
2005-09-22
An efficient data mining method for learning Bayesian networks using an evolutionary algorithm-based hybrid approach.
378-404
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.830334
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#WongL04
2005-09-21
Analysis of fitness functions for electron-beam lithography simulation and evolutionary optimization.
506-511
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.834198
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#RobinS04
2005-09-21
Local function approximation in evolutionary algorithms for the optimization of costly functions.
490-505
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.835247
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#RegisS04
2005-09-21
Heuristic design of cancer chemotherapies.
513-521
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/10.1109/TEVC.2004.834154
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#VillasanaO04
2005-09-21
An evolutionary approach to pattern-based time series segmentation.
471-489
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.832863
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#ChungFNL04
2005-09-21
On the role of population size and niche radius in fitness sharing.
580-592
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#CioppaSM04
2005-09-21
Statistical exploratory analysis of genetic algorithms.
405-421
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.831262
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#CzarnMVTG04
2005-09-21
Implementing linear models in genetic programming.
542-566
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/10.1109/TEVC.2004.836818
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#YeunRYK04
2005-09-21
Learning with case-injected genetic algorithms.
316-328
2004
8
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2004.823466
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#LouisM04
2005-09-21
Evolutionary optimization with Markov random field prior.
567-579
2004
8
IEEE Trans. Evolutionary Computation
6
http://dx.doi.org/10.1109/TEVC.2004.835521
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#WangW04
2005-09-21
Dynamic multiobjective optimization problems: test cases, approximations, and applications.
425-442
2004
8
IEEE Trans. Evolutionary Computation
5
http://dx.doi.org/10.1109/TEVC.2004.831456
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec8.html#FarinaDA04
2005-09-21
Evolution of Processor microcode.
44-54
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.837922
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Jackson05
2005-09-21
A genetic algorithm for automated horizon correlation across faults in seismic images.
201-210
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2004.841307
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#AurnhammerT05
2005-09-21
Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing.
143-158
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2005.844166
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ShinLKZ05
2005-09-21
Parametric study for an ant algorithm applied to water distribution system optimization.
175-191
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2005.844168
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ZecchinSMN05
2005-09-21
Handling continuous attributes in an evolutionary inductive learner.
31-43
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.837752
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#DivinaM05
2005-09-21
Automatic mesh generation for mobile network dimensioning using evolutionary approach.
18-30
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.837923
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#CreputKLC05
2005-09-21
Multiobjectivity and Complexity in Embodied Cognition.
337-360
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.846902
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#TeoA05
2005-09-21
A simple multimembered evolution strategy to solve constrained optimization problems.
1-17
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.836819
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Mezura-MontesC05
2005-09-22
Large Barrier Trees for Studying Search.
385-397
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.846818
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#HallamP05
2005-09-21
Domain of competence of XCS classifier system in complexity measurement space.
82-104
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.840153
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Bernado-MansillaH05
2005-09-21
An evolutionary algorithm with guided mutation for the maximum clique problem.
192-200
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2004.840835
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ZhangST05
2005-09-21
Nonlinear System Identification Using Coevolution of Models and Tests.
361-384
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.850293
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#BongardL05
2005-09-22
A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem.
105-114
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.841682
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ChoiM05
2006-03-30
A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation.
61-73
http://dx.doi.org/10.1109/TEVC.2004.840144
2005
9
IEEE Trans. Evolutionary Computation
1
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Mishra05
2005-09-21
On the Practicality of Using Intrinsic Reconfiguration for Fault Recovery.
398-405
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.850278
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Greenwood05
2005-09-22
Cooperative coevolution of artificial neural network ensembles for pattern classification.
271-302
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/10.1109/TEVC.2005.844158
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Garcia-PedrajasHO05
2005-09-21
The exploration/exploitation tradeoff in dynamic cellular genetic algorithms.
126-142
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2005.843751
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#AlbaD05
2006-01-24
Parallel Implementation of EDAs Based on Probabilistic Graphical Models.
406-423
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.850299
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#MendiburuLM05
2005-09-21
Web-based evolutionary and adaptive information retrieval.
117-125
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2004.842093
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#Kushchu05
2005-09-21
A Generic Framework for Constrained Optimization Using Genetic Algorithms.
424-435
2005
9
IEEE Trans. Evolutionary Computation
4
http://dx.doi.org/10.1109/TEVC.2005.846817
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#VenkatramanY05
2005-09-21
Observing the evolution of neural networks learning to play the game of Othello.
240-251
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/10.1109/TEVC.2005.843750
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ChongTW05
2005-09-21
Adaptation technique for integrating genetic programming and reinforcement learning for real robots.
318-333
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/10.1109/TEVC.2005.850290
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#KamioI05
2005-09-21
Training genetic programming on half a million patterns: an example from anomaly detection.
225-239
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/10.1109/TEVC.2004.841683
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#SongHZ05
2005-09-21
Search bias in ant colony optimization: on the role of competition-balanced systems.
159-174
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2004.841688
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#BlumD05
2005-09-21
A genetic algorithm for searching spatial configurations.
252-270
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#RodriguezJ05
2005-09-21
An improved resource allocation scheme for plane cover multiple access using genetic algorithm.
74-81
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.838662
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#WuSH05
2005-09-21
A synthesis system for analog circuits based on evolutionary search and topological reuse.
211-224
2005
9
IEEE Trans. Evolutionary Computation
2
http://dx.doi.org/10.1109/TEVC.2004.841308
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#DastidarCR05
2005-09-21
Evolutionary optimization in uncertain environments-a survey.
303-317
2005
9
IEEE Trans. Evolutionary Computation
3
http://dx.doi.org/10.1109/TEVC.2005.846356
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#JinB05
2005-09-21
A one-parameter genetic algorithm for the minimum labeling spanning tree problem.
55-60
2005
9
IEEE Trans. Evolutionary Computation
1
http://dx.doi.org/10.1109/TEVC.2004.840145
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#XiongGW05
2006-08-31
Playing to learn: case-injected genetic algorithms for learning to play computer games.
669-681
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856209
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#LouisM05
2006-08-31
Evolution of iterated prisoner's dilemma game strategies in structured demes under random pairing in game playing.
552-561
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856198
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#IshibuchiN05
2006-08-31
Gradient descent methods in learning classifier systems: improving XCS performance in multistep problems.
452-473
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850265
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ButzGL05
2006-08-31
Unraveling ancient mysteries: reimagining the past using evolutionary computation in a complex gaming environment.
707-720
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856206
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ReynoldsKKY05
2006-10-27
Coevolution versus self-play temporal difference learning for acquiring position evaluation in small-board go.
628-640
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856212
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#RunarssonL05
2006-08-31
Coevolutionary optimization of fuzzy logic intelligence for strategic decision support.
682-694
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856208
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#JohnsonMMS05
2006-08-31
Planning an endgame move set for the game RISK: a comparison of search algorithms.
641-652
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856211
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#VaccaroG05
2006-08-31
Evolving assembly programs: how games help microprocessor validation.
695-706
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856207
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#CornoSS05
2006-08-31
A tutorial for competent memetic algorithms: model, taxonomy, and design issues.
474-488
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850260
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#KrasnogorS05
2006-08-31
Systematically incorporating domain-specific knowledge into evolutionary speciated checkers players.
615-627
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856213
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#KimC05
2006-08-31
Coevolutionary free lunches.
721-735
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856205
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#WolpertM05
2006-08-31
Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations.
437-451
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850256
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#TakahamaS05
2006-08-31
A multiagent model of the UK market in electricity generation.
522-536
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850264
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#BagnallS05
2006-08-31
Real-time neuroevolution in the NERO video game.
653-668
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856210
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#StanleyBM05
2006-08-31
A game-theoretic and dynamical-systems analysis of selection methods in coevolution.
580-602
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856203
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#FiciciMP05
2006-08-31
Selection intensity in cellular evolutionary algorithms for regular lattices.
489-505
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850298
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#GiacobiniTTA05
2006-08-31
Particle swarm optimization approaches to coevolve strategies for the iterated prisoner's dilemma.
562-579
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856202
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#FrankenE05
2006-08-31
Application of the utility function method for behavioral organization in a locomotion task.
506-521
2005
9
IEEE Trans. Evolutionary Computation
5
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.850262
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#PetterssonW05
2006-08-31
Evolutionary asymmetric games for modeling systems of partially cooperative agents.
603-614
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856204
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#SimW05
2006-10-27
Behavioral diversity, choices and noise in the iterated prisoner's dilemma.
540-551
2005
9
IEEE Trans. Evolutionary Computation
6
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856200
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec9.html#ChongY05
2006-08-31
Offline Speaker Segmentation Using Genetic Algorithms and Mutual Information.
175-186
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857079
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#Salcedo-SanzGLB06
2006-08-31
The Edge-Window-Decoder Representation for Tree-Based Problems.
124-144
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2006.871250
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#SoakCA06
2006-08-31
Automated passive filter synthesis using a novel tree representation and genetic programming.
93-100
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.861415
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#ChangHS06
2006-08-31
Dynamics of Two-Element Populations in the Space of Population States.
199-209
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856070
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#Karcz-Duleba06
2006-08-31
Application of a fuzzy neural network combined with a chaos genetic algorithm and simulated annealing to short-term load forecasting.
330-340
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857075
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#LiaoT06
2006-08-31
From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality.
108-123
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2006.871249
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#PauldenS06
2006-08-31
Stability analysis of the particle dynamics in particle swarm optimizer.
245-255
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857077
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#KadirkamanathanSF06
2006-08-31
Multiobjective Optimization of Safety Related Systems: An Application to Short-Term Conflict Alert.
187-198
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856067
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#EversonF06
2006-08-31
A constrained genetic approach for computing material property of elastic objects.
341-357
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.860767
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#ZhangHGS06
2006-08-31
A faster algorithm for calculating hypervolume.
29-38
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.851275
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#WhileHBH06
2006-08-31
Representation and Structural Difficulty in Genetic Programming.
157-166
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2006.871252
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#HoaiBE06
2006-08-31
Multiobjective evolutionary algorithms for electric power dispatch problem.
315-329
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857073
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#Abido06
2006-09-01
An evolutionary clustering algorithm for gene expression microarray data analysis.
296-314
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.859371
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#MaCYC06
2006-08-31
Redundancy and Computational Efficiency in Cartesian Genetic Programming.
167-174
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2006.871253
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#MillerS06
2006-08-31
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions.
281-295
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857610
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#LiangQSB06
2006-08-31
Evolutionary discriminant analysis.
81-92
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856069
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#SierraE06
2006-08-31
Multiobjective optimization and evolutionary algorithms for the application mapping problem in multiprocessor system-on-chip design.
358-374
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.860766
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#ErbasCP06
2006-08-31
Evolving the structure of hidden Markov models.
39-49
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.851271
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#WonPK06
2006-08-31
An organizational coevolutionary algorithm for classification.
67-80
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.856068
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#JiaoLZ06
2006-08-31
Biased Mutation Operators for Subgraph-Selection Problems.
145-156
2006
10
IEEE Trans. Evolutionary Computation
2
http://doi.ieeecomputersociety.org/10.1109/TEVC.2006.871251
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#RaidlKJ06
2006-08-31
ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems.
50-66
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.851274
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#Knowles06
2006-08-31
A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance.
19-28
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.860765
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#KoumousisK06
2006-08-31
Evolutionary algorithms + domain knowledge = real-world evolutionary computation.
256-280
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.857695
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#BonissoneSEK06
2006-08-31
Evolutionary multiobjective industrial design: the case of a racing car tire-suspension system.
230-244
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.860763
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#BenedettiFG06
2006-08-31
Bounds for probability of success of classical genetic algorithm based on hamming distance.
1-18
2006
10
IEEE Trans. Evolutionary Computation
1
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.851401
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#YuenC06
2006-08-31
A genetic algorithm for the design space exploration of datapaths during high-level synthesis.
213-229
2006
10
IEEE Trans. Evolutionary Computation
3
http://doi.ieeecomputersociety.org/10.1109/TEVC.2005.860764
http://www.informatik.uni-trier.de/~ley/db/journals/tec/tec10.html#KrishnanK06
2003-11-25
IUP/LED: A Portable User Interface Development Tool.
737-762
1996
26
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#LevyFGLC96
2003-11-25
Fast portable orthogonally persistent Java.
449-479
2000
30
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#MarquezZB00
2003-11-25
Extracting Text from PostScript.
481-491
1998
28
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#Nevill-ManningRW98
2004-02-16
The Distributed Operating System of the SMD Project.
859-877
1988
18
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#MarquesCGGC88
2003-11-25
Design and Analysis of a Hyphenation Procedure.
325-337
1979
9
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Narwekar79
2003-11-25
Profiling Software through the Use of Metrics.
507-518
1991
21
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#RobillardCC91
2003-11-25
The Performance of Message-passing Using Restricted Virtual Memory Remapping.
251-267
1991
21
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#TzouA91
2003-11-25
Feature-Oriented Engineering of PBX Software for Adaptability and Reuseability.
875-896
1999
29
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#KangKLL99
2003-11-25
Design and Implementation of an Interactive Test Bed.
91-109
1974
4
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Bate74
2003-11-25
The Consequences of One's First Programming Language.
733-740
1981
11
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#Wexelblat81
2003-11-25
ASADAL/SIM: An Incremental Multi-Level Simulation and Analysis Tool for Real-Time Software Specifications.
445-462
1998
28
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#KangLLK98
2003-11-25
Managing more physical with less virtual.
639-661
2000
30
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#ChawlaB00
2003-11-25
Tools for Visual and Numerical Data Entry.
531-544
1996
26
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#HellmanPCMK96
2003-11-25
Extended Memory Management (XMM): Lessons Learned.
1011-1031
1998
28
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#MilojicicDDLS98
2003-11-25
Interpretation Control Using A Linear Tree Representation.
275-278
1977
7
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#Lichtman77
2003-11-25
The Function of T and NIL in LISP.
1-3
1986
16
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Lichtman86
2003-11-25
Optimizing Procedure Calls and Returns.
921-939
1983
13
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Er83
2003-11-25
Practical Considerations of Global and Local Variables.
499-502
1985
15
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Er85
2003-11-25
Rapid Calculations of Subscripted Array Addresses.
275-277
1974
4
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Bell74
2003-11-25
Choosing a Tag-list Algorithm for a Compiler with Special Application to the ALEPH Compiler.
575-593
1979
9
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Grune79
2003-11-25
The discipline and method architecture for reusable libraries.
107-128
2000
30
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#Vo00
2003-11-25
DAG-A Program that Draws Directed Graphs.
1047-1062
1988
18
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#Vo88
2003-11-25
Vmalloc: A General and Efficient Memory Allocator.
357-374
1996
26
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Vo96
2003-11-25
Cdt: A Container Data Type Library.
1177-1197
1997
27
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#Vo97
2003-11-25
Experience Acquiring and Retargeting a Portable Ada Computer.
291-307
1987
17
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#Ardo87
2003-11-25
Transition from national standards to Unicode: multilingual support in operating systems and programming languages.
765-774
2000
30
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#Wu00
2003-11-25
A base62 transformation format of ISO 10646 for multilingual identifiers.
1125-1130
2001
31
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#Wu01
2003-11-25
A page-shift transformation format of ISO 10646.
73-82
2002
32
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#Wu02
2003-11-25
A Byte-wise Normalization Method in Arithmetic Coding.
299-309
1999
29
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#Wu99
2003-11-25
Static Analysis of Exception Handling in Ada.
1157-1174
1993
23
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#SchaeferB93
2003-11-25
Data Compression for PC Software Distribution.
1181-1195
1996
26
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Yu96
2003-11-25
Using a qualitative research method for building a software maintenance methodology.
1239-1260
2002
32
Softw., Pract. Exper.
13
http://dx.doi.org/10.1002/spe.481
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#PoloPR02
2003-11-25
Shimba - an environment for reverse engineering Java software systems.
371-394
2001
31
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#SystaKM01
2003-11-25
Parallel Algorithm Design for Workstation Clusters.
235-250
1991
21
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#MageeC91
2003-11-25
Compilers - Some Good, Some Bad!.
991-996
1985
15
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Vella85
2003-11-25
Parallel Processing in FORTRAN with Floating-Point Hardware.
65-68
1975
5
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe5.html#NelsonC75
2003-11-25
Reorganization in a Simple Database System.
719-729
1986
16
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#WilliamsPN86
2003-11-25
SRE-A Syntax Recognizing Editor.
489-497
1985
15
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#DudinskyHZ85
2003-11-25
Self-adjusting trees in practice for large text collections.
925-939
2001
31
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#WilliamsZH01
2003-11-25
Synchronous/Reactive Programming of Concurrent System Software.
207-243
1997
27
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#MontagueM97
2003-11-25
A Distributed Programs Monitor for Berkeley UNIX.
183-200
1986
16
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#MillerMS86
2003-11-25
Software Maintenance: An Approach to Impact Analysis of Objects Change
Softw., Pract. Exper.
25
10
1995
1155-1181
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#Ajila95
2003-11-25
An Algorithm for Drawing Planar Graphs.
973-984
1999
29
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#Plestenjak99
2003-11-25
DEMOS/MP: The Development of a Distributed Operating System.
277-290
1987
17
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#MillerPP87
2003-11-25
Incremental Back-up Procedures.
1027-1031
1983
13
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Williamson83
2003-11-25
The Distributed Ada Run-time System DARTS.
1249-1263
1991
21
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#GotheWA91
2003-11-25
Iterative Development of Information Systems: A Case Study.
503-515
1986
16
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Blum86
2003-11-25
Engineering software reuse for on-board embedded real-time systems.
233-264
2002
32
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#VardanegaC02
2003-11-25
A Software Process for the Construction of Predictable On-Board Embedded Real-Time Systems.
235-266
1999
29
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#VardanegaK99
2003-12-10
PLEIADES: An Internet-based parallel/distributed system.
1035-1049
2002
32
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#KoulopoulosPGH02
2003-11-25
Transparent Process Migration: Design Alternatives and the Sprite Implementation.
757-785
1991
21
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#DouglisO91
2003-11-25
Specifications.: Formal and Informal-A Case Study.
433-444
1982
12
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Gehani82
2003-11-25
An Electronic Form System-An Experience in Prototyping.
479-486
1983
13
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Gehani83
2003-11-25
Ada's Derived Types and Units of Measure.
555-569
1985
15
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Gehani85
2003-11-25
Message Passing in Concurrent C: Synchronous Versus Asynchronous.
571-592
1990
20
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#Gehani90
2003-11-25
Exceptional C or C with Exceptions.
827-848
1992
22
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#Gehani92
2003-11-25
A Recovery Block Scheme for a VAX11/750 Running Unix.
561-596
1988
18
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#HobleyJ88
2003-11-25
Edison -N-an Edison Implementation for a Network of Microcomputers.
349-363
1988
18
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#DubnickiMW88
2003-11-25
A mostly-copying collector component for class templates.
445-470
2001
31
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#NishanovS01
2003-11-25
A Pattern Matching System.
517-530
1982
12
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Sommerville82
2003-11-25
COMLNK-a File Transport and Job Entry Utility for a Communication Link.
173-177
1977
7
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#BosT77
2003-11-25
A Scalability Test for Parallel Code.
1299-1314
1995
25
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#LyonKL95
2003-11-25
A realistic involvement of formal methods.
191-208
2001
31
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#BegayR01
2003-11-25
Coping with aliasing in the GNU Eiffel Compiler implementation.
601-613
2001
31
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#ZendraC01
2003-11-25
Linguistic Mechanisms for Resource Management Strategies.
291-314
1981
11
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#AncilottiLBN81
2003-11-25
Reactive C: An Extension of C to Program Reactive Systems.
401-428
1991
21
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#Boussinot91
2004-02-04
The Design and Implementation of an Interactive Document Editor.
271-279
1976
6
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#CoulourisDHPRW76
2003-11-25
Experience With an Object-oriented Virtual Machine.
415-425
1988
18
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#Sandberg88
2003-11-25
Colony: An Artificial Life Model for Active Autonomous Objects.
1373-1384
1996
26
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Chou96
2003-11-25
Managing Multi-Party Documents in a Network Computing Environment.
1315-1325
1998
28
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#Chou98
2003-11-25
The Design of an Object-oriented Command Interpreter.
35-51
1989
19
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe19.html#Budd89
2003-11-25
An index allocation tool for object-oriented database systems.
973-1002
2000
30
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#BertinoCF00
2003-11-25
Pictures that Play: Design Notations for Real-time and Distributed Systems.
895-931
1993
23
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#Buhr93
2003-11-25
LEKTOR-A List-oriented, Machine-independent Programming System for Conversational Applications.
447-463
1976
6
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#Hummel76
2003-11-25
A Failure Tolerant Filing System.
287-291
1972
2
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe2.html#Whaley72
2003-11-25
Efficient Generation of Lexical Analysers.
1089-1103
1989
19
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe19.html#Grosch89
2003-11-25
Lalr - A Generator for Efficient Parsers.
1115-1135
1990
20
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#Grosch90
2003-11-25
The Design and Implementation of a Code Generation Tool.
1027-1041
1982
12
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#AkinL82
2004-03-04
Structured Dataflow Analysis for Arrays and its Use in an Optimizing Compiler.
133-155
1990
20
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#GrossS90
2003-11-25
Editorial: Discrete algorithm engineering.
1165
2000
30
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#WagnerW00
2003-11-25
ALADIN: A Scanner Generator for Incremental Programming Environments.
1011-1025
1992
22
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#FischerHS92
2003-11-25
Word-based Text Compression.
185-198
1989
19
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe19.html#Moffat89
2005-01-17
An Improved Data Structure for Cumulative Probability Tables.
647-659
1999
29
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#Moffat99
http://dx.doi.org/10.1002/(SICI)1097-024X(199906)29:7<647::AID-SPE252>3.0.CO;2-5
2003-11-25
An Experiment in Language Design for Distributed Systems.
957-971
1984
14
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#CrookesE84
2003-11-25
Design and Implementation of a File System with On-the-fly Data Compression for GNU/Linux.
863-874
1999
29
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#BhagwatGM99
2003-11-25
Improving the Efficiency of Direct-Memory-Access Output Operations.
179-183
1973
3
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe3.html#Cohn73
2003-11-25
A Note on Space Filling Curves.
1181-1189
1983
13
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Cole83
2003-11-25
A Method for Interconnecting Heterogeneous Computer Networks.
387-397
1987
17
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#Cole87
2003-11-25
Playing Cards on the PERQ: An Algorithm for Overlapping Rectangles.
1043-1053
1983
13
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Cook83
2003-11-25
Declarative Specification of the Architecture of a Software Development Environment.
143-174
1995
25
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#AmbriolaCC95
2003-11-25
One-pass Compilation at its Limits-A Modula-2 Compiler for the Xerox Dragon Computer.
469-484
1987
17
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#Gutknecht87
2003-11-25
Practical Fast Searching in Strings.
501-506
1980
10
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#Horspool80
2003-11-25
CCC: A Caching Compiler for C.
155-165
1997
27
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#Horspool97
2003-11-25
A HELP System for the User Community.
219-229
1980
10
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#CoxW80
2003-11-25
Modularization of Large Programs.
497-520
1981
11
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#HendersonG81
2003-11-25
A Comparison of Object-oriented Programming in Four Modern Languages.
1077-1095
1994
24
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#HendersonZ94
2003-11-25
Compiling Techniques to Exploit the Pattern of Language Use.
527-539
1976
6
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#PartridgeJ76
2003-11-25
A Poor Man's Realization of Attribute Grammars.
719-728
1979
9
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Papakonstantinou79
2003-11-25
Simulating the DYNIX Operating System Parallel Programming Interface on a UNIX System.
463-480
1998
28
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#Badii98
2003-11-25
JGAP: a Java-based graph algorithms platform.
615-635
2001
31
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#ChenCT01
2005-05-24
Dynamic Distributed Systems.
355-371
1983
13
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Whiddett83
2003-11-25
Monitoring the Operation of System Software.
383-389
1971
1
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe1.html#Cuming71
2003-11-25
The Implementation and Use of Toolpack/1 on a Graphics Workstation.
561-573
1987
17
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#BroomH87
2003-11-25
Coupling Hundreds of Workstations for Parallel Molecular Sequence Analysis.
291-304
1995
25
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#Strumpen95
2003-11-25
Multistage Indexing for Speeding Prolog Executions.
1097-1119
1994
24
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#ChenRR94
2003-11-25
Adding Graphics to a High-level Programming Language.
637-655
1995
25
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#JefferyGT95
2003-11-25
Polymorphic Programming II. An Orthogonal Tagged High Level Architecture Abstract Machine.
1021-1046
1984
14
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#GunnH84
2005-03-03
Applying design metrics to predict fault-proneness: a case study on a large-scale software system.
1587-1608
2000
30
Softw., Pract. Exper.
14
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#WongHSZZ00
2003-11-25
MILLIPEDE: Easy Parallel Programming in Available Distributed Environments.
929-965
1997
27
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#FriedmanGIS97
2003-11-25
Taming access control security: extending capabilities using the views relationship.
341-358
2002
32
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#MarkiewiczLC02
2003-11-25
Design and Implementation of a Distributed File System.
657-675
1991
21
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe21.html#ChengS91
2003-11-25
Seperate Compilation in a Modula-2 Compiler.
101-106
1986
16
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Foster86
2003-11-25
Implementation of a Declarative State-transition System.
351-370
1989
19
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe19.html#Foster89
2003-11-25
Design of Software for Text Composition.
313-323
1979
9
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#NarwekarM79
2003-11-25
The Formal Definition of Human/Machine Communications.
51-58
1978
8
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe8.html#LawsonBS78
2003-11-25
Branded interface toolkits.
1131-1142
2001
31
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#Kotula01
2003-11-25
Discovering Patterns: An Industry Report.
1261-1276
1996
26
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Kotula96
2003-11-25
On the design of CGAL a computational geometry algorithms library.
1167-1202
2000
30
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#FabriGKSS00
2003-11-25
APET-A Versatile Tool for Estimating Computer Application Performance.
385-395
1973
3
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe3.html#Baird73
2003-11-25
Design, implementation and evolution of object oriented frameworks: concepts and guidelines.
277-300
2001
31
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#GurpB01
2003-11-25
CDC 6000-Series Register Save/Restore.
377-387
1972
2
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe2.html#Baker72
2003-11-25
The Implementation of Synchronizing Operations in Various Environment.
115-126
1977
7
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#Wettstein77
2003-11-25
Portability-Prediction and Correction.
69-69
1976
6
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#HagueF76
2003-11-25
Low Cost Computer Graphics for Micro Computers.
767-776
1982
12
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Morrison82
2003-11-25
An Assessment of a New Technique for the Representation of Boolean Matrices.
115-139
1982
12
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Dodd82
2003-11-25
A Correctness Proof of an Indenting Program.
199-226
1983
13
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#MatetiJ83
2003-11-25
Design of a MUMPS Interpreter.
1293-1297
1981
11
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#Brown81a
2003-11-25
Integrating Distributed Array Processing into EMAS 2900.
517-529
1986
16
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Brown86a
2003-11-25
The SUPERMAC Macro Processor in Pascal.
295-304
1983
13
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#BrownO83
2003-11-25
A Methodology and Notation for Compiler Front End Design.
335-346
1984
14
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#BrownP84
2003-11-25
Converting Help Systems to Hypertext.
163-165
1988
18
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#BrownR88
2003-11-25
A Proxy Approach to e-Mail Security.
1049-1060
1999
29
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#BrownS99
2003-11-25
Implementation of an Editing Algorithm Allowing Repeating Corrections.
373-381
1971
1
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe1.html#Poole71a
2003-11-25
Partitioned and Prioritized Access to Timesharing Services: the Reserved Availability.
689-696
1981
11
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#Hunter81
2003-11-25
A Simple Network Interacting Program's Executive (SNIPE).
341-345
1977
7
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#Holdsworth77
2003-11-25
A System for Analysing Ada Programs at Run-time.
407-421
1983
13
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Holdsworth83
2003-11-25
Implementation of a Pascal Compiler for the IBM 360.
371-376
1976
6
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#RusselS76
2003-11-25
Automatic layout of statecharts.
25-55
2002
32
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe32.html#CastelloMT02
2003-11-25
Bonsai: a Compact Representation of Trees.
277-291
1993
23
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#DarraghCW93
2003-11-25
How to Improve Computer Advisory Services.
857-877
1982
12
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#DawsonCA82
2003-11-25
A Simple Language is also a Functional Language.
219
1985
15
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Wadler85
2003-11-25
Fixing some Space Leaks with a Garbage Collector.
595-608
1987
17
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#Wadler87
2003-11-25
Reducing Object Storage Requirements in a Multi-user Environment.
235-241
1993
23
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#BoysenS93
2003-11-25
<i>k</i>-shortest-paths Algorithm for Facility Restoration.
823-834
1994
24
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#MacGregorG94
2003-11-25
The Design and Use of a Prolog Trace Generator for CSP.
423-438
1987
17
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#Kourie87
2003-11-25
The Advantages of Stream Output Procedures over Format-dominated Record Transmissions.
347-356
1977
7
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#HunterKW77
2003-11-25
PBASIC-A Verifier for BASIC.
175-181
1980
10
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#Hopkins80
2003-11-25
Restructuring Software: A Case Study.
967-982
1996
26
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Hopkins96
2003-11-25
Experiments on Six Commercial TCP Implementations Using a Software Fault Injection Tool.
1385-1410
1997
27
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#DawsonJM97
2003-11-25
An Object-oriented Approach to Application Generation.
623-645
1987
17
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#HoeveE87
2003-11-25
Perspectives on Optimistically Replicated, Peer-to-Peer Filing.
155-180
1998
28
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#PageGHRRGKP98
2003-11-25
Migrating legacy scientific applications towards CORBA-based client-server architectures.
1313-1330
2001
31
Softw., Pract. Exper.
14
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#SangFKLT01
2003-11-25
Notes on the case Statement.
289-298
1974
4
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Barth74
2003-11-25
A General Character to Integer Conversion Method.
761-766
1985
15
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Parker85
2003-11-25
Aesthetics-Based Graph Layout for Human Consumption.
1415-1438
1996
26
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Parker96
2003-11-25
A PREttier Compiler-Compiler: Generating Higher-order Parsers in C.
1263-1297
1995
25
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#BreuerB95
2003-11-25
Extension Table Built-ins for Prolog.
573-597
1992
22
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#FanD92
2003-11-25
An Approach for Decomposing N-Ary Data Relationships.
125-154
1998
28
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#McAllisterS98
2003-11-25
Virtual Storage on ICL 1900's.
125-128
1974
4
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Farr74
2003-11-25
University Computing Advisory Services: The Study of the Man-Computer Interface.
919-934
1980
10
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#AltyC80
2003-11-25
A Vector C and Fortran Compiler for the FPS T-Series: Experiences with Compiling to occam I.
371-390
1992
22
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#StevensonACJR92
2003-11-25
An Operating System Independent WORM Archival System.
521-531
1995
25
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#RussoRP95
2003-11-25
Stabdump-A Dump Interpreter Program to Assist Debugging.
329-332
1980
10
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#McGregorM80
2003-11-25
Design for a Robust, Simple and Highly Reliable Filestore.
943-947
1981
11
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#McGregorM81
2003-11-25
WSH-A New Command Interpreter for UNIX.
1197-1205
1984
14
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#BresnahanBM84
2003-11-25
The NAG Library 'Machine'.
65-72
1979
9
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#FordBCH79
2003-11-25
Dynamic Storage Allocation: Experiments Using the C Language.
693-704
1985
15
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#GaiM85
2003-11-25
Squinting at Power Series.
661-683
1990
20
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#McIlroy90
2003-11-25
A Killer Adversary for Quicksort.
341-344
1999
29
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#McIlroy99
2003-11-25
<i>fsh</i>- A Functional UNIX Command Interpreter.
685-700
1987
17
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#McDonald87
2003-11-25
An Approach to Automatic Display Layout Using Combinatorial Optimization Algorithms.
1183-1202
1995
25
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#LudersES95
2003-11-25
A Multi-Terminal Benchmark.
43-59
1973
3
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe3.html#HoldsworthRW73
2003-11-25
A Simplification of Code Tables in a One-pass PL/M Compiler.
399-405
1978
8
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe8.html#Johnsen78
2003-11-25
alto: a link-time optimizer for the Compaq Alpha.
67-101
2001
31
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#MuthDWB01
2003-11-25
Dedicated, Distributed and Portable Operating Systems: a Structuring Concept.
1079-1093
1984
14
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#Valdorf84
2003-11-25
Pitfalls of Conservative Garbage Collection.
719-727
1990
20
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#Wentworth90
2003-11-25
Translator Design to Support Run-time Debugging.
1035-1041
1979
9
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Johnson79
2003-11-25
Anatomy of an Educational Network Database System.
739-754
1984
14
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#Johnson84
2003-11-25
A Debugger for Concurrent Programs.
539-554
1985
15
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Gait85
2003-11-25
A Probe Effect in Concurrent Programs.
225-233
1986
16
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Gait86
2003-11-25
CIRL/PIWI: a GUI Toolkit Supporting Retargetability.
511-527
1993
23
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#CowanDGP93
2003-11-25
A Database of Groups of Prime-power Order.
911-951
1994
24
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#ButlerIO94
2003-11-25
Memoryless Execution: A Programmer's Viewpoint.
463-471
1976
6
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#GatS76
2003-11-25
Hybrid Genetic Algorithms for a Rostering Problem.
851-862
1996
26
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#Monfroglio96a
2003-11-25
Compilation of Functional Languages using Flow Graph Analysis.
127-173
1994
24
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#HartelGW94
2003-11-25
The NMFECC Cray Time-Sharing System.
87-103
1985
15
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Fong85
2003-11-25
An Efficient Implementation of Trie Structures.
695-721
1992
22
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#AoeMS92
2003-11-25
Development of an Advanced Satellite System.
203-210
1975
5
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe5.html#FoxL75
2005-11-15
A Data-directed Approach to Program Construction.
355-372
1980
10
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#CowanGWL80
2003-11-25
An On-Line Data Collection System for Film Measurement.
389-396
1972
2
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe2.html#BracherMA72
2003-11-25
Implementing ALGOL 68 Predicates.
87-97
1986
16
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#PatelH86
2003-11-25
Systems Programming for Data Communications on Minicomputers.
283-305
1980
10
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#PatelP80
2003-11-25
LexAGen: An Interactive Incremental Scanner Generator.
459-483
1990
20
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#SzafronN90
2003-11-25
An enhanced thread synchronization mechanism for Java.
667-695
2001
31
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe31.html#ChiaoY01
2003-11-25
On the Design of a Special-purpose Scientific Programming Language.
893-907
1983
13
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#KnightD83
2003-11-25
Using Multicast Communications to Distribute Code and Data in Wide Area Networks.
563-577
1995
25
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#KnightG95
2003-11-25
Data Metastructures.
795-811
1979
9
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#SandersG79
2003-11-25
Software Development Tools for Microcontrollers.
459-472
1985
15
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#KnightR85
2003-11-25
Low-Cost, Concurrent Checking of Pointer and Array Accesses in C Programs.
87-110
1997
27
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#PatilF97
2003-11-25
Memory Allocation Costs in Large C and C++ Programs.
527-542
1994
24
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe24.html#DetlefsDZ94
2003-11-25
CHEF: a Versatile Portable Text Editor.
467-477
1981
11
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#MacleanP81
2003-11-25
A Highly-structured Interpreter for a SNOBOL4 Subset.
281-312
1979
9
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Pagan79
2003-11-25
Toward Complete Programming Language Descriptions that are both Formal and Understandable.
199-206
1984
14
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#Pagan84
2003-11-25
Converting Interpreters into Compilers.
509-527
1988
18
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#Pagan88
2003-11-25
An Evaluation of Throw-away Compiling.
241-249
1983
13
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Robson83
2006-02-01
A Note on Recreating Source Code from the Reverse Polish Form.
151-153
1973
3
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe3.html#CharltonH73
2003-11-25
Editors: Two for the Price of One.
195-202
1981
11
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#CharltonL81
2003-11-25
Aids for Pragmatic Error Detection.
59-66
1983
13
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#CharltonL83
2003-11-25
Tools and Techniques for Teaching Microprocessor Software Development.
909-920
1983
13
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#CharltonM83
2003-11-25
A Microprogrammed P-CODE Interpreter for the Data General Eclipse S/130 Minicomputer.
755-765
1982
12
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Hall82
2003-11-25
Lexical Analysis of Inflected Arabic Words using Exhaustive Search of an Augmented Transition Network.
567-588
1993
23
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#RafeaS93
2003-11-25
Pattern Analysis as a Tool for Inventing Algorithms.
405-417
1980
10
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#Hart80
2003-11-25
Experience with Logical Code Analysis in Software Maintenance.
1243-1262
1995
25
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#Hart95
2003-11-25
Enumerated Types in Java.
291-297
1999
29
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe29.html#Cairns99
2003-11-25
A Portable Virtual Machine for Ada.
17-29
1984
14
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#Ibsen84
2003-11-25
Debugging Other Languages in APL.
139-145
1975
5
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe5.html#Geller75
2003-11-25
A Monitor Tool for a Network Based on the Cambridge Ring.
671-687
1986
16
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#VassiliadesSB86
2003-11-25
Software Reliability Models for Computer Implementations - An Empirical Study.
135-164
1996
26
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe26.html#TriantafyllosV96
2004-11-11
A Case for make
S1/35-S1/46
1990
20
Softw., Pract. Exper.
S1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#Fowler90
2003-11-25
GLUnix: A Global Layer Unix for a Network of Workstations.
929-961
1998
28
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe28.html#PetrouRVA98
2003-11-25
Monitoring the Run-time Activity of Algol 68-R Programs.
29-34
1978
8
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe8.html#FoxleyM78
2004-05-27
A Language for Inquiring about the Run-time Behaviour of Programs.
445-460
1977
7
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#CohenC77
2004-05-27
Software Tools for Micro-analysis of Programs.
777-808
1992
22
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#CohenW92
2003-11-25
Application Integration: Constructing Composite Applications from Interactive Components.
255-275
1993
23
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe23.html#CowanSIL93
2003-11-25
Suitable Multiprocessor Structures and Virtual Storage Management when Applying a Feasible Scheduling Algorithm in Hard Real-Time Environment.
761-769
1986
16
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Halang86
2003-11-25
List Structures in SIMULA and PL/1-a Comparison.
379-388
1974
4
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Palme74
2003-11-25
Experience from the Standardization of the SIMULA Programming Language.
405-409
1976
6
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe6.html#Palme76
2003-11-25
How I Fought with Hardware and Software and Succeeded.
77-83
1978
8
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe8.html#Palme78
2003-11-25
A Human-Computer Interface for Non-computer Specialists.
741-747
1979
9
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#Palme79
2003-11-25
A Viewdata Interface for Arbitrary Computer Programs.
987-991
1980
10
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#Palme80
2003-11-25
Uses of the SIMULA Process Concept.
153-161
1982
12
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Palme82
2003-11-25
Full-screen Editing in a Hostile Environment.
975-981
1981
11
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe11.html#Cargill81
2003-11-25
A Robust Distributed Solution to the Dining Philosophers Problem.
965-969
1982
12
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Cargill82
2003-11-25
Implementation of the Blit Debugger.
153-168
1985
15
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Cargill85
2003-11-25
Modularity of Computer Languages.
929-958
1982
12
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Beech82
2003-11-25
Compiler Performance Analysis Tools.
917-921
1988
18
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#HeinesJ88
2003-11-25
Implementation of a Retrospective Tracing Facility.
791-796
1983
13
Softw., Pract. Exper.
9
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Malone83
2003-11-25
Allocating Computer Resources to Satisfy User and Management Demands.
311-321
1984
14
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#PoschH84
2003-11-25
An infrastructure for generating and sharing experimental workloads for persistent object systems.
387-417
2000
30
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe30.html#HumphriesKWZ00
2003-11-25
Pulsar: An Extensible Tool for Monitoring Large Unix Sites.
1163-1176
1997
27
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe27.html#Finkel97
2003-11-25
Process Scheduling and UNIX Semaphores
Softw., Pract. Exper.
25
10
1995
1141-1153
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#DunstanF95
2003-11-25
Optimization of Expression Syntax: an Experimental Approach.
269-276
1985
15
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Bertsch85
2003-11-25
Inter-process Communication in MVS/XA and Applications for Scientific and Engineering Information Processing.
489-501
1986
16
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Marinescu86
2003-11-25
Typesetting Mathematics on Multi-Access Systems.
131-138
1983
13
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Day83
2003-11-25
A Browser for Directed Graphs.
61-76
1987
17
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe17.html#RoweDMMST87
2003-11-25
Topic Libraries for Mathematical Computation.
397-411
1985
15
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe15.html#Cox85
2003-11-25
An Assessment of Concurrent Pascal.
827-837
1979
9
Softw., Pract. Exper.
10
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe9.html#ColemanGHP79
2003-11-25
Non-recursive Recursion.
263-269
1977
7
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe7.html#CarpenterDH77
2003-11-25
The Eductive Implementation of a Three-dimensional Spreadsheet.
1097-1114
1990
20
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#DuW90
2003-11-25
A Universal Benchmark?
355-358
1973
3
Softw., Pract. Exper.
4
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe3.html#BellHL73
2003-11-25
A Selection Algorithm with a Practical Upper Bound on Expected Number.
1105-1110
1989
19
Softw., Pract. Exper.
11
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe19.html#ParkK89
2003-11-25
Incremental Semantic Evaluation in Language-based Editors.
111-135
1992
22
Softw., Pract. Exper.
2
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe22.html#KiongW92
2006-09-29
<i>LL(k)</i>Parser Generator.
789-810
1995
25
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe25.html#ParrQ95
2003-11-25
A Graphical User Interface Server for UNIX.
1227-1239
1990
20
Softw., Pract. Exper.
12
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#HudsonM90
2003-11-25
The Myth of Multiprogramming.
59-62
1974
4
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe4.html#Schneck74
2003-11-25
The Myth of Virtual Memory.
537-543
1983
13
Softw., Pract. Exper.
6
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe13.html#Schneck83
2003-11-25
Superlinear Speed-Up and the Halting Problem.
781-782
1986
16
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe16.html#Schneck86
2003-11-25
Benchmarking a Multi-access System.
45-55
1980
10
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#Gay80
2003-11-25
Coroutine Behaviour and Implementation.
189-204
1980
10
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe10.html#PauliS80
2004-05-04
Unscrambling Non-sequential Programs.
39-50
1988
18
Softw., Pract. Exper.
1
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#Finnie88
2003-11-25
Statistics on Graph Reduction of SASL Programs.
239-253
1988
18
Softw., Pract. Exper.
3
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe18.html#HartelV88
2003-11-25
A Symbolic Debugger for Real-time Embedded Ada Software.
499-514
1990
20
Softw., Pract. Exper.
5
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe20.html#LyttleF90
2003-11-25
Computer System Simulation in Pascal.
777-784
1982
12
Softw., Pract. Exper.
8
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe12.html#Hac82
2003-11-25
PL/I as a Discrete Event Simulation Tool.
697-702
1984
14
Softw., Pract. Exper.
7
http://www.informatik.uni-trier.de/~ley/db/journals/spe/spe14.html#Hac84