|
 | Up a level |
Alpern, Steven (2011) Find-and-fetch search on a tree. Operations Research, 59 (5). pp. 1258-1268. ISSN 0030-364X
Alpern, Steven (2011) A new approach to Gal’s theory of search games on weakly eulerian networks. Dynamic Games and Applications, 1 (2). pp. 209-219. ISSN 2153-0785
Alpern, Steven, Fokkink, Robbert, Timmer, Marco and Casas, Jerome (2011) Ambush frequency should increase over time during optimal predator search for prey. Journal of the Royal Society Interface, 8 (64). pp. 1665-1672. ISSN 1742-5689
Dütting, Paul, Henzinger, Monika and Weber, Ingmar (2011) Offline file assignments for online load balancing. Information Processing Letters, 111 (4). pp. 178-183. ISSN 0020-0190
Pokrovskiy, Alexey (2011) Partitioning 3-coloured complete graphs into three monochromatic paths. Electronic Notes in Discrete Mathematics, 38. pp. 717-722. ISSN 1571-0653
Xu, Zibo (2011) A stochastic Ramsey theorem. Journal of Combinatorial Theory, Series A, 118 (4). pp. 1392-1409. ISSN 0097-3165
Dütting, Paul, Fischer, Felix and Parkes, David C. (2011) Simplicity-expressiveness tradeoffs in mechanism design. In: Shoham, Yoav, Chen, Yan and Roughgarden, Tim, (eds.) Proceedings of the 13th ACM Conference on Electronic Commerce. Association for Computing Machinery, New York, NY, pp. 341-350. ISBN 9781450302616
Dütting, Paul, Henzinger, Monika and Weber, Ingmar (2011) An expressive mechanism for auctions on the web. In: Srinivasan, Sadagopan, Ramamritham, Krithi, Kumar, Arun, Ravindra, M.P, Bertino, Elisa and Kumarq, Ravi, (eds.) Proceedings of the 20th International Conference on World Wide Web. Association for Computing Machinery, New York, NY, pp. 127-136. ISBN 9781450306324
