An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.

Cicalese F, Laber ES (2005)
In: Proc. 13th Annual European Symposium on Algorithms (ESA 2005). 3669. 664-676.

Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

Cicalese F, Laber ES. An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. In: Proc. 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. 2005: 664-676.
Cicalese, F., & Laber, E. S. (2005). An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. Proc. 13th Annual European Symposium on Algorithms (ESA 2005), 3669, 664-676.
Cicalese, F., and Laber, E. S. (2005). “An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.” in Proc. 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, 664-676.
Cicalese, F., & Laber, E.S., 2005. An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. In Proc. 13th Annual European Symposium on Algorithms (ESA 2005). no.3669 pp. 664-676.
F. Cicalese and E.S. Laber, “An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.”, Proc. 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, 2005, pp.664-676.
Cicalese, F., Laber, E.S.: An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. Proc. 13th Annual European Symposium on Algorithms (ESA 2005). 3669, p. 664-676. (2005).
Cicalese, F., and Laber, E. S. “An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees.”. Proc. 13th Annual European Symposium on Algorithms (ESA 2005). 2005.Vol. 3669. 664-676.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar