Result 1 to 20 of 217 total
Buffer management for colored packets with deadlines. (English)
Theory Comput. Syst. 49, No. 4, 738-756 (2011).
1
Prompt mechanism for ad placement over time. (English)
Persiano, Giuseppe (ed.), Algorithmic game theory. 4th international symposium, SAGT 2011, Amalfi, Italy, October 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24828-3/pbk). Lecture Notes in Computer Science 6982, 19-30 (2011).
2
Optimal discovery strategies in white space networks. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 713-722 (2011).
3
Submodular Max-SAT. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 323-334 (2011).
4
Maximum bipartite flow in networks with adaptive channel width. (English)
Theor. Comput. Sci. 412, No. 24, 2577-2587 (2011).
5
Submodular Max-SAT (English)
ESA, 323-334 (2011).
6
Optimal discovery strategies in white space networks (English)
ESA, 713-722 (2011).
7
Ranking with submodular valuations (English)
SODA, 1070-1079 (2011).
8
Prompt mechanism for ad placement over time (English)
SAGT, 19-30 (2011).
9
Recommender systems with non-binary grades (English)
SPAA, 245-252 (2011).
10
How to allocate goods in an online market? (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 51-62 (2010).
11
Optimal whitespace synchronization strategies. (English)
Comput. Res. Repos. 2010, Article No. 1006.3334 (2010).
12
A preemptive algorithm for maximizing disjoint paths on trees. (English)
Algorithmica 57, No. 3, 517-537 (2010).
13
Distributed error confinement (English)
ACM Transactions on Algorithms 6, No. 3 (2010).
14
Truthful unsplittable flow for large capacity networks (English)
ACM Transactions on Algorithms 6, No. 2 (2010).
15
How to allocate goods in an online market? (English)
ESA (2), 51-62 (2010).
16
Monotonicity in bargaining networks (English)
SODA, 817-826 (2010).
17
On revenue maximization in second-price ad auctions. (English)
Comput. Res. Repos. 2009, Article No. 0908.2834 (2009).
18
Convergence of local dynamics to balanced outcomes in exchange networks. (English)
Comput. Res. Repos. 2009, Article No. 0907.4356 (2009).
19
The online set cover problem. (English)
SIAM J. Comput. 39, No. 2, 361-370 (2009).
20
Result 1 to 20 of 217 total
Start
Contact
Print
General Help
