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=192
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiparty communication complexity and very hard functions
Pavol D̑uris̑
Information and Computation
192
(1), 2004, pp. 1-14
On the classification of recursive languages
John Case
,
Efim Kinber
,
Arun Sharma
,
Frank Stephan
Information and Computation
192
(1), 2004, pp. 15-40
An information-theoretic model for steganography
Christian Cachin
Information and Computation
192
(1), 2004, pp. 41-56
Real numbers having ultimately periodic representations in abstract numeration systems
P. Lecomte
,
M. Rigo
Information and Computation
192
(1), 2004, pp. 57-83
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Marc Denecker
,
Victor W. Marek
,
Mirosƚaw Truszczyński
Information and Computation
192
(1), 2004, pp. 84-121
Computing the vertex separation of unicyclic graphs
John Ellis
,
Minko Markov
Information and Computation
192
(2), 2004, pp. 123-161
The query complexity of order-finding
Richard Cleve
Information and Computation
192
(2), 2004, pp. 162-171
The language intersection problem for non-recursive context-free grammars
Mark-Jan Nederhof
,
Giorgio Satta
Information and Computation
192
(2), 2004, pp. 172-184
Learning all subfunctions of a function
Sanjay Jain
,
Efim Kinber
,
Rolf Wiehagen
Information and Computation
192
(2), 2004, pp. 185-215