Ebook on Nam Le

List of Selected Papers on Algorithms for Large-Scale Graph Processing.

Sat, 19 Aug 2023 00:00:00 +0000

1/ [ISAAC'11] Goodrich, M. T., Sitchinava, N., & Zhang, Q. (2011, December). Sorting, searching, and simulation in the mapreduce framework. In International Symposium on Algorithms and Computation (pp. 374-383). Springer, Berlin, Heidelberg.

1
2
3
4
5
6
7
8


@inproceedings{goodrich2011sorting,
 title={Sorting, searching, and simulation in the mapreduce framework},
 author={Goodrich, Michael T and Sitchinava, Nodari and Zhang, Qin},
 booktitle={International Symposium on Algorithms and Computation},
 pages={374--383},
 year={2011},
 organization={Springer}
}

2/ [STOC'14] Andoni, A., Nikolov, A., Onak, K., & Yaroslavtsev, G. (2014, May). Parallel algorithms for geometric graph problems. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing (pp. 574-583).

1
2
3
4
5
6
7


@inproceedings{andoni2014parallel,
 title={Parallel algorithms for geometric graph problems},
 author={Andoni, Alexandr and Nikolov, Aleksandar and Onak, Krzysztof and Yaroslavtsev, Grigory},
 booktitle={Proceedings of the forty-sixth annual ACM symposium on Theory of computing},
 pages={574--583},
 year={2014}
}

3/ [STOC'17] Im, S., Moseley, B., & Sun, X. (2017, June). Efficient massively parallel methods for dynamic programming. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (pp. 798-811).

1
2
3
4
5
6
7


@inproceedings{im2017efficient,
 title={Efficient massively parallel methods for dynamic programming},
 author={Im, Sungjin and Moseley, Benjamin and Sun, Xiaorui},
 booktitle={Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing},
 pages={798--811},
 year={2017}
}

4/ [FOCS'18] Andoni, A., Song, Z., Stein, C., Wang, Z., & Zhong, P. (2018, October). Parallel graph connectivity in log diameter rounds. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 674-685). IEEE.

1
2
3
4
5
6
7
8


@inproceedings{andoni2018parallel,
 title={Parallel graph connectivity in log diameter rounds},
 author={Andoni, Alexandr and Song, Zhao and Stein, Clifford and Wang, Zhengyu and Zhong, Peilin},
 booktitle={2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)},
 pages={674--685},
 year={2018},
 organization={IEEE}
}

5/ [SOSA'19] Liu, P., & Vondrák, J. (2018). Submodular optimization in the mapreduce model. arXiv preprint arXiv:1810.01489.

1
2
3
4
5
6


@article{liu2018submodular,
 title={Submodular optimization in the mapreduce model},
 author={Liu, Paul and Vondr{\'a}k, Jan},
 journal={arXiv preprint arXiv:1810.01489},
 year={2018}
}

6/ [PODC'19] Behnezhad, S., Brandt, S., Derakhshan, M., Fischer, M., Hajiaghayi, M., Karp, R. M., & Uitto, J. (2019, July). Massively parallel computation of matching and MIS in sparse graphs. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 481-490).

1
2
3
4
5
6
7


@inproceedings{behnezhad2019massively,
 title={Massively parallel computation of matching and MIS in sparse graphs},
 author={Behnezhad, Soheil and Brandt, Sebastian and Derakhshan, Mahsa and Fischer, Manuela and Hajiaghayi, MohammadTaghi and Karp, Richard M and Uitto, Jara},
 booktitle={Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing},
 pages={481--490},
 year={2019}
}

Brandt, S., Fischer, M., & Uitto, J. (2018). Matching and MIS for uniformly sparse graphs in the low-memory MPC model. arXiv preprint arXiv:1807.05374.

1
2
3
4
5
6


@article{brandt2018matching,
 title={Matching and MIS for uniformly sparse graphs in the low-memory MPC model},
 author={Brandt, Sebastian and Fischer, Manuela and Uitto, Jara},
 journal={arXiv preprint arXiv:1807.05374},
 year={2018}
}

Behnezhad, S., Derakhshan, M., Hajiaghayi, M., & Karp, R. M. (2018). Massively parallel symmetry breaking on sparse graphs: MIS and maximal matching. arXiv preprint arXiv:1807.06701.

1
2
3
4
5
6


@article{behnezhad2018massively,
 title={Massively parallel symmetry breaking on sparse graphs: MIS and maximal matching},
 author={Behnezhad, Soheil and Derakhshan, Mahsa and Hajiaghayi, MohammadTaghi and Karp, Richard M},
 journal={arXiv preprint arXiv:1807.06701},
 year={2018}
}

7/ [PODC'19] Chang, Y. J., Fischer, M., Ghaffari, M., Uitto, J., & Zheng, Y. (2019, July). The complexity of $$(\Delta+ 1)$$ coloring in congested clique, massively parallel computation, and centralized local computation. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 471-480).

1
2
3
4
5
6
7


@inproceedings{chang2019complexity,
 title={The complexity of ($\Delta$+ 1) coloring in congested clique, massively parallel computation, and centralized local computation},
 author={Chang, Yi-Jun and Fischer, Manuela and Ghaffari, Mohsen and Uitto, Jara and Zheng, Yufan},
 booktitle={Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing},
 pages={471--480},
 year={2019}
}

8/ [FOCS'19] Ghaffari, M., Kuhn, F., & Uitto, J. (2019, November). Conditional hardness results for massively parallel computation from distributed lower bounds. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 1650-1663). IEEE.

1
2
3
4
5
6
7
8


@inproceedings{ghaffari2019conditional,
 title={Conditional hardness results for massively parallel computation from distributed lower bounds},
 author={Ghaffari, Mohsen and Kuhn, Fabian and Uitto, Jara},
 booktitle={2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)},
 pages={1650--1663},
 year={2019},
 organization={IEEE}
}

9/ [SODA'20] Ghaffari, M., Nowicki, K., & Thorup, M. (2020). Faster algorithms for edge connectivity via random 2-out contractions. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1260-1279). Society for Industrial and Applied Mathematics.

1
2
3
4
5
6
7
8


@inproceedings{ghaffari2020faster,
 title={Faster algorithms for edge connectivity via random 2-out contractions},
 author={Ghaffari, Mohsen and Nowicki, Krzysztof and Thorup, Mikkel},
 booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
 pages={1260--1279},
 year={2020},
 organization={SIAM}
}

Reading list & mathematics resources.

Sat, 19 Aug 2023 00:00:00 +0000

Foundations of Mathematics #

Number Theory #

Algebra #

1/ Lay, D. C., Lay, S. R., & McDonald, J. (2016). Linear algebra and its applications. Pearson Education.

2/ Strang, G. (2019). Linear algebra and learning from data (Vol. 4). Cambridge: Wellesley-Cambridge Press.

Combinatorics - Graph Theory #

Graph theory books #

[1] Lewis, R. (2015). A guide to graph colouring (Vol. 7). Berlin: Springer.

[2] Tucker, A. (1994). Applied combinatorics. John Wiley & Sons, Inc..

[3] Li, Y., & Lin, Q. (2022). Elementary Methods of Graph Ramsey Theory (Vol. 211). Springer Nature.

[4] David Conlon - Extremal graph theory

[5] Trudeau, R. J. (1994). Introduction to graph theory. Dover Pubns.

[6] Reinhard, D. (2017). Graph Theory. GTM, vol. 173.

[7] Bondy, J. A., & Murty, U. S. R. (1976). Graph theory with applications (Vol. 290). London: Macmillan.

[8] Bollobás, B. (1998). Modern graph theory (Vol. 184). Springer Science & Business Media.

[9] Needham, M., & Hodler, A. E. (2019). Graph algorithms: practical examples in Apache Spark and Neo4j. O’Reilly Media.

[10] Guia, J., Soares, V. G., & Bernardino, J. (2017, April). Graph Databases: Neo4j Analysis. In ICEIS (1) (pp. 351-356).

[11] Harary, Frank - Graph Theory-Perseus Books (1999)

[12] Miklós Bóna - A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory, World Scientific (2016)

[13] Robin J. Wilson - Introduction to Graph Theory, Fourth Edition-Addison Wesley (1996)

[14] (Textbooks in Mathematics) Jonathan L. Gross, Jay Yellen, Mark Anderson - Graph Theory and Its Applications, third edition (2018)

[15] Introduction to Graph Theory, Douglas B. West

Geometry & Topology #

Analysis #

Probability & Statistics #

1/ Gould, R., & Ryan, C. N. (2015). Introductory statistics: Exploring the world through data. Pearson.

2/ Johnson, R. A., & Wichern, D. W. (2002). Applied multivariate statistical analysis.

3/ Härdle, W. K., & Simar, L. (2019). Applied multivariate statistical analysis. Springer Nature.

Numerical Analysis #

Signal processing #

Applied mathematics #

Machine learning #

1/ Deisenroth, M. P., Faisal, A. A., & Ong, C. S. (2020). Mathematics for machine learning. Cambridge University Press.

2/ Bishop, C. M., & Nasrabadi, N. M. (2006). Pattern recognition and machine learning (Vol. 4, No. 4, p. 738). New York: springer.

3/ Koller, D., & Friedman, N. (2009). Probabilistic graphical models: principles and techniques. MIT press.

4/ Barber, D. (2012). Bayesian reasoning and machine learning. Cambridge University Press.

5/ Hastie, T., Tibshirani, R., Friedman, J. H., & Friedman, J. H. (2009). The elements of statistical learning: data mining, inference, and prediction (Vol. 2, pp. 1-758). New York: springer.

6/ Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018). Foundations of machine learning. MIT press.

7/ Williams, C. K., & Rasmussen, C. E. (2006). Gaussian processes for machine learning (Vol. 2, No. 3, p. 4). Cambridge, MA: MIT press.

8/ Vapnik, V. (1999). The nature of statistical learning theory. Springer science & business media.

9/ Shalev-Shwartz, S., & Ben-David, S. (2014). Understanding machine learning: From theory to algorithms. Cambridge university press.

10/ Wainwright, M. J., & Jordan, M. I. (2008). Graphical models, exponential families, and variational inference. Foundations and Trends® in Machine Learning, 1(1–2), 1-305.

Optimization #

1/ Kochenderfer, M. J., & Wheeler, T. A. (2019). Algorithms for optimization. Mit Press.

2/ Kochenderfer, M. J., Wheeler, T. A., & Wray, K. H. (2022). Algorithms for decision making. MIT press.

3/ Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge university press.

4/ Bertsekas, D. (2009). Convex optimization theory (Vol. 1). Athena Scientific.

5/ Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial optimization: algorithms and complexity. Courier Corporation.

6/ Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., & Schrijver, A. (2009). Combinatorial optimization. Oberwolfach Reports, 5(4), 2875-2942.