Basic Ergodic Theory Notes
The Strength of Indirect Relations in Social Networks
Combinatorial Problems2
Ma295s.10 Lecture
MCA 202: Discrete Mathematics Instructor Neelima Gupta [email protected].
M ATROID S ECRETARY FOR R EGULAR AND D ECOMPOSABLE M ATROIDS Michael Dinitz Guy Kortsarz Weizmann Institute of Science Johns Hopkins University Rutgers.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
[1][1][1][1] Lecture 4: Frequency reuse, channel assignment, and more June 15, 2008 896960 Introduction to Algorithmic Wireless Communications David Amzallag.
Approximation Algorithms Slides by Yitzhak Sapir Based on Lecture Notes from David P. Williamson.
Zoë Abrams, Ashish Goel, Serge Plotkin Stanford University Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks.
On conflict-avoiding codes of weight 3 and odd length Kenneth Shum Oct 2011.
![[1][1][1][1] Lecture 4: Frequency reuse, channel assignment, and more June 15, 2008 896960 Introduction to Algorithmic Wireless Communications David Amzallag.](https://static.fdocuments.us/doc/330x215/56649d385503460f94a120e0/1111-lecture-4-frequency-reuse-channel-assignment-and-more-june.jpg)
