Result 1 to 20 of 36 total
Constant price of anarchy in network-creation games via public-service advertising. (English)
Internet Math. 8, No. 1-2, 29-45 (2012).
1
On the construction of prefix-free and fix-free codes with specified codeword compositions. (English)
Discrete Appl. Math. 159, No. 18, 2269-2275 (2011).
2
Online stochastic weighted matching: Improved approximation algorithms. (English)
Chen, Ning (ed.) et al., Internet and network economics. 7th international workshop, WINE 2011, Singapore, December 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25509-0/pbk). Lecture Notes in Computer Science 7090, 170-181 (2011).
3
$O(1)$-approximations for maximum movement problems. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 62-74 (2011).
4
Permutation betting markets: singleton betting with extra information. (English)
Algorithmica 60, No. 4, 853-876 (2011).
5
A cooperative approach to collusion in auctions (English)
SIGecom Exchanges 10, No. 1, 17-22 (2011).
6
Online stochastic weighted matching: improved approximation algorithms (English)
WINE, 170-181 (2011).
7
Optimal-time adaptive strong renaming, with applications to counting (English)
PODC, 239-248 (2011).
8
$O(1)$-approximations for maximum movement problems (English)
APPROX-RANDOM, 62-74 (2011).
9
Constant price of anarchy in network creation games via public service advertising. (English)
Kumar, Ravi (ed.) et al., Algorithms and models for the web graph. 7th international workshop, WAW 2010, Stanford, CA, USA, December 16, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-18008-8/pbk). Lecture Notes in Computer Science 6516, 122-131 (2010).
10
Collusion in VCG path procurement auctions. (English)
Saberi, Amin (ed.), Internet and network economics. 6th international workshop, WINE 2010, Stanford, CA, USA, December 13‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17571-8/pbk). Lecture Notes in Computer Science 6484, 38-49 (2010).
11
Submodular secretary problem and extensions. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 39-52 (2010).
12
How efficient can gossip be? (On the cost of resilient information exchange). (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 115-126 (2010).
13
On the carter-gill conjecture. (English)
Comput. Res. Repos. 2010, Article No. 1002.0097 (2010).
14
Minimizing the diameter of a network using shortcut edges. (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 420-431 (2010).
15
Collusion in VCG path procurement auctions (English)
WINE, 38-49 (2010).
16
How efficient can gossip be? (On the cost of resilient information exchange) (English)
ICALP (2), 115-126 (2010).
17
Minimizing the diameter of a network using shortcut edges (English)
SWAT, 420-431 (2010).
18
Collaborative scoring with dishonest participants (English)
SPAA, 41-49 (2010).
19
Scheduling to minimize power consumption using submodular functions (English)
SPAA, 21-29 (2010).
20
Result 1 to 20 of 36 total
Start
Contact
Print
General Help
