Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=275
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimulation indexes and their applications
Mingsheng Ying
Theoretical Computer Science
275
(1-2), 2002, pp. 1-68
A note on iterated duals of certain topological spaces
Bruce S. Burdick
Theoretical Computer Science
275
(1-2), 2002, pp. 69-77
Taut monads and
T0
-spaces
Ernest G. Manes
Theoretical Computer Science
275
(1-2), 2002, pp. 79-109
Finite variability interpretation of monadic logic of order
A. Rabinovich
Theoretical Computer Science
275
(1-2), 2002, pp. 111-125
Analysis issues in Petri nets with inhibitor arcs
Nadia Busi
Theoretical Computer Science
275
(1-2), 2002, pp. 127-177
Correspondence and translation for heterogeneous data
Serge Abiteboul
,
Sophie Cluet
,
Tova Milo
Theoretical Computer Science
275
(1-2), 2002, pp. 179-213
Open and closed scopes for constrained genericity
Dominic Duggan
,
John Ophel
Theoretical Computer Science
275
(1-2), 2002, pp. 215-258
A causal semantics for CCS via rewriting logic
Pierpaolo Degano
,
Fabio Gadducci
,
Corrado Priami
Theoretical Computer Science
275
(1-2), 2002, pp. 259-282
Program schemes, arrays, Lindström quantifiers and zero-one laws
Iain A. Stewart
Theoretical Computer Science
275
(1-2), 2002, pp. 283-310
Monadic second-order logic on tree-like structures
Igor Walukiewicz
Theoretical Computer Science
275
(1-2), 2002, pp. 311-346
Decidable verification for reducible timed automata specified in a first order logic with time
Danièle Beauquier
,
Anatol Slissenko
Theoretical Computer Science
275
(1-2), 2002, pp. 347-388
Approximate reasoning by similarity-based SLD resolution
Maria I. Sessa
Theoretical Computer Science
275
(1-2), 2002, pp. 389-426
On abstract data types presented by multiequations
J. Adámek
,
M. Hébert
,
J. Rosický
Theoretical Computer Science
275
(1-2), 2002, pp. 427-462
\forall\exists^5
-equational theory of context unification is undecidable
Sergei Vorobyov
Theoretical Computer Science
275
(1-2), 2002, pp. 463-479
Additive models of probabilistic processes
Mingsheng Ying
Theoretical Computer Science
275
(1-2), 2002, pp. 481-519
Operational and abstract semantics of the query language G-Log
Agostino Cortesi
,
Agostino Dovier
,
Elisa Quintarelli
,
Letizia Tanca
Theoretical Computer Science
275
(1-2), 2002, pp. 521-560
Peirce's rule in natural deduction
Ernst Zimmermann
Theoretical Computer Science
275
(1-2), 2002, pp. 561-574
A coinductive completeness proof for the equivalence of recursive types
Felice Cardone
Theoretical Computer Science
275
(1-2), 2002, pp. 575-587
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Walter Vogler
Theoretical Computer Science
275
(1-2), 2002, pp. 589-631
Query automata over finite trees
Frank Neven
,
Thomas Schwentick
Theoretical Computer Science
275
(1-2), 2002, pp. 633-674
Observational proofs by rewriting
Adel Bouhoula
,
Michaël Rusinowitch
Theoretical Computer Science
275
(1-2), 2002, pp. 675-698