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=368
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A flexible model for dynamic linking in Java and C\#
Sophia Drossopoulou
,
Giovanni Lagorio
,
Susan Eisenbach
Theoretical Computer Science
368
(1-2), 2006, pp. 1-29
Generalized ultrametric spaces in quantitative domain theory
Markus Krötzsch
Theoretical Computer Science
368
(1-2), 2006, pp. 30-49
Invariance under stuttering in a temporal logic of actions
Michael Kaminski
Theoretical Computer Science
368
(1-2), 2006, pp. 50-63
Type checking a multithreaded functional language with session types
Vasco T. Vasconcelos
,
Simon J. Gay
,
António Ravara
Theoretical Computer Science
368
(1-2), 2006, pp. 64-87
Rewriting queries using views in the presence of arithmetic comparisons
Foto Afrati
,
Chen Li
,
Prasenjit Mitra
Theoretical Computer Science
368
(1-2), 2006, pp. 88-123
A logical approach to stable domains
Yi-Xiang Chen
,
Achim Jung
Theoretical Computer Science
368
(1-2), 2006, pp. 124-148
A formal fuzzy reasoning system and reasoning mechanism based on propositional modal logic
Zaiyue Zhang
,
Yuefei Sui
,
Cungen Cao
,
Guohua Wu
Theoretical Computer Science
368
(1-2), 2006, pp. 149-160
An undecidability result for AGh
Stéphanie Delaune
Theoretical Computer Science
368
(1-2), 2006, pp. 161-167
Erratum to ''On the expressiveness of higher dimensional automata''
R.J. van Glabbeek
Theoretical Computer Science
368
(1-2), 2006, pp. 168-194
Faster two-dimensional pattern matching with rotations
Amihood Amir
,
Oren Kapah
,
Dekel Tsur
Theoretical Computer Science
368
(3), 2006, pp. 196-204
A computational model for RNA multiple structural alignment
Eugene Davydov
,
Serafim Batzoglou
Theoretical Computer Science
368
(3), 2006, pp. 205-216
Finding biclusters by random projections
Stefano Lonardi
,
Wojciech Szpankowski
,
Qiaofeng Yang
Theoretical Computer Science
368
(3), 2006, pp. 217-230
A simple optimal representation for balanced parentheses
Richard F. Geary
,
Naila Rahman
,
Rajeev Raman
,
Venkatesh Raman
Theoretical Computer Science
368
(3), 2006, pp. 231-246