A new strategy for querying priced information.

Cicalese F, Laber ES (2005)
In: Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). 674-683.

Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

Cicalese F, Laber ES. A new strategy for querying priced information. In: Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). 2005: 674-683.
Cicalese, F., & Laber, E. S. (2005). A new strategy for querying priced information. Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 674-683.
Cicalese, F., and Laber, E. S. (2005). “A new strategy for querying priced information.” in Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005) 674-683.
Cicalese, F., & Laber, E.S., 2005. A new strategy for querying priced information. In Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). pp. 674-683.
F. Cicalese and E.S. Laber, “A new strategy for querying priced information.”, Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 2005, pp.674-683.
Cicalese, F., Laber, E.S.: A new strategy for querying priced information. Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). p. 674-683. (2005).
Cicalese, F., and Laber, E. S. “A new strategy for querying priced information.”. Proc. 37th Annual ACM Symposium on Theory of Computing (STOC 2005). 2005. 674-683.
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