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 YEAR=1998
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
Perfectly secure key distribution for dynamic conferences
Carlo Blundo
,
Alfredo de Santis
,
Amir Herzberg
,
Shay Kutten
,
Ugo Vaccaro
,
Moti Yung
Information and Computation
146
(1), 1998, pp. 1-23
A conservative look at operational semantics with variable binding
Wan Fokkink
,
Chris Verhoef
Information and Computation
146
(1), 1998, pp. 24-54
Threshold circuits of small majority-depth
Alexis Maciel
,
Denis Thérien
Information and Computation
146
(1), 1998, pp. 55-83
Dynamic dictionary matching in external memory
Paolo Ferragina
,
Fabrizio Luccio
Information and Computation
146
(2), 1998, pp. 85-99
Usage counting analysis for lazy functional languages
G.W. Hamilton
Information and Computation
146
(2), 1998, pp. 100-137
A fully abstract semantics for concurrent constraint programming
Sven-Olof Nyström
,
Bengt Jonsson
Information and Computation
146
(2), 1998, pp. 138-180
Decidability of the finiteness of ranges of tree transductions
Frank Drewes
,
Joost Engelfriet
Information and Computation
145
(1), 1998, pp. 1-50
On number systems with finite degree of ambiguity
Juha Honkala
Information and Computation
145
(1), 1998, pp. 51-63
Full abstractness for a functional/concurrent language with higher-order value-passing
Chrysafis Hartonas
,
Matthew Hennessy
Information and Computation
145
(1), 1998, pp. 64-106
Structural induction and coinduction in a fibrational setting
Claudio Hermida
,
Bart Jacobs
Information and Computation
145
(2), 1998, pp. 107-152
Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
Roberto Giacobazzi
,
Francesco Ranzato
Information and Computation
145
(2), 1998, pp. 153-190
On performance congruences for process algebras
Flavio Corradini
Information and Computation
145
(2), 1998, pp. 191-230
Optimal parallel two dimensional text searching on a CREW PRAM
Amihood Amir
,
Gary Benson
,
Martin Farach-Colton
Information and Computation
144
(1), 1998, pp. 1-17
Self-stabilizing ring orientation using constant space
Jaap-Henk Hoepman
Information and Computation
144
(1), 1998, pp. 18-39
An extension of fixpoint logic with a symmetry-based choice construct
F. Gire
,
H.K. Hoang
Information and Computation
144
(1), 1998, pp. 40-65
Optimal mistake bound learning is hard
Moti Frances
,
Ami Litman
Information and Computation
144
(1), 1998, pp. 66-82
A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
Marco Bernardo
,
Lorenzo Donatiello
,
Roberto Gorrieri
Information and Computation
144
(2), 1998, pp. 83-154
Seiten 1
2
3
>