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=Inf.~Comput. AND Volume=147
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability and complexity analysis by basic paramodulation
Robert Nieuwenhuis
Information and Computation
147
(1), 1998, pp. 1-21
The expressive power of stratified logic programs with value invention
Luca Cabibbo
Information and Computation
147
(1), 1998, pp. 22-56
Verifiable properties of database transactions
Michael Benedikt
,
Timothy Griffin
,
Leonid Libkin
Information and Computation
147
(1), 1998, pp. 57-88
Noise-tolerant parallel learning of geometric concepts
Nader H. Bshouty
,
Sally A. Goldman
,
H. David Mathias
Information and Computation
147
(1), 1998, pp. 89-110
The generating power of total deterministic tree transducers
Sebastian Maneth
Information and Computation
147
(2), 1998, pp. 111-144
Positive versions of polynomial time
C. Lautemann
,
T. Schwentick
,
I.A. Stewart
Information and Computation
147
(2), 1998, pp. 145-170
On the modelling of search in theorem proving-Towards a theory of strategy analysis
Maria Paola Bonacina
,
Jieh Hsiang
Information and Computation
147
(2), 1998, pp. 171-208
The combinatorics of effective resistances and resistive inverses
Stephen Ponzio
Information and Computation
147
(2), 1998, pp. 209-223