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=258
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An introduction to metric semantics: Operational and denotational models for programming and specification languages
Franck van Breugel
Theoretical Computer Science
258
(1-2), 2001, pp. 1-98
The algebra of stream processing functions
Manfred Broy
,
Gheorghe Ştefănescu
Theoretical Computer Science
258
(1-2), 2001, pp. 99-129
Structural inclusion in the pi-calculus with replication
Joost Engelfriet
,
Tjalling Gelsema
Theoretical Computer Science
258
(1-2), 2001, pp. 131-168
Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
Ken Mano
,
Mizuhito Ogawa
Theoretical Computer Science
258
(1-2), 2001, pp. 169-208
Objects and their lambda calculus
Athanassios Tzouvaras
Theoretical Computer Science
258
(1-2), 2001, pp. 209-232
Concrete data structures and functional parallel programming
Gaétan Hains
,
Frédéric Loulergue
,
John Mullins
Theoretical Computer Science
258
(1-2), 2001, pp. 233-267
Proofs as computations in linear logic
Giorgio Delzanno
,
Maurizio Martelli
Theoretical Computer Science
258
(1-2), 2001, pp. 269-297
A constraint-based region inference algorithm
Lars Birkedal
,
Mads Tofte
Theoretical Computer Science
258
(1-2), 2001, pp. 299-392
On testing urgency through laziness over processes with durational actions
Flavio Corradini
,
Dino Di Cola
Theoretical Computer Science
258
(1-2), 2001, pp. 393-407
Deciding bisumulation-like equivalences with finite-state processes
Petr Jançar
,
Antonín Kuc̑era
,
Richard Mayr
Theoretical Computer Science
258
(1-2), 2001, pp. 409-433
On interreduction of semi-complete term rewriting systems
Bernhard Gramlich
Theoretical Computer Science
258
(1-2), 2001, pp. 435-451
Grid structures and undecidable constraint theories
Franck Seynhaeve
,
Sophie Tison
,
Marc Tommasi
,
Ralf Treinen
Theoretical Computer Science
258
(1-2), 2001, pp. 453-490
On model checking for the
\mu
-calculus and its fragments
E. Allen Emerson
,
Charanjit S. Jutla
,
A. Prasad Sistla
Theoretical Computer Science
258
(1-2), 2001, pp. 491-522
On the equivalence of the static and disjunctive well-founded semantics and its computation
Stefan Brass
,
Jürgen Dix
,
Ilkka Niemelä
,
Teodor C. Przymusinski
Theoretical Computer Science
258
(1-2), 2001, pp. 523-553
Optimal placement of data replicas in distributed database with majority voting protocol
Shashi Shekhar
,
Weili Wu
Theoretical Computer Science
258
(1-2), 2001, pp. 555-571
On the Petri net realization of context-free graphs
Philippe Darondeau
Theoretical Computer Science
258
(1-2), 2001, pp. 573-598