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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the edge
l\infty
radius of Saitou and Nei's method for phylogenetic reconstruction
Wenqiang Dai
,
Yinfeng Xu
,
Binhai Zhu
Theoretical Computer Science
369
(1-3), 2006, pp. 448-455
Crossing information in two-dimensional Sandpiles
A. Gajardo
,
E. Goles
Theoretical Computer Science
369
(1-3), 2006, pp. 463-469
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
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
An undecidability result for AGh
Stéphanie Delaune
Theoretical Computer Science
368
(1-2), 2006, pp. 161-167
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
Deciding knowledge in security protocols under equational theories
Martín Abadi
,
Véronique Cortier
Theoretical Computer Science
367
(1-2), 2006, pp. 2-32
Compositional analysis of contract-signing protocols
Michael Backes
,
Anupam Datta
,
Ante Derek
,
John C. Mitchell
,
Mathieu Turuani
Theoretical Computer Science
367
(1-2), 2006, pp. 33-56
Formal analysis of Kerberos 5
Frederick Butler
,
Iliano Cervesato
,
Aaron D. Jaggard
,
Andre Scedrov
,
Christopher Walstad
Theoretical Computer Science
367
(1-2), 2006, pp. 57-87
On the semantics of Alice&Bob specifications of security protocols
Carlos Caleiro
,
Luca Viganò
,
David Basin
Theoretical Computer Science
367
(1-2), 2006, pp. 88-122
Probable innocence revisited
Konstantinos Chatzikokolakis
,
Catuscia Palamidessi
Theoretical Computer Science
367
(1-2), 2006, pp. 123-138
Injective synchronisation: An extension of the authentication hierarchy
C.J.F. Cremers
,
S. Mauw
,
E.P. de Vink
Theoretical Computer Science
367
(1-2), 2006, pp. 139-161
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties
Santiago Escobar
,
Catherine Meadows
,
José Meseguer
Theoretical Computer Science
367
(1-2), 2006, pp. 162-202
A concise functional neural network computing the largest modulus eigenvalues and their corresponding eigenvectors of a real skew matrix
Yiguang Liu
,
Zhisheng You
,
Liping Cao
Theoretical Computer Science
367
(3), 2006, pp. 273-285
Global convergence of Oja's PCA learning algorithm with a non-zero-approaching adaptive learning rate
Jian Cheng Lv
,
Zhang Yi
,
K.K. Tan
Theoretical Computer Science
367
(3), 2006, pp. 286-307
Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
Oleg Izmerly
,
Tal Mor
Theoretical Computer Science
367
(3), 2006, pp. 308-323
A genetic system based on simulated crossover of sequences of two-bit genes
Marco Carpentieri
Theoretical Computer Science
367
(3), 2006, pp. 324-335
Synthesis of multi-qudit hybrid and
d
-valued quantum logic circuits by decomposition
Faisal Shah Khan
,
Marek Perkowski
Theoretical Computer Science
367
(3), 2006, pp. 336-346
Bisimilarity is not finitely based over BPA with interrupt
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Sumit Nain
Theoretical Computer Science
366
(1-2), 2006, pp. 60-81
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>