2003-11-19
Bisimulation and Action Refinement.
173-200
1993
114
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs114.html#Vogler93
2003-11-19
Processes of timed Petri nets.
1-34
2000
243
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs243.html#Winkowski00
http://dx.doi.org/10.1016/S0304-3975(98)00188-1
2003-11-19
Behaviours of Concurrent Systems.
39-60
1980
12
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs12.html#Winkowski80
2003-11-19
An Algebraic Description of System Behaviours.
315-340
1982
21
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs21.html#Winkowski82
2003-11-19
A Syntactic Theory of Sequential State.
243-287
1989
69
Theor. Comput. Sci.
3
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs69.html#FelleisenF89
2003-11-19
The Revised Report on the Syntactic Theories of Sequential Control and State.
235-271
1992
103
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs103.html#FelleisenH92
2003-11-19
Universality of the Chip-Firing Game.
121-134
1997
172
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs172.html#GolesM97
http://dx.doi.org/10.1016/S0304-3975(95)00242-1
2003-11-19
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
175-210
1999
228
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs228.html#MaraistOTW99
http://dx.doi.org/10.1016/S0304-3975(98)00358-2
2003-11-19
Pushdown automata, multiset automata, and Petri nets.
3-21
2001
256
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs256.html#HirshfeldM01
http://dx.doi.org/10.1016/S0304-3975(00)00099-2
2003-11-19
The impact of information on broadcasting time in linear radio networks.
449-471
2002
287
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs287.html#DiksKKP02
2003-11-19
Anonymous Wireless Rings.
95-109
1995
145
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs145.html#DiksKMP95
http://dx.doi.org/10.1016/0304-3975(94)00178-L
2003-11-19
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
69-98
1994
127
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs127.html#CoquideDGV94
2003-11-19
Eliminating Partially Dead Code in Explicitly Parallel Programs.
365-393
1998
196
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs196.html#Knoop98
http://dx.doi.org/10.1016/S0304-3975(97)00208-9
2003-11-19
On a Generalized Product of Domains.
103-125
1993
119
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs119.html#Dosch93
2003-11-19
Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic.
207-214
1992
102
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs102.html#Dosen92
2003-11-19
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.
1-14
1991
88
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs88.html#GavaldaB91
2003-11-19
On the Semantics of Message Passing Processes.
1999
29
Electr. Notes Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/entcs29.html#Errington99
http://www.elsevier.nl/locate/entcs/volume29.html
2003-11-19
Relating Polynomial Time to Constant Depth.
159-170
1998
207
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs207.html#Vollmer98
http://dx.doi.org/10.1016/S0304-3975(98)00061-9
2003-11-19
Infinite Regular Thue Systems.
171-192
1983
25
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs25.html#ODunlaing83
2003-11-19
On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games.
355-369
1993
112
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs112.html#AslamD93
2003-11-19
Combinatory Reduction Systems: Introduction and Survey.
279-308
1993
121
Theor. Comput. Sci.
1&2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs121.html#KlopOR93
2003-11-19
Regular Relations and Bicartesian Squares.
187-192
1994
129
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Banach94
2003-11-19
Locating the Contractum in the Double Pushout Approach.
305-320
1995
152
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs152.html#Banach95
http://dx.doi.org/10.1016/0304-3975(94)00301-4
2003-11-19
On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes.
239-247
1987
51
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs51.html#Parberry87
2003-11-19
Approximate pattern matching and transitive closure logics.
387-412
2003
1-3
Theor. Comput. Sci.
299
http://dx.doi.org/10.1016/S0304-3975(02)00484-X
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs299.html#LemstromH03
2003-11-19
Watermelon uniform random generation with applications.
241-256
2003
307
Theor. Comput. Sci.
2
http://dx.doi.org/10.1016/S0304-3975(03)00218-4
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs307.html#BonichonM03
2003-11-19
Variations on a Game of Gale (II): Markov Strategies.
385-396
1994
129
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs129.html#Scheepers94
2003-11-19
Paraconsistent Disjunctive Deductive Databases.
115-141
1992
93
Theor. Comput. Sci.
1
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs93.html#Subrahmanian92
2003-11-19
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues.
99-114
1998
205
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs205.html#GolinZ98
http://dx.doi.org/10.1016/S0304-3975(97)00037-6
2003-11-19
Enumeration of Success Patterns in Logic Programs.
227-240
1984
34
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs34.html#SatoT84
2003-11-19
A survey on interval routing.
217-253
2000
245
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs245.html#Gavoille00
http://dx.doi.org/10.1016/S0304-3975(99)00283-2
2003-11-19
Towards Modular Binding-Time Analysis for First-order Mercury.
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#VanhoofB99
2003-11-19
The complexity of shortest path and dilation bounded interval routing.
85-107
2000
234
Theor. Comput. Sci.
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs234.html#KralovicRS00
http://dx.doi.org/10.1016/S0304-3975(98)00042-5
2003-11-19
The Undecidability of Pattern Matching in Calculi Where Primitive Recursive Functions are Representable.
349-356
1993
107
Theor. Comput. Sci.
2
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs107.html#Dowek93
2003-11-19
Parameter Passing in Algebraic Specification Languages.
45-81
1984
28
Theor. Comput. Sci.
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs28.html#EhrigKTWW84