Information and Computation
, Volume 192
Volume 192, Number 1, 1 July 2004
Pavol Duris
:
Multiparty communication complexity and very hard functions.
1-14
John Case
,
Efim B. Kinber
,
Arun Sharma
,
Frank Stephan
:
On the classification of recursive languages.
15-40
Christian Cachin
:
An information-theoretic model for steganography.
41-56
Pierre B. A. Lecomte
,
Michel Rigo
:
Real numbers having ultimately periodic representations in abstract numeration systems.
57-83
Marc Denecker
,
Victor W. Marek
,
Miroslaw Truszczynski
:
Ultimate approximation and its application in nonmonotonic knowledge representation systems.
84-121
Volume 192, Number 2, 1 August 2004
John A. Ellis
,
Minko Markov
:
Computing the vertex separation of unicyclic graphs.
123-161
Richard Cleve
:
The query complexity of order-finding.
162-171
Mark-Jan Nederhof
,
Giorgio Satta
:
The language intersection problem for non-recursive context-free grammars.
172-184
Sanjay Jain
,
Efim B. Kinber
,
Rolf Wiehagen
:
Learning all subfunctions of a function.
185-215
Copyright ©
Sat Nov 28 22:29:17 2009 by
Michael Ley
(
ley@uni-trier.de
)