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=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Automatic proofs by induction in theories without constructors
Jean-Pierre Jouannaud
,
Emmanuel Kounalis
Information and Computation
82
(1), 1989, July, pp. 1-33
Enumerative counting is hard
Jin-Yi Cai
,
Lane A. Hemachandra
Information and Computation
82
(1), 1989, July, pp. 34-44
Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
Dan E. Willard
Information and Computation
82
(1), 1989, July, pp. 45-64
Recursive domain equations for concrete data structures
Manfred Droste
Information and Computation
82
(1), 1989, July, pp. 65-80
A proof of the Kahn principle for input/output automata
Nancy A. Lynch
,
Eugene W. Stark
Information and Computation
82
(1), 1989, July, pp. 81-92
Approximative counting, uniform generation and rapidly mixing Markov chains
Alistair Sinclair
,
Mark Jerrum
Information and Computation
82
(1), 1989, July, pp. 93-133
Membership problems for regular and context-free trace languages
A. Bertoni
,
G. Mauri
,
N. Sabadini
Information and Computation
82
(2), 1989, August, pp. 135-150
Incorporating static analysis in a combinator-based compiler
Margaret Montenyohl
,
Mitchell Wand
Information and Computation
82
(2), 1989, August, pp. 151-184
Proving properties of interactive proofs by a generalized counting technique
László Babai
,
Shlomo Moran
Information and Computation
82
(2), 1989, August, pp. 185-197
An algebraic characterization of transition system equivalences
André Arnold
,
Anne Dicky
Information and Computation
82
(2), 1989, August, pp. 198-230
Learning decision trees from random examples
Andrzej Ehrenfeucht
,
David Haussler
Information and Computation
82
(3), 1989, September, pp. 231-246
A general lower bound on the number of examples needed for learning
Andrzej Ehrenfeucht
,
David Haussler
,
Michael Kearns
,
Leslie Valiant
Information and Computation
82
(3), 1989, September, pp. 247-261
Parallel approximation algorithms for bin packing
Richard J. Anderson
,
Ernst W. Mayr
,
Manfred K. Warmuth
Information and Computation
82
(3), 1989, September, pp. 262-277
The
\mu
-calculus as an assertion-language for fairness arguments
F.A. Stomp
,
W.P. de Roever
,
R.T. Gerth
Information and Computation
82
(3), 1989, September, pp. 278-322
Trade-off among parameters affecting inductive inference
Rūsiņs̆ Freivalds
,
Carl H. Smith
,
Mahendran Velauthapillai
Information and Computation
82
(3), 1989, September, pp. 323-349