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=166
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On fairness notions in distributed systems: I. A characterization of implementability
Yuh-Jzer Joung
Information and Computation
166
(1), 2001, pp. 1-34
On fairness notions in distributed systems: II. Equivalence-completions and their hierarchies
Yuh-Jzer Joung
Information and Computation
166
(1), 2001, pp. 35-60
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Stephan Waack
Information and Computation
166
(1), 2001, pp. 61-70
Commutative queries
Richard Beigel
,
Richard Chang
Information and Computation
166
(1), 2001, pp. 71-91
Star-free sets of words on ordinals
Nicolas Bedon
Information and Computation
166
(2), 2001, pp. 93-111
Languages defined with modular counting quantifiers
Howard Straubing
Information and Computation
166
(2), 2001, pp. 112-132
Improved lower bounds for learning from noisy examples: An information-theoretic approach
Claudio Gentile
,
David P. Helmbold
Information and Computation
166
(2), 2001, pp. 133-155
On a generalized notion of mistake bounds
Sanjay Jain
,
Arun Sharma
Information and Computation
166
(2), 2001, pp. 156-166