{"id":664,"date":"2013-07-18T08:44:05","date_gmt":"2013-07-18T12:44:05","guid":{"rendered":"http:\/\/www.podc.org\/?page_id=664"},"modified":"2021-10-29T09:37:19","modified_gmt":"2021-10-29T14:37:19","slug":"2013-podc-social-network-workshop-program","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2013\/2013-podc-social-network-workshop-program\/","title":{"rendered":"PODC Social Network Workshop"},"content":{"rendered":"<h2 style=\"text-align: center\">Program<\/h2>\n<p>&nbsp;<\/p>\n<table border=\"0\" cellspacing=\"5\" cellpadding=\"5\">\n<tbody>\n<tr>\n<td align=\"center\">9:25 &#8211; 9:30<\/td>\n<td colspan=\"2\" align=\"center\"><em><strong>Welcome<\/strong><\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">9:30 &#8211; 10:00<\/td>\n<td><strong> Silvio Lattanzi <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#silvio\">Local Algorithms and Large Scale Graph Clustering<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">10:00 &#8211; 10:30<\/td>\n<td><strong> Keren Censor-Hillel <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#keren\">A New Perspective on Vertex Connectivity<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">10:30 &#8211; 11:00<\/td>\n<td><strong> Philipp Woelfel <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#philipp\">Small World Navigability &#8211; Limits of Efficiency<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">11:00 &#8211; 11:30<\/td>\n<td colspan=\"2\" align=\"center\"><strong> Coffee break <\/strong><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">11:30 &#8211; 12:00<\/td>\n<td><strong> George Giakkoupis <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#george\">Tight bounds for rumor spreading with graph expansion<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">12:00 &#8211; 12:30<\/td>\n<td><strong> Sharad Goel <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#sharad\">&#8220;Going Viral&#8221; and the Structure of Online Diffusion<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">12:30 &#8211; 1:00<\/td>\n<td><strong> Gopal Pandurangan <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#gopal\">Network Discovery via Gossip: Analyzing Dynamically Evolving Distributed and Social Networks<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">1:00 &#8211; 2:30<\/td>\n<td colspan=\"2\" align=\"center\"><strong>Lunch<\/strong><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">2:30 &#8211; 3:00<\/td>\n<td><strong> Anirban Dasgupta <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#anirban\">Aggregating information from a crowd<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">3:00 &#8211; 3:30<\/td>\n<td><strong> Vahab Mirrokni <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#vahab\">Large-scale graph (overlapping) clustering in MapReduce and Beyond<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">3:30 &#8211; 4:00<\/td>\n<td><strong> Ravi Kumar <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#ravi\">TBA<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">4:00 &#8211; 4:30<\/td>\n<td colspan=\"2\" align=\"center\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">4:30 &#8211; 5:00<\/td>\n<td><strong> Sandeep Pandey <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#sandeep\">TBA<\/a> <\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td align=\"center\">5:00 &#8211; 5:30<\/td>\n<td><strong> Bo Pang <\/strong><\/td>\n<td><em> <a href=\"\/podc2013\/?p=601#bo\">TBA<\/a> <\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>Program <\/p>\n<p>&nbsp;<\/p>\n<p> 9:25 &#8211; 9:30 Welcome 9:30 &#8211; 10:00 Silvio Lattanzi Local Algorithms and Large Scale Graph Clustering 10:00 &#8211; 10:30 Keren Censor-Hillel A New Perspective on Vertex Connectivity 10:30 &#8211; 11:00 Philipp Woelfel Small World Navigability &#8211; Limits of Efficiency 11:00 &#8211; 11:30 Coffee break 11:30 &#8211; 12:00 George Giakkoupis Tight bounds for rumor [&#8230;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":3,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-664","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/664","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/comments?post=664"}],"version-history":[{"count":2,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/664\/revisions"}],"predecessor-version":[{"id":1321,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/664\/revisions\/1321"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/media?parent=664"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}