[Nrg-l] FW: TALK:Thursday 5-18-06 Algorithmic Performance in Complex Networks

Mark Crovella crovella at cs.bu.edu
Mon May 15 15:14:12 EDT 2006


-----Original Message-----
From: seminars-bounces at lists.csail.mit.edu
[mailto:seminars-bounces at lists.csail.mit.edu] On Behalf Of CSAIL Event
Sent: Monday, May 15, 2006 2:47 PM
To: seminars at csail.mit.edu
Subject: TALK:Thursday 5-18-06 Algorithmic Performance in Complex

Algorithmic Performance in Complex Networks Algorithms and Complexity
Spring 2006
Speaker: Milena Mihail
Speaker Affiliation: Georgia Tech.
Host: Madhu Sudan
Host Affiliation: MIT CSAIL

Date: 5-18-2006
Time: 4:00 PM - 5:15 PM
Location: 32-G575

Complex networks, like the Internet, the WWW and peer-to-peer networks,
are all-pervasive and are growing at an unprecedented rate. It is
therefore of fundamental importance to study the scaling behavior of
algorithms that run on these networks, as well as develop design
principles that support efficient algorithms for these networks. In this
talk we will study algorithmic issues such as routing on the Internet,
searching and crawling on the WWW, and the design of peer-to-peer

Unlike previous approaches to these issues which involved degree
distributions, the small world phenomenon etc., our main technique
relies on finding ways of determining and enforcing coductance of the
topologies underlying the graphs of these networks.

Relevant URL(S):
For more information please contact: Joanne Hanley, 617.253.6054,
joanne at csail.mit.edu

Seminars mailing list
Seminars at lists.csail.mit.edu

More information about the Nrg-l mailing list