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=119
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Loop circuits and their relation to Razborov's approximation model
Katsutoshi Nakayama
,
Akira Maruoka
Information and Computation
119
(2), 1995, pp. 154-159
Infinitary logic and inductive definability over finite structures
Anuj Dawar
,
Steven Lindell
,
Scott Weinstein
Information and Computation
119
(2), 1995, pp. 160-175
Second order isomorphic types: A proof theoretic study on second order
\lambda
-calculus with surjective pairing and terminal object
Roberto di Cosmo
Information and Computation
119
(2), 1995, pp. 176-201
Intersection and union types: Syntax and semantics
Franco Barbanera
,
Mariangiola Dezani-Ciancaglini
,
Ugo de'Liguoro
Information and Computation
119
(2), 1995, pp. 202-230
The complexity of selecting maximal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
Information and Computation
119
(2), 1995, pp. 231-239
New results on the star problem in trace monoids
Yves Métivier
,
Gwénaël Richomme
Information and Computation
119
(2), 1995, pp. 240-251
Universal retractions on
DI
-domains
Xavier Gouy
,
Ying Jiang
Information and Computation
119
(2), 1995, pp. 252-257
Improved dynamic dictionary matching
Amihood Amir
,
Martin Farach
,
Ramana M. Idury
,
Johannes A. la Poutré
,
Alejandro A. Schäffer
Information and Computation
119
(2), 1995, pp. 258-282
Simplifying the design of knowledge-based algorithms using knowledge consistency
Gil Neiger
Information and Computation
119
(2), 1995, pp. 283-293