Project Topics

General instructions

Topics

A - Google's PageRank

1. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Stanford Digital Libraries Working Paper, 1998.

Link

2. Langville, Amy N.; Meyer, Carl D. (2003). "Survey: Deeper Inside PageRank". Internet Mathematics 1 (3).

Link

3. Farahat, Ayman; LoFaro, Thomas; Miller, Joel C.; Rae, Gregory and Ward, Lesley A. (2006). "Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization". SIAM Journal on Scientific Computing 27 (4): 1181-1201.

Link

4. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, Gene H. Golub, Extrapolation Methods for Accelerating PageRank Computations. Proceedings of the Twelfth International World Wide Web Conference, May, 2003.

Link

5. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, Gene H. Golub, Exploiting the Block Structure of the Web for Computing PageRank. Stanford University Technical Report. June, 2003.

Link

6. Taher H. Haveliwala and Sepandar D. Kamvar, The Second Eigenvalue of the Google Matrix. Stanford University Technical Report. June, 2003.

Link

7. Sepandar Kamvar, Taher Haveliwala, Gene Golub, Adaptive Methods for the Computation of PageRank. Linear Algebra and its Applications, Special Issue on the Numerical Solution of Markov Chains. November, 2003.

Link

8. Taher Haveliwala, Sepandar Kamvar and Glen Jeh, An Analytical Comparison of Approaches to Personalizing PageRank. Stanford University Technical Report. June, 2003.

Link


B - Digital Fountains And Core Finding Algorithms

1. M. Mitzenmacher 

Digital Fountains: A Survey and Look Forward. 

2004 Information Theory Workshop. 

Link

2. J. Byers, M. Luby, and M. Mitzenmacher 

A Digital Fountain Approach to the Reliable Distribution of Bulk Data 

IEEE Journal on Selected Areas in Communications, 20:8, pp. 1528-1540, October 2002. 

Link

3. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman 

Efficient Erasure Correcting Codes 

IEEE Transactions on Information Theory, 47(2), pp 569-584, 2001.

Link

4. Differential equation approximations for Markov chains. R. W. R. Darling, J. R. Norris. IMS-PS-PS_2007_121. Probability Surveys 2008, Vol. 5, 37-79.

Link

5. Structure of large random hypergraphs. R. W. R. Darling, J. R. Norris. IMS-AAP-AAP043. Annals of Applied Probability 2005, Vol. 15, No. 1A, 125-152.

Link

6. A Digital Fountain Approach to Reliable Distribution of Bulk Data

John Byers, Michael Luby, Michael Mitzenmacher, Ashu Rege 

appears in proceedings of ACM SIGCOMM '98, September 2-4, 1998. 

Link

7. M. Luby, “LT codes,” in Proc. of the 43rd Annual IEEE Symposium on FOCS, Nov 2002, pp. 271–280.

Link

8. E. Maneva, A. Shokrollahi.

New model for rigorous analysis of LT codes

IEEE International Symposium on Information Theory (ISIT), pages 2677-2679, 2006.

Link


C - Call Centre Management And Load Balancing

1. Randomized Load Balancing with General Service Time Distributions 

M. Bramson, Y. Lu, B. Prabhakar

ACM Sigmetrics 2010.

Link

2. Telephone call centers: Tutorial, review, and research prospects, Noah Gans, Ger Koole and Avishai Mandelbaum, Manufacturing and Service Operations Management 5:79-141, 2003

Link

3. Queueing models of call centers: An introduction, Ger Koole and Avishai Mandelbaum, Annals of Operations Research 113:41-59, 2002.

Link

4. Cell Centre Mathematics, Ger Koole, 2007

Link

5. M. Mitzenmacher, A. Richa, and R. Sitaraman 

The Power of Two Random Choices: A Survey of Techniques and Results 

Book chapter, in Handbook of Randomized Computing: volume 1, edited by P. Pardalos, S. Rajasekaran, and J. Rolim, pp. 255-312, 2001.

Link


D - Sponsored Search Markets

1. Ben Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242–259, March 2007.

Link

2. Paat Rusmevichientong and David P. Williamson. An adaptive algorithm for selecting profitable keywords for search-based advertising services. In Proc. 7th ACM Conference on Electronic Commerce, pages 260–269, 2006.

Link

3. Hal Varian. Position auctions. International Journal of Industrial Organization,

25:1163–1178, 2007.

Link

4. Algorithmic Methods for Sponsored Search Advertising. J. Feldman and S. Muthukrishnan.  Chapter in Book: Performance Modeling and Engineering.

Link

5. “Ad Exchanges: Research Issues”, S. N. Muthukrishnan, Wine 2009: Proceedings of the 5th International Workkshop on Internet and Network Economics, pp. 1-12.

Link

6. “General Auction Mechanism for Search Advertising”, Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál, WWW 2009.

Link


E - Energy Efficient Information Technology

1. Speed scaling for processor sharing systems: Optimality and robustness

Lachlan L. H. Andrew, Adam Wierman and Ao Tang

Under submission.

Link

2. Greening geographical load balancing

Zhenhua Liu, Minghong Lin, Adam Wierman, Steven Low and Lachlan L. H. Andrew

Proceedings of ACM Sigmetrics, 2011.

Link

3. Dynamic right-sizing for power-proportional data centers

Minghong Lin, Adam Wierman, Lachlan L. H. Andrew and Eno Thereska

Proceedings of Infocom, 2011.

Link

4. Optimality, fairness, and robustness in speed scaling designs

Lachlan L. H. Andrew, Minghong Lin and Adam Wierman

Proceedings of ACM Sigmetrics, 2010.

Link

5. Optimal speed scaling under arbitrary power functions

Lachlan L. H. Andrew, Adam Wierman and Ao Tang

Performance Evaluation Review, 2009.

Link

6. Power-aware speed scaling in processor sharing systems

Adam Wierman, Lachlan L. H. Andrew and Ao Tang

Proceedings of Infocom, 2009.

Link


F - Cascading Behavior and Epidemics in Networks

1. Stephen Morris. Contagion. Review of Economic Studies, 67:57–78, 2000.

Link

2. Nicole Immorlica, Jon Kleinberg, Mohammad Mahdian, and Tom Wexler. The role of compatibility in the diffusion of technologies through social networks. In Proc. 8th ACM Conference on Electronic Commerce, 2007.

Link

3. Larry Blume. The statistical mechanics of strategic interaction. Games and Economic Behavior, 5:387–424, 1993.

Link

4. Duncan J. Watts. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA, 99(9):5766–5771, April 2002.

Link

5. A model for infection on graphs, M.Draief, A. Ganesh, 2008.

Link

6. Matt J. Keeling and Ken T. D. Eames. Network and epidemic models. J. Royal Soc. Interface, 2:295-307, 2005.

Link

7. The Effect of Network Topology on the Spread of Epidemics, A. Ganesh , L. Massoulié , D. Towsley, IEEE Infocom 2005.

Link

8. Diffusion of Behavior and Equilibrium Properties in Network Games, Matthew O. Jackson, Leeat Yariv

Link