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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Descriptional and computational complexity of finite automata - A survey
Markus Holzer
,
Martin Kutrib
Information and Computation
209
(3), 2011, pp. 456-470
Relational interpretations of recursive types in an operational setting
Lars Birkedal
,
Robert Harper
Information and Computation
155
(1-2), 1999, pp. 3-63
Type-directed specialization of polymorphism
Atsushi Ohori
Information and Computation
155
(1-2), 1999, pp. 64-107
Comparing object encodings
Kim B. Bruce
,
Luca Cardelli
,
Benjamin C. Pierce
Information and Computation
155
(1-2), 1999, pp. 108-133
Semi-explicit first-class polymorphism for ML
Jacques Garrigue
,
Didier Rémy
Information and Computation
155
(1-2), 1999, pp. 134-169
Toward an infinitary logic of domains: Abramsky logic for transition systems
Marcello M. Bonsangue
,
Joost N. Kok
Information and Computation
155
(1-2), 1999, pp. 170-201
Efficient splitting and merging algorithms for order decomposable problems
Roberto Grossi
,
Giuseppe F. Italiano
Information and Computation
154
(1), 1999, pp. 1-33
Macro tree transducers, attribute grammars, and MSO definable tree translations
Joost Engelfriet
,
Sebastian Maneth
Information and Computation
154
(1), 1999, pp. 34-91
Testing preorders for probabilistic processes
Rance Cleaveland
,
Zeynep Dayar
,
Scott A. Smolka
,
Shoji Yuen
Information and Computation
154
(2), 1999, pp. 93-148
The complexity of universal text-learners
Frank Stephan
,
Sebastiaan A. Terwijn
Information and Computation
154
(2), 1999, pp. 149-166
Hilbert function and complexity lower bounds for symmetric Boolean functions
Anna Bernasconi
,
Lavinia Egidi
Information and Computation
153
(1), 1999, pp. 1-25
On the complexity of learning for spiking neurons with temporal coding
Wolfgang Maass
,
Michael Schmitt
Information and Computation
153
(1), 1999, pp. 26-46
The Kleene-Schützenberger theorem for formal power series in partially commuting variables
Manfred Droste
,
Paul Gastin
Information and Computation
153
(1), 1999, pp. 47-80
Complexity and expressive power of deterministic semantics for DATALOG
\neg
Sergio Greco
,
Domenico Saccà
Information and Computation
153
(1), 1999, pp. 81-98
Finite queries do not have effective syntax
Alexei P. Stolboushkin
,
Michael A. Taitslin
Information and Computation
153
(1), 1999, pp. 99-116
The power of multiobjects
Yehuda Afek
,
Michael Merritt
,
Gadi Taubenfeld
Information and Computation
153
(1), 1999, pp. 117-138
Recursive computational depth
James I. Lathrop
,
Jack H. Lutz
Information and Computation
153
(2), 1999, pp. 139-172
Basic theory of
F
-bounded quantification
Paolo Baldan
,
Giorgio Ghelli
,
Alessandra Raffaetà
Information and Computation
153
(2), 1999, pp. 173-237
Robust behaviorally correct learning
Sanjay Jain
Information and Computation
153
(2), 1999, pp. 238-248
Closures on COPs form complete lattices
Joost Engelfriet
Information and Computation
152
(1), 1999, pp. 1-15
Closures on COPs form complete lattices
Ganesh R. Baliga
,
John Case
,
Sanjay Jain
Information and Computation
152
(1), 1999, pp. 16-43
Closures on COPs form complete lattices
Rudolf Fleischer
Information and Computation
152
(1), 1999, pp. 44-61
Closures on COPs form complete lattices
Alexis Maciel
,
Denis Thérien
Information and Computation
152
(1), 1999, pp. 62-73
Closures on COPs form complete lattices
John Case
,
Sanjay Jain
,
Steffen Lange
,
Thomas Zeugmann
Information and Computation
152
(1), 1999, pp. 74-110
Closures on COPs form complete lattices
Thomas Ehrhard
Information and Computation
152
(1), 1999, pp. 111-137
Seiten 1
2
3
>