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=371
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Edwin J. Beggs
,
John V. Tucker
Theoretical Computer Science
371
(1-2), 2007, pp. 4-19
Quorum sensing
P
systems
Francesco Bernardini
,
Marian Gheorghe
,
Natalio Krasnogor
Theoretical Computer Science
371
(1-2), 2007, pp. 20-33
Connectionist modal logic: Representing modalities in neural networks
Artur S. d'Avila Garcez
,
Luís C. Lamb
,
Dov M. Gabbay
Theoretical Computer Science
371
(1-2), 2007, pp. 34-53
A uniform solution to SAT using membrane creation
Miguel A. Gutiérrez-Naranjo
,
Mario J. Pérez-Jiménez
,
Francisco J. Romero-Campero
Theoretical Computer Science
371
(1-2), 2007, pp. 54-61
Influence of data dimensionality on the quality of forecasts given by a multilayer perceptron
Krzysztof Michalak
,
Halina Kwaśnicka
Theoretical Computer Science
371
(1-2), 2007, pp. 62-71
Accepting networks of splicing processors: Complexity results
Florin Manea
,
Carlos Martín-Vide
,
Victor Mitrana
Theoretical Computer Science
371
(1-2), 2007, pp. 72-82
Universality results for
P
systems based on brane calculi operations
Shankara Narayanan Krishna
Theoretical Computer Science
371
(1-2), 2007, pp. 83-105
A note on discreteness and virtuality in analog computing
Giuseppe Trautteur
,
Guglielmo Tamburrini
Theoretical Computer Science
371
(1-2), 2007, pp. 106-114
Computability of analog networks
John V. Tucker
,
Jeffery I. Zucker
Theoretical Computer Science
371
(1-2), 2007, pp. 115-146
Approximately dominating representatives
Vladlen Koltun
,
Christos H. Papadimitriou
Theoretical Computer Science
371
(3), 2007, pp. 148-154
Conjunctive query evaluation by search-tree revisited
Albert Atserias
Theoretical Computer Science
371
(3), 2007, pp. 155-168
View-based query processing: On the relationship between rewriting, answering and losslessness
Diego Calvanese
,
Giuseppe De Giacomo
,
Maurizio Lenzerini
,
Moshe Y. Vardi
Theoretical Computer Science
371
(3), 2007, pp. 169-182
Well-definedness and semantic type-checking for the nested relational calculus
Jan Van den Bussche
,
Dirk Van Gucht
,
Stijn Vansummeren
Theoretical Computer Science
371
(3), 2007, pp. 183-199
Rewriting queries using views with access patterns under integrity constraints
Alin Deutsch
,
Bertram Ludäscher
,
Alan Nash
Theoretical Computer Science
371
(3), 2007, pp. 200-226
Optimal workload-based weighted wavelet synopses
Yossi Matias
,
Daniel Urieli
Theoretical Computer Science
371
(3), 2007, pp. 227-246
Horn axiomatizations for sequential data
José L. Balcázar
,
Gemma C. Garriga
Theoretical Computer Science
371
(3), 2007, pp. 247-264