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=192
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Higher-order rewrite systems and their confluence
Richard Mayr
,
Tobias Nipkow
Theoretical Computer Science
192
(1), 1998, pp. 3-29
Bubbles in modularity
Massimo Marchiori
Theoretical Computer Science
192
(1), 1998, pp. 31-54
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Géraud Sénizergues
Theoretical Computer Science
192
(1), 1998, pp. 55-75
A rewrite mechanism for logic programs with negation
Siva Anantharaman
,
Gilles Richard
Theoretical Computer Science
192
(1), 1998, pp. 77-106
Combination of constraint solvers for free and quasi-free structures
Franz Baader
,
Klaus U. Schulz
Theoretical Computer Science
192
(1), 1998, pp. 107-161
A process algebraic view of Linda coordination primitives
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Theoretical Computer Science
192
(2), 1998, pp. 167-199
A lambda-calculus for dynamic binding
Laurent Dami
Theoretical Computer Science
192
(2), 1998, pp. 201-231
Refining multiset transformers
Chris Hankin
,
Daniel le Métayer
,
David Sands
Theoretical Computer Science
192
(2), 1998, pp. 233-258
Entailment-based actions for coordination
Luís Monteiro
,
António Porto
Theoretical Computer Science
192
(2), 1998, pp. 259-286
A process-calculus-based abstraction for coordinating multi-agent groups
Manibrata Mukherji
,
Dennis Kafura
Theoretical Computer Science
192
(2), 1998, pp. 287-314
Interactive foundations of computing
Peter Wegner
Theoretical Computer Science
192
(2), 1998, pp. 315-351