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=140
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity and categoricity
Douglas Cenzer
,
Jeffrey B. Remmel
Information and Computation
140
(1), 1998, pp. 2-25
Metafinite model theory
Erich Grädel
,
Yuri Gurevich
Information and Computation
140
(1), 1998, pp. 26-81
Some consequences of cryptographical conjectures for
S_2^1
and EF
Jan Krajíc̑ek
,
Pavel Pudlák
Information and Computation
140
(1), 1998, pp. 82-94
Proving properties of dynamic process networks
Mads Dam
Information and Computation
140
(2), 1998, pp. 95-114
Common knowledge and update in finite environments
Ron van der Meyden
Information and Computation
140
(2), 1998, pp. 115-157
A collusion problem and its solution
Steven H. Low
,
Nicholas F. Maxemchuk
Information and Computation
140
(2), 1998, pp. 158-182
On chromatic sums and distributed resource allocation
Amotz Bar-Noy
,
Mihir Bellare
,
Magnús Halldórsson
,
Hadas Shachnai
,
Tami Tamir
Information and Computation
140
(2), 1998, pp. 183-202
Conjunctions of unate DNF formulas: Learning and structure
Aaron Feigelson
,
Lisa Hellerstein
Information and Computation
140
(2), 1998, pp. 203-228
One-unambiguous regular languages
Anne Brüggemann-Klein
,
Derick Wood
Information and Computation
140
(2), 1998, pp. 229-253
Error-free and best-fit extensions of partially defined boolean functions
Endre Boros
,
Toshihide Ibaraki
,
Kazuhisa Makino
Information and Computation
140
(2), 1998, pp. 254-283