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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Incremental and decremental evaluation of transitive closure by first-order queries
Guozhu Dong
,
Jianwen Su
Information and Computation
120
(1), 1995, pp. 101-106
Kripke logical relations and PCF
Peter W. O'Hearn
,
Jon G. Riecke
Information and Computation
120
(1), 1995, pp. 107-116
Automata on infinite trees with counting constraints
Danièle Beauquier
,
Damian Niwiński
Information and Computation
120
(1), 1995, pp. 117-125
Algorithms for detecting morphic images of a word
Jean Neraud
Information and Computation
120
(1), 1995, pp. 126-148
The bounds of Skolem functions and their applications
Shih Ping Tung
Information and Computation
120
(1), 1995, pp. 149-154
Characterizations of monotonic and dual monotonic language learning
Thomas Zeugmann
,
Steffen Lange
,
Shyam Kapur
Information and Computation
120
(2), 1995, pp. 155-173
Algebraic theories for name-passing calculi
Joachim Parrow
,
Davide Sangiorgi
Information and Computation
120
(2), 1995, pp. 174-197
Complexity classes of optimization functions
Heribert Vollmer
,
Klaus W. Wagner
Information and Computation
120
(2), 1995, pp. 198-219
The expressive power of complex values in object-based data models
Jan Van den Bussche
,
Jan Paredaens
Information and Computation
120
(2), 1995, pp. 220-236
On parallel computations with banded matrices
Victor Y. Pan
,
Isdor Sobze
,
Antoine Atinkpahoun
Information and Computation
120
(2), 1995, pp. 237-250
Negation as instantiation
Alessandra di Pierro
,
Maurizio Martelli
,
Catuscia Palamidessi
Information and Computation
120
(2), 1995, pp. 263-278
Testing equivalence for mobile processes
Michele Boreale
,
Rocco de Nicola
Information and Computation
120
(2), 1995, pp. 279-303
Approximable sets
Richard Beigel
,
Martin Kummer
,
Frank Stephan
Information and Computation
120
(2), 1995, pp. 304-314
Computational complexity of arithmetical sentences
Shih Ping Tung
Information and Computation
120
(2), 1995, pp. 315-325
Lower bounds on universal traversal sequences based on chains of length five
Jonathan Buss
,
Martin Tompa
Information and Computation
120
(2), 1995, pp. 326-329
Nonlinearity and propagation characteristics of balanced boolean functions
Jennifer Seberry
,
Xian-Mo Zhang
,
Yuliang Zheng
Information and Computation
119
(1), 1995, pp. 1-13
Inhabitation of types in the simply typed lambda calculus
Wil Dekkers
Information and Computation
119
(1), 1995, pp. 14-17
Transfinite reductions in orthogonal term rewriting systems
Richard Kennaway
,
Jan Willem Klop
,
Ronan Sleep
,
Fer-Jan de Vries
Information and Computation
119
(1), 1995, pp. 18-38
A loss bound model for on-line stochastic prediction algorithms
Kenji Yamanishi
Information and Computation
119
(1), 1995, pp. 39-54
A variable typed logic of effects
Furio Honsell
,
Ian A. Mason
,
Scott Smith
,
Carolyn Talcott
Information and Computation
119
(1), 1995, pp. 55-90
A logical study of distributed transition systems
Kamal Lodaya
,
Rohit Parikh
,
R. Ramanujam
,
P.S. Thiagarajan
Information and Computation
119
(1), 1995, pp. 91-118
Homomorphism preserving algebraic specifications require hidden sorts
J.A. Bergstra
,
J. Heering
Information and Computation
119
(1), 1995, pp. 119-123
A lower bound for the emulation of PRAM memories on processor networks
Torben Hagerup
Information and Computation
119
(1), 1995, pp. 124-128
On the power of deterministic transitive closures
Erich Grädel
,
Gregory L. McColm
Information and Computation
119
(1), 1995, pp. 129-135
Redundancy elimination and loop checks for logic programs
F. Ferrucci
,
G. Pacini
,
M.I. Sessa
Information and Computation
119
(2), 1995, pp. 137-153
Seiten
<
1
2
3
4
>