{"669711":{"#nid":"669711","#data":{"type":"news","title":"Georgia Tech hosts RANDOM-APPROX 2023","body":[{"value":"\u003Cp\u003ERANDOM-APPROX 2023 brought researchers from around the world to Georgia Tech, where they presented papers accepted at the conferences.\u0026nbsp; The conference took place in the Bill Moore Student Success Center.\u0026nbsp; Full details \u003Ca href=\u0022https:\/\/sites.gatech.edu\/randomapprox2023\/\u0022\u003Ehere\u003C\/a\u003E.\u003C\/p\u003E\r\n","summary":"","format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EOn September 11-13, 2023, Georgia Tech hosted two international computer science conferences, RANDOM 2023 on randomized algorithms and random structures, and APPROX 2023 on approximation algorithms.\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"GT hosted two international computer science conferences"}],"uid":"36512","created_gmt":"2023-09-17 01:35:06","changed_gmt":"2023-09-17 01:35:06","author":"wperkins3","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2023-09-16T00:00:00-04:00","iso_date":"2023-09-16T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"669710":{"#nid":"669710","#data":{"type":"news","title":"Georgia Tech hosts TetFest60: Probabilistic Trajectories in Algorithms and Combinatorics","body":[{"value":"\u003Cp\u003EGeorgia Tech hosted a 2-day workshop (September 9-10, 2023) on the rich interplay between randomness, algorithms, and discrete mathematics with a view towards both the history of how these topics came together and flourished and exciting future directions and challenges.\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe occasion of the workshop was a reflection on the remarkable career of Prasad Tetali, currently Head of Mathematical Sciences at Carnegie Mellon and formerly professor of Mathematics and Computer Science at Georgia Tech. The workshop highlighted this by focusing on the many research directions influenced by Tetali\u2019s career. Speakers included researchers in Algorithms, Combinatorics and Probability, with all speakers crossing these boundaries.\u0026nbsp; Over 120 people attended the workshop, including Georgia Tech students and faculty in Mathematics, Computer Science, and Industrial Systems and Engineering and faculty, students and postdocs around the country.\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESee a full schedule \u003Ca href=\u0022https:\/\/sites.gatech.edu\/tetfest60\/\u0022\u003Ehere\u003C\/a\u003E\u003C\/p\u003E\r\n","summary":"","format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EGeorgia Tech hosted a 2-day workshop (September 9-10, 2023) on the rich interplay between randomness, algorithms, and discrete mathematics with a view towards both the history of how these topics came together and flourished and exciting future directions and challenges.\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"Workshop in probability, algorithms, and combinatorics"}],"uid":"36512","created_gmt":"2023-09-17 01:28:46","changed_gmt":"2023-09-17 01:30:46","author":"wperkins3","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2023-09-16T00:00:00-04:00","iso_date":"2023-09-16T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"671729":{"id":"671729","type":"image","title":"Prasad-4-1536x1384.jpg","body":null,"created":"1694914135","gmt_created":"2023-09-17 01:28:55","changed":"1694914135","gmt_changed":"2023-09-17 01:28:55","alt":"Prasad Tetali","file":{"fid":"254837","name":"Prasad-4-1536x1384.jpg","image_path":"\/sites\/default\/files\/2023\/09\/16\/Prasad-4-1536x1384.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/2023\/09\/16\/Prasad-4-1536x1384.jpg","mime":"image\/jpeg","size":239684,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/2023\/09\/16\/Prasad-4-1536x1384.jpg?itok=lJ9F4SEs"}}},"media_ids":["671729"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"669708":{"#nid":"669708","#data":{"type":"news","title":"Professor Santosh Vempala named Simons Investigator","body":[{"value":"\u003Cp\u003EIn 2023, Professor Santosh Vempala was named a Simons Investigator by the Simons Foundation.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0022Simons Investigators are outstanding theoretical scientists who receive a stable base of research support from the foundation, enabling them to undertake the long-term study of fundamental questions.\u0022\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESee the School of Computer Science news story \u003Ca href=\u0022https:\/\/www.scs.gatech.edu\/news\/professor-named-simons-investigator\u0022\u003Ehere\u003C\/a\u003E.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe citation by the \u003Ca href=\u0022https:\/\/www.simonsfoundation.org\/grant\/simons-investigators\/?tab=awardees\u0022\u003ESimons foundation\u003C\/a\u003E reads:\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0022Santosh Vempala has made fundamental advances in the theory of algorithms: for sampling high-dimensional distributions, computing the volume of a convex body, optimization over convex sets, randomized matrix approximation, as well as basic problems in machine learning. In many cases, these were the first polynomial-time algorithms and co-evolved with insights into high-dimensional geometry and probability. Recent highlights include proving that sufficiently sparse linear systems can be solved faster than matrix multiplication (Ax=b, the workhorse of modern computation); extending sampling methods to non-Euclidean (Riemannian) geometries to make them faster (leading to practical methods in very high dimension); pioneering techniques for algorithmic robust statistics (immune to adversarial corruptions); and developing a rigorous theory of computation and learning in the brain in a biologically plausible model (how does the mind emerge from neurons and synapses?). He continues to be puzzled by whether an unknown polytope can be learned in polytime from samples, whether its diameter is bounded by a polynomial in its description length, whether its volume can be computed in polytime without randomization, and whether the answers to these questions will be discovered by humans or by AI.\u0022\u003C\/p\u003E\r\n","summary":"","format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003ESantosh Vempala, Professor of Computer Science, ACO Director and ARC Faculty was recently named a Simons Investigator.\u0026nbsp;\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"Vempala named Simons Investigator"}],"uid":"36512","created_gmt":"2023-09-16 20:29:46","changed_gmt":"2023-09-17 01:25:33","author":"wperkins3","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2023-09-16T00:00:00-04:00","iso_date":"2023-09-16T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"671726":{"id":"671726","type":"image","title":"santosh.jpeg","body":null,"created":"1694896197","gmt_created":"2023-09-16 20:29:57","changed":"1694896197","gmt_changed":"2023-09-16 20:29:57","alt":"Santosh Vempala","file":{"fid":"254834","name":"santosh.jpeg","image_path":"\/sites\/default\/files\/2023\/09\/16\/santosh.jpeg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/2023\/09\/16\/santosh.jpeg","mime":"image\/jpeg","size":36100,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/2023\/09\/16\/santosh.jpeg?itok=j7BSCluc"}}},"media_ids":["671726"],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"153","name":"Computer Science\/Information Technology and Security"},{"id":"135","name":"Research"}],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"665928":{"#nid":"665928","#data":{"type":"news","title":"SIAM Activity Group on Optimization Test of Time Award for Prof. Rentao Monteiro","body":[{"value":"\u003Cp\u003ESam Burer and Renato Monteiro are the winners of the SIAM Activity Group on Optimization Test of Time Award 2023. The award was given for their celebrated paper\u003C\/p\u003E\r\n\r\n\u003Cp\u003EA nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, \u003Cem\u003EMathematical Programming Series B\u003C\/em\u003E\u003Cem\u003E,\u003C\/em\u003E 95, 329-357\u0026nbsp;(2003).\u003C\/p\u003E\r\n\r\n\u003Cp\u003ECongratulations!\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Prof. Rentao Monteiro wins the award for his influential work on non-linear algorithm for semi-definite programming."}],"uid":"34983","created_gmt":"2023-02-18 20:00:50","changed_gmt":"2023-02-18 20:12:32","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2023-02-18T00:00:00-05:00","iso_date":"2023-02-18T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"71956":{"id":"71956","type":"image","title":"Renato Monteiro - Profile Image","body":null,"created":"1449177414","gmt_created":"2015-12-03 21:16:54","changed":"1475894647","gmt_changed":"2016-10-08 02:44:07","alt":"Renato Monteiro - Profile Image","file":{"fid":"193622","name":"rmonteiro.jpg","image_path":"\/sites\/default\/files\/images\/rmonteiro_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/rmonteiro_0.jpg","mime":"image\/jpeg","size":4598,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/rmonteiro_0.jpg?itok=Lu3e4Tbh"}}},"media_ids":["71956"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"665929":{"#nid":"665929","#data":{"type":"news","title":"Congratulations to Prof. Diego Cifuentes for winning SIAM Activity Group on Algebraic Geometry Early Career Prize","body":[{"value":"\u003Cp\u003ECongratulations to Prof. Diego Cifuentes for receiving the 2023 SIAM Activity Group on Algebraic Geometry Early Career Prize. His research centers around the development of mathematical optimization methods, and the application of these methods in engineering areas such as machine learning, statistics, robotics, power systems, and computer vision. He also works in the theoretical analysis of optimization methods, leveraging geometric and combinatorial information to improve efficiency and robustness\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Diego Cifuentes was awarded the 2023 SIAM Activity Group on Algebraic Geometry Early Career Prize"}],"uid":"34983","created_gmt":"2023-02-18 20:10:42","changed_gmt":"2023-02-18 20:11:43","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2023-02-18T00:00:00-05:00","iso_date":"2023-02-18T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"649790":{"id":"649790","type":"image","title":"Diego Cifuentes","body":null,"created":"1629251687","gmt_created":"2021-08-18 01:54:47","changed":"1629251687","gmt_changed":"2021-08-18 01:54:47","alt":"Diego Cifuentes","file":{"fid":"246644","name":"Diego_Cifuentes (1).jpg","image_path":"\/sites\/default\/files\/images\/Diego_Cifuentes%20%281%29.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/Diego_Cifuentes%20%281%29.jpg","mime":"image\/jpeg","size":630356,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/Diego_Cifuentes%20%281%29.jpg?itok=jmia0_gW"}}},"media_ids":["649790"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"655249":{"#nid":"655249","#data":{"type":"news","title":" ARC-ACO Fellowship Winners for Spring 2022","body":[{"value":"\u003Cp\u003EThe\u0026nbsp;\u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center (ARC)\u003C\/a\u003E\u0026nbsp;and \u003Ca href=\u0022https:\/\/aco.gatech.edu\/\u0022\u003EAlgorithms Combinatorics and Optimization (ACO)\u003C\/a\u003E are pleased to announce the following ARC-TRIAD\u0026nbsp;fellowship receipients\u0026nbsp;for the Spring 2022 semester.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EJing Yu (ACO) : Fast Distributed Algorithm Conjecture for Lovasz Local Lemma\u003C\/p\u003E\r\n\r\n\u003Cp\u003EShen Zhang (ML):\u0026nbsp; Toward optimal multi-agent reinforcement learning: From consensus to policy evaluation\u003C\/p\u003E\r\n\r\n\u003Cp\u003EMirabel Reid (CS): Graph Parameterization in the Assembly Model\u003C\/p\u003E\r\n\r\n\u003Cp\u003EYiling Luo (OR) : Towards Understanding Statistical Properties of Model Parameters in Stochastic First Order Optimization Algorithms\u003C\/p\u003E\r\n\r\n\u003Cp\u003EAdam Brown (ACO) : Diverse Subset Selection\u003C\/p\u003E\r\n\r\n\u003Cp\u003EMehrdad Ghadiri (ACO): Tall p-norm Regression in Input Sparsity Time\u003C\/p\u003E\r\n\r\n\u003Cp\u003EQunzhi Xu (OR): Active Sequential Change-Point Detection Under Sampling Control\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe selection committee comprised of Greg Blekherman, Debankur Mukherjee, Sahil Singla, Mohit Singh and Santosh Vempala. Congratulations to the winners and look forward to great research from them!\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC-TRIAD Fellowship Winners for Spring 2022"}],"uid":"34983","created_gmt":"2022-02-07 15:30:28","changed_gmt":"2022-02-17 22:09:09","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2022-02-07T00:00:00-05:00","iso_date":"2022-02-07T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"648046":{"#nid":"648046","#data":{"type":"news","title":"New Collaborative Research Grant ","body":[{"value":"\u003Cp\u003EARC members Richard Peng, Mohit Singh and Santosh Vempala along with Yin-Tat Lee (UW)\u0026nbsp; receive $1.2 million NSF award for collaborative research on\u0026nbsp; \u0026quot;\u003Ca href=\u0022https:\/\/www.nsf.gov\/awardsearch\/showAward?AWD_ID=2106444\u0026amp;HistoricalAwards=false\u0022\u003EFundamental Challenges in Optimization\u003C\/a\u003E\u0026quot;.\u0026nbsp; The goal of this project is to advance the field of optimization by addressing challenging problems on the frontier of efficient optimization.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cbr \/\u003E\r\nPI Santosh Vempala noted that \u0026quot;Optimization has been a primary inspiration for the theory of algorithms, This project targets basic optimization problems, and aims to develop new techniques while unifying continuous and discrete perspectives.\u0026quot;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC members  receive $1.2 million NSF award for collaborative research on  Fundamental Challenges in Optimization.  "}],"uid":"34983","created_gmt":"2021-06-10 15:44:08","changed_gmt":"2021-06-10 15:44:08","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2021-06-10T00:00:00-04:00","iso_date":"2021-06-10T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"648045":{"#nid":"648045","#data":{"type":"news","title":"Professor Dana Randall\u0027s research on self-organizing particle system ","body":[{"value":"\u003Cp\u003E\u003Ca href=\u0022https:\/\/news.gatech.edu\/2021\/04\/29\/simple-robots-smart-algorithms-meet-bobbots\u0022\u003EArticle \u003C\/a\u003Eon Professor Dana Randall\u0026#39;s research on self-organizing particle system that show\u0026nbsp; even the simplest of robots can still accomplish tasks well beyond the capabilities of one, or even a few, of them with smart algorithms.\u003C\/p\u003E\r\n\r\n\u003Cp\u003Ehttps:\/\/news.gatech.edu\/2021\/04\/29\/simple-robots-smart-algorithms-meet-bobbots\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"What dumb robots can achieve with smart algorithms. "}],"uid":"34983","created_gmt":"2021-06-10 15:40:56","changed_gmt":"2021-06-10 15:41:45","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2021-06-10T00:00:00-04:00","iso_date":"2021-06-10T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"610475":{"id":"610475","type":"image","title":"Dana Randall","body":null,"created":"1535470479","gmt_created":"2018-08-28 15:34:39","changed":"1535470479","gmt_changed":"2018-08-28 15:34:39","alt":"","file":{"fid":"232458","name":"dana.jpg","image_path":"\/sites\/default\/files\/images\/dana_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/dana_0.jpg","mime":"image\/jpeg","size":192289,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/dana_0.jpg?itok=c9xvudmk"}}},"media_ids":["610475"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[{"id":"39521","name":"Robotics"}],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"641177":{"#nid":"641177","#data":{"type":"news","title":"Best Paper Award at ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021","body":[{"value":"\u003Cp\u003EARC faculty \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~rpeng\/\u0022\u003ERichard Peng\u003C\/a\u003E and \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~vempala\/\u0022\u003ESantosh Vempala\u003C\/a\u003E received the best paper award at\u0026nbsp;ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 for their breakthrough work on \u003Ca href=\u0022https:\/\/arxiv.org\/abs\/2007.10254\u0022\u003ESolving Sparse Linear Systems Faster than Matrix Multiplication\u003C\/a\u003E.\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":[{"value":"Best Paper award at SODA"}],"field_summary":[{"value":"\u003Cp\u003EProfessor\u0026nbsp;\u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~rpeng\/\u0022\u003ERichard Peng\u003C\/a\u003E and Professor\u0026nbsp;\u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~vempala\/\u0022\u003ESantosh Vempala\u003C\/a\u003E received the best paper award at\u0026nbsp;ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 for their breakthrough work on \u003Ca href=\u0022https:\/\/arxiv.org\/abs\/2007.10254\u0022\u003ESolving Sparse Linear Systems Faster than Matrix Multiplication\u003C\/a\u003E.\u0026nbsp;\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"Best Paper award at SODA to ARC members Richard Peng and Santosh Vempala"}],"uid":"34983","created_gmt":"2020-11-10 17:25:41","changed_gmt":"2020-11-10 23:30:30","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2020-11-10T00:00:00-05:00","iso_date":"2020-11-10T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"368631":{"id":"368631","type":"image","title":"Richard Peng","body":null,"created":"1449245845","gmt_created":"2015-12-04 16:17:25","changed":"1475895107","gmt_changed":"2016-10-08 02:51:47","alt":"Richard Peng","file":{"fid":"74912","name":"richardpeng_aaaa0326cropped.jpg","image_path":"\/sites\/default\/files\/images\/richardpeng_aaaa0326cropped.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/richardpeng_aaaa0326cropped.jpg","mime":"image\/jpeg","size":100307,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/richardpeng_aaaa0326cropped.jpg?itok=Yvd5QoGl"}},"342841":{"id":"342841","type":"image","title":"Santosh Vempala","body":null,"created":"1449245639","gmt_created":"2015-12-04 16:13:59","changed":"1475895062","gmt_changed":"2016-10-08 02:51:02","alt":"Santosh Vempala","file":{"fid":"201924","name":"santosh-vempala.jpg","image_path":"\/sites\/default\/files\/images\/santosh-vempala_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/santosh-vempala_0.jpg","mime":"image\/jpeg","size":12220,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/santosh-vempala_0.jpg?itok=NiICUMbd"}}},"media_ids":["368631","342841"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"641191":{"#nid":"641191","#data":{"type":"news","title":"Professor Santanu Dey awarded the Inaugural Egon Balas Prize","body":[{"value":"\u003Cp\u003EThe \u003Ca href=\u0022https:\/\/connect.informs.org\/optimizationsociety\/prizes\/egon-balas-prize\u0022\u003Einaugural IOS Balas Prize\u003C\/a\u003E is awarded to \u003Ca href=\u0022https:\/\/www2.isye.gatech.edu\/~sdey30\/\u0022\u003EProfessor Santanu S. Dey\u003C\/a\u003E\u0026nbsp;for broad and significant contributions to the theory, methodology, and applications of Discrete Optimization. The award citation highlights that Dr. Dey has\u0026nbsp;made strong and seminal contributions to the theory of maximal lattice-free convex sets, multi-row cuts, sparse cutting planes in integer programming, the structure of mixed-integer convex optimization, and along with co-authors, developed practical algorithms for power problems based on strong relaxations from a detailed analysis of the underlying systems.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC faculty Santanu Dey awarded the Inaugural Egon Balas Prize"}],"uid":"34983","created_gmt":"2020-11-10 19:27:28","changed_gmt":"2020-11-10 23:29:56","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2020-11-10T00:00:00-05:00","iso_date":"2020-11-10T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"640513":{"id":"640513","type":"image","title":"Santanu Dey","body":null,"created":"1603461037","gmt_created":"2020-10-23 13:50:37","changed":"1603461037","gmt_changed":"2020-10-23 13:50:37","alt":"Santanu Dey ","file":{"fid":"243458","name":"Santanu Dey_Square.jpg","image_path":"\/sites\/default\/files\/images\/Santanu%20Dey_Square_3.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/Santanu%20Dey_Square_3.jpg","mime":"image\/jpeg","size":46096,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/Santanu%20Dey_Square_3.jpg?itok=gXzj7qoz"}}},"media_ids":["640513"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"641178":{"#nid":"641178","#data":{"type":"news","title":"ARC-TRIAD Fellowship Winners for Spring 2021","body":[{"value":"\u003Cp\u003EThe\u0026nbsp;\u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center (ARC)\u003C\/a\u003E\u0026nbsp;and\u0026nbsp;\u003Ca href=\u0022https:\/\/triad.gatech.edu\/\u0022\u003ETransdisciplinary Research Institute for Advancing Data Science (TRIAD)\u003C\/a\u003E\u0026nbsp;are pleased to announce the following ARC-TRIAD\u0026nbsp;fellowship receipients\u0026nbsp;for the Spring 2021\u0026nbsp;semester.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EArden Baxter (OR) : Heterogeneous Multi-Resource Allocation with Subset Demand Requests.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EZaiwei Chen (ML): A Unified Framework for Finite-Sample Analysis of Reinforcement Learning Algorithms\u003C\/p\u003E\r\n\r\n\u003Cp\u003EYatharth Dubey (OR): On the Success of Strong Branching\u003C\/p\u003E\r\n\r\n\u003Cp\u003EHe Jia(CS): Robustly Learning of Mixtures of Gaussians\u003C\/p\u003E\r\n\r\n\u003Cp\u003EHassan Mortagy (OR): First-Order Methods for Combinatorial Structures and Machine Learning\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDaan Rutten(OR): Improving Capacity Scaling With Machine Learning Predictions\u003C\/p\u003E\r\n\r\n\u003Cp\u003EZhanzhan Zhao(CS): Mitigating Residential Segregation Through Urban Infrastructure\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe selection committee this semester included Anton Bernshteyn, Santanu Dey, Xiaoming Huo, Mohit Singh, Prasad Tetali, Siva Theja and Santosh Vempala. Congratulations to the winners and look forward to great research from them!\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":[{"value":"ARC-TRIAD Fellowship Winners for Spring 2021"}],"field_summary":[{"value":"\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\u003C\/ul\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"ARC-TRIAD Fellowship Winners for Spring 2021"}],"uid":"34983","created_gmt":"2020-11-10 17:33:20","changed_gmt":"2020-11-10 19:08:36","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2020-11-10T00:00:00-05:00","iso_date":"2020-11-10T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"633649":{"#nid":"633649","#data":{"type":"news","title":"Joint Indo-US Virtual Network Center ","body":[{"value":"\u003Cp\u003EARC faculty including Mohit Singh, Prasad Tetali and Santosh Vempala are involved in creating a joint Indo-US Virtual Network Center involving Georgia Tech and University of California, Berkeley from USA and TIFR, Mumbai and IISc, Bangalore from India.\u0026nbsp; The center will facilitiate research on the new and exciting topic of Polynomials as an Algorithmic Paradigm. The virtual center will facilitate collaboration between the faculty and students from the involved universities as well as workshops and online seminars. The virtual center is funded by \u003Ca href=\u0022https:\/\/www.iusstf.org\/\u0022\u003Ethe Indo-U.S. Science and Technology Forum (IUSSTF) .\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EPrasad Tetali, the lead PI on the US team remarked that \u0026quot;the algebra and geometry of polynomials has recently facilitated the analysis of complex problems and helped settle longstanding conjectures in algorithms, combinatorics and optimization. The full potential, particularly as an algorithmic paradigm, is yet to be realized. I am thankful for the opportunity provided by the IUSSTF grant and excited to navigate this research space, with an excellent team of computer scientists (along with their students and postdocs) from multiple top U.S. and Indian research institutions.\u0026quot;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC faculty create a joint Indo-US Virtual Network Center involving multiple universities from US and India to facilitiate research on Polynomials as an Algorithmic Paradigm. "}],"uid":"34983","created_gmt":"2020-03-18 15:10:10","changed_gmt":"2020-03-25 19:14:54","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2020-01-30T00:00:00-05:00","iso_date":"2020-01-30T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":["msingh94@isye.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"633666":{"#nid":"633666","#data":{"type":"news","title":"Lectures on Traveling Salesman Problem by Ola Svensson","body":[{"value":"\u003Cp\u003EProf. Ola Svensson from EPFL, Switzerland gave a series of lectures on the traveling salesman problem (TSP). TSP is a fundamental optimization problem has played a crucial role in development of algorithmic techniques as well as optimization methods. Ola Svensson gave series of three talks detailing the fundamental advances on the symmetric traveling salesman problem as well as the asymmetric traveling salesman problem. Many of these works have received best paper awards in leading conferences (STOC, FOCS). Ola Svensson also received the celebrated Held Prize for his work on the traveling salesman problem.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Lectures on Traveling Salesman Problem by Ola Svensson"}],"uid":"34983","created_gmt":"2020-03-19 01:40:04","changed_gmt":"2020-03-19 11:45:37","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2019-04-25T00:00:00-04:00","iso_date":"2019-04-25T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"633667":{"id":"633667","type":"image","title":"Ola Svensson Talk","body":null,"created":"1584582473","gmt_created":"2020-03-19 01:47:53","changed":"1584582473","gmt_changed":"2020-03-19 01:47:53","alt":"","file":{"fid":"241124","name":"2019-04-25 10.04.39.jpg","image_path":"\/sites\/default\/files\/images\/2019-04-25%2010.04.39.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/2019-04-25%2010.04.39.jpg","mime":"image\/jpeg","size":871406,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/2019-04-25%2010.04.39.jpg?itok=MopvbEfq"}}},"media_ids":["633667"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"633668":{"#nid":"633668","#data":{"type":"news","title":"Lectures by Nima Anari on Rapidly Mixing Random Walks","body":[{"value":"\u003Cp\u003EA fundamental tool used in sampling, counting, and inference problems is the Markov Chain Monte Carlo method, which uses random walks to solve computational problems. The main parameter defining the efficiency of this method is how quickly the random walk mixes (converges to the stationary distribution). Prof. Anari from Stanford University gave a series of lectures on using log concave polynomials in analysis of random walks to sample and count bases of a matroid. The results have resolved multiple conjectures in combinatorics, probability theory and algorithms.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Lectures by Nima Anari on Rapidly Mixing Random Walks via Log-concave Polynomials"}],"uid":"34983","created_gmt":"2020-03-19 01:53:50","changed_gmt":"2020-03-19 11:14:50","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2019-11-04T00:00:00-05:00","iso_date":"2019-11-04T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"633669":{"id":"633669","type":"image","title":"Nima Anari Talk","body":null,"created":"1584582915","gmt_created":"2020-03-19 01:55:15","changed":"1584582915","gmt_changed":"2020-03-19 01:55:15","alt":"","file":{"fid":"241125","name":"2019-11-05 16.16.18.jpg","image_path":"\/sites\/default\/files\/images\/2019-11-05%2016.16.18.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/2019-11-05%2016.16.18.jpg","mime":"image\/jpeg","size":418997,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/2019-11-05%2016.16.18.jpg?itok=3VTBcef0"}}},"media_ids":["633669"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"630228":{"#nid":"630228","#data":{"type":"news","title":"ARC-TRIAD fellowship winners for Spring 2020","body":[{"value":"\u003Cp\u003EThe\u0026nbsp;\u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center (ARC)\u003C\/a\u003E\u0026nbsp;and\u0026nbsp;\u003Ca href=\u0022https:\/\/triad.gatech.edu\/\u0022\u003ETransdisciplinary Research Institute for Advancing Data Science (TRIAD)\u003C\/a\u003E\u0026nbsp;are pleased to announce the 10\u0026nbsp;ARC-TRIAD\u0026nbsp;fellowship receipients\u0026nbsp;for the Spring 2020\u0026nbsp;semester:\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ETimothy Duff\u003C\/strong\u003E (ACO, Math), Challenges in computational algebraic vision.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EHaoming Jiang\u003C\/strong\u003E (ML ISyE), Nonparametric Regression on Low Dimensional Manifolds using Neural Networks.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAditi Laddha\u003C\/strong\u003E (ACO CS), Better Approximation for Uniform Sparsest Cut.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EJiaming Liang\u003C\/strong\u003E (OR ISyE), First-Order Methods for Nonconvex Smooth Composite Optimization Problems.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EYuliia Lut \u003C\/strong\u003E(IE, IsyE) Improving accuracy for dynamic differential privacy with change-point detection.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAndrew McRae\u003C\/strong\u003E (ECE), Exploiting low-dimensional manifold structure with kernel methods.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EShengding Sun\u003C\/strong\u003E (ACO Math), Sparse positive semidefinite relaxations with S^{n,k}.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EMohamed El Tonbari\u003C\/strong\u003E (OR, ISyE), On Two-Stage Distributionally Robust Optimization with Binary Variables.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ELiyan Xie\u003C\/strong\u003E (IE, ISyE), Distributionally Robust Nonparametric Hypothesis Testing.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EYujie Zhao\u003C\/strong\u003E (Statistics ISyE)), Homotopic Methods can Significantly Speed up the Computation of the Non-differential Optimization Problems.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe selection committee comprised\u0026nbsp;of Rachel Cummings, Xiaoming Huo,\u0026nbsp; Debankur Mukherjee, Richard Peng, Mohit Singh, Prasad Tetali, Santosh Vempala,\u0026nbsp;Yao Xie, and Josephine Yu.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC-TRIAD Fellowship  winners for Spring 2020"}],"uid":"34983","created_gmt":"2019-12-19 16:04:50","changed_gmt":"2019-12-19 16:04:50","author":"Mohit Singh","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2019-12-02T00:00:00-05:00","iso_date":"2019-12-02T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"617139":{"#nid":"617139","#data":{"type":"news","title":"Fellowship winners for Spring \u002719","body":[{"value":"\u003Cp\u003EThe \u003Ca href=\u0022http:\/\/arc.gatech.edu\u0022\u003EAlgorithms and Randomness Center (ARC)\u003C\/a\u003E and \u003Ca href=\u0022https:\/\/triad.gatech.edu\u0022\u003ETransdisciplinary Research Institute for Advancing Data Science (TRIAD)\u003C\/a\u003E\u0026nbsp;are pleased to announce the 8 ARC-TRIAD\u0026nbsp;fellowship receipients\u0026nbsp;for the Spring 2019 semester:\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003EMinshuo Chen\u003C\/strong\u003E\u0026nbsp;(ML, ISyE), advisor:\u0026nbsp;Tuo Zhao\u0026nbsp;(ISyE)\r\n\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: \u003Cem\u003EOn Nonconvex Stochastic Optimization of Residual Networks\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003EZongchen Chen\u003C\/strong\u003E\u0026nbsp;(ACO, CS), advisor: Eric Vigoda (CS)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EDistribution Testing for Markov Random Fields\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003EDaniela Hurtado Lange\u003C\/strong\u003E\u0026nbsp;(OR, ISyE), advisor: Siva Theja Maguluri\u0026nbsp;(ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EPerformance analysis of scheduling algorithms in a switch\u0026nbsp;\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003ETianyi Liu\u003C\/strong\u003E\u0026nbsp;(OR, ISyE), advisor:\u0026nbsp;Enlu Zhou\u0026nbsp;(ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EOnline Risk Quantification of Input Uncertainty\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003ESebastian Perez-Salazar\u003C\/strong\u003E\u0026nbsp;(ACO, ISyE), advisors:\u0026nbsp;Mohit Singh (ISyE) and\u0026nbsp;Alejandro Toriello (ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EDynamic allocation in the Cloud with Near-Optimal Efficiency\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003ESamantha Petti\u0026nbsp;\u003C\/strong\u003E(ACO, Math), advisor:\u0026nbsp;Santosh Vempala\u0026nbsp;(CS)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003ETesting Geometric Convexity\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003EYoungho Yoo\u003C\/strong\u003E\u0026nbsp;(ACO, Math), advisor:\u0026nbsp;Robin Thomas\u0026nbsp;(Math)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EPacking zero A-paths in undirected group labelled graphs\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003EWanrong Zhang\u003C\/strong\u003E\u0026nbsp;(IE, ISyE), advisors:\u0026nbsp;Yajun Mei (ISyE) and Rachel Cummings (ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EOnline Monitoring Streaming Data Under Privacy or Resources Constraints\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003EThe review committee was\u0026nbsp;Matthieu Bloch, Wenjing Liao, Vivek Madan, Siva Theja Maguluri,\u0026nbsp;Mohit Singh (chair), Santosh Vempala, Lutz Warnke, Yao Xie, and Tuo Zhao.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"8 Fellowships in ISyE, Math, and CS"}],"uid":"32895","created_gmt":"2019-01-31 22:16:54","changed_gmt":"2019-01-31 22:20:35","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2018-12-01T00:00:00-05:00","iso_date":"2018-12-01T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"8862","name":"Student Research"}],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"606463":{"#nid":"606463","#data":{"type":"news","title":"ARC Hosts Third Workshop on Algorithms and Randomness   ","body":[{"value":"\u003Cp\u003EThe School of Computer Science\u0026rsquo;s \u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center\u003C\/a\u003E (ARC) hosted its third \u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/164\u0022\u003EAlgorithms and Randomness Workshop\u003C\/a\u003E from May 14 to 17. More than 70 scholars attended the 27 talks by leading researchers in the field.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe workshop brought together\u0026nbsp;researchers from multiple disciplines, including combinatorics, computational complexity,\u0026nbsp;optimization,\u0026nbsp;probability, randomized algorithms, and statistical physics. While some speakers presented recent breakthrough results, others gave overviews on specific\u0026nbsp;research areas or problems.\u003C\/p\u003E\r\n\r\n\u003Cp\u003ESome research highlights:\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-\u003Cstrong\u003EDaniel Dadush\u003C\/strong\u003E, a researcher at Centrum Wiskunde \u0026amp; Informatica (Netherlands) and a GT alumnus, presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/pdf\/1711.05667\u0022\u003EA Friendly Smoothed Analysis of the Simplex Method\u003C\/a\u003E, \u003C\/em\u003Eproviding an improved and simpler analysis of the shadow vertex simplex method.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003EMark Jerrum\u003C\/strong\u003E of Queen Mary University of London, a Markov chain Monte Carlo pioneer, presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1709.08561v2\u0022\u003EA Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability\u003C\/a\u003E\u003C\/em\u003E on all terminal reliability of undirected graphs.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-\u003Cstrong\u003EWill Perkins\u003C\/strong\u003E, a fellow at University of Birmingham (UK), presented \u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/pdf\/1803.02702\u0022\u003ESphere Packings, Codes, and Kissing Numbers via Hard Core Models\u003C\/a\u003E, \u003C\/em\u003Eproving a lower bound on the expected size of spherical code from hard cap models.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003ESofya Raskhodnikova\u003C\/strong\u003E of Boston University, an expert on property testing, presented \u003Cem\u003EFast Algorithms for Testing Geometric Properties\u003C\/em\u003E, which included an introduction and survey of the field.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E-Professor \u003Cstrong\u003EVirginia Vassilevska-Williams\u003C\/strong\u003E of MIT presented \u003Cem\u003ETowards Tight Approximation Bounds for Graph Diameter and Eccentricities\u003C\/em\u003E about breakthrough lower bounds on estimating the diameter of a graph, assuming the strong exponential-time hypothesis.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe workshop\u0026mdash;organized by ARC director Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/home\/vigoda\/\u0022\u003E\u003Cstrong\u003EEric Vigoda\u003C\/strong\u003E\u003C\/a\u003E, Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/~vempala\/\u0022\u003E\u003Cstrong\u003ESantosh Vempala\u003C\/strong\u003E\u003C\/a\u003E\u003Cstrong\u003E, \u003C\/strong\u003Eand Professor \u003Ca href=\u0022https:\/\/www.cc.gatech.edu\/people\/prasad-tetali\u0022\u003E\u003Cstrong\u003EPrasad Tetali\u003C\/strong\u003E\u003C\/a\u003E\u003Cstrong\u003E\u0026mdash;\u003C\/strong\u003Ealso intended to introduce burgeoning scholars to the larger community and foster collaboration.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026ldquo;Several senior researchers were particularly impressed at the next generation of researchers, judging by the high-quality results and\u0026nbsp;lectures presented,\u0026rdquo; said Tetali. \u0026ldquo;It was gratifying, as well as humbling, to see and hear of breakthrough results by\u0026nbsp;former postdocs and students of Georgia Tech colleagues and their collaborators.\u0026rdquo;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ARC hosted a workshop on algorithms and randomness. "}],"uid":"34541","created_gmt":"2018-05-24 16:08:15","changed_gmt":"2018-06-27 18:11:11","author":"Tess Malone","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2018-05-24T00:00:00-04:00","iso_date":"2018-05-24T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"606464":{"id":"606464","type":"image","title":"ARC Workshop","body":null,"created":"1527178757","gmt_created":"2018-05-24 16:19:17","changed":"1527179612","gmt_changed":"2018-05-24 16:33:32","alt":"Jerrum talk","file":{"fid":"231312","name":"IMG_4969.jpg","image_path":"\/sites\/default\/files\/images\/IMG_4969_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/IMG_4969_0.jpg","mime":"image\/jpeg","size":832731,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/IMG_4969_0.jpg?itok=KaAlNy5e"}}},"media_ids":["606464"],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003ETess Malone, Communications Officer\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022mailto:tess.malone@cc.gatech.edu\u0022\u003Etess.malone@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\r\n","format":"limited_html"}],"email":["tess.malone@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"601358":{"#nid":"601358","#data":{"type":"news","title":"7 Student Fellowships for Spring \u002718","body":[{"value":"\u003Cdiv\u003EARC is pleased to announce that 7 student fellowships were awarded for the Spring 2018 semester. \u0026nbsp;\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003E\u0026nbsp;\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003EThe award winners (in arbitrary order):\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003E\u0026nbsp;\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003E\u003Cem\u003EARC-TRIAD\u003C\/em\u003E fellowships:\u003C\/div\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003ERui Gao\u003C\/em\u003E\u003C\/strong\u003E (ISyE), advisor: Anton Kleywegt (ISyE)\r\n\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Wasserstein Distributional Robustness and\u0026nbsp;Generalization\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cem\u003E\u003Cstrong\u003EAdrian Rivera Cardoso\u003C\/strong\u003E\u003C\/em\u003E (ISyE),\u0026nbsp;advisor: Huan Xu (ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Online Risk Averse Minimization with Bandit Feedback\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cem\u003E\u003Cstrong\u003EZhehui Chen\u003C\/strong\u003E\u003C\/em\u003E (ISyE), advisor: Tuo Zhao (ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Online Generalized Eigenvalue Decomposition: Min-max Formulation,\u0026nbsp;Primal Dual Landscape and Efficient Optimization\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cem\u003E\u003Cstrong\u003EGeorge Kerchev\u003C\/strong\u003E\u003C\/em\u003E (Math), advisor: Christian Houdre (Math)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Asymptotic behavior of the length of the longest common\u0026nbsp;subsequence in hidden Markov models\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cem\u003E\u003Cstrong\u003EJun-Kun Wang\u003C\/strong\u003E\u003C\/em\u003E (CS), advisor: Jacob Abernethy (CS)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Online Frank-Wolfe and its Application in Herding\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cem\u003E\u003Cstrong\u003EUthaipon Tantipongpipat \u003C\/strong\u003E\u003C\/em\u003E(CS), advisor: Mohit Singh (ISyE)\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Design and Analysis of Approximation Algorithms for Optimal Design\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cdiv\u003E\u003Cem\u003EARC-ACO\u003C\/em\u003E fellowship:\u003C\/div\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EHe Guo\u003C\/em\u003E\u003C\/strong\u003E (Math), advisor: Lutz Warnke (Math)\r\n\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: Semi-Random Algorithmic Constructions\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cdiv\u003E\u0026nbsp;\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003EThe review committee was Milena Mihail, Sebastian Pokutta,\u0026nbsp;\u003C\/div\u003E\r\n\r\n\u003Cdiv\u003ESantosh Vempala, Yao Xie, Josephine Yu, and Enlu Zhou.\u003C\/div\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Awarded to 7 PhD students in ISyE, Math, and CoC "}],"uid":"32895","created_gmt":"2018-01-25 17:22:46","changed_gmt":"2018-01-25 17:27:53","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2018-01-25T00:00:00-05:00","iso_date":"2018-01-25T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"597582":{"#nid":"597582","#data":{"type":"news","title":"ARC 11 featuring Robert Schapire (Microsoft Research NYC)","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003EARC11\u003C\/strong\u003E: Special event celebrating the 11\u003Csup\u003Eth\u003C\/sup\u003E anniversary of GT\u0026rsquo;s Algorithms and Randomness Center, featuring Robert Schapire (Microsoft Research NYC).\u003C\/p\u003E\r\n\r\n\u003Cp\u003EOctober 30, 2017\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/hg\/item\/597444\u0022\u003EARC11 program available here.\u003C\/a\u003E\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Special event celebrating the 11 year anniversay of ARC (October 30, 2017)"}],"uid":"27544","created_gmt":"2017-10-18 19:55:03","changed_gmt":"2017-10-18 19:55:03","author":"Francella Tonge","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2017-10-30T00:00:00-04:00","iso_date":"2017-10-30T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"582820":{"#nid":"582820","#data":{"type":"news","title":"Turing Award Winner to Discuss Mind-Based Computation at ARC-IISP Distinguished Lecture","body":[{"value":"\u003Cp\u003EHaving trouble remembering all of your passwords? Then you\u0026rsquo;ll want to attend the ARC-IISP Distinguished Lecture October 27 with Turing Award recipient\u0026nbsp;and internationally renowned computer scientist \u003Ca href=\u0022http:\/\/amturing.acm.org\/award_winners\/blum_4659082.cfm\u0022\u003EManuel Blum\u003C\/a\u003E.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe \u003Ca href=\u0022http:\/\/arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center\u003C\/a\u003E\u0026nbsp;(ARC) and the \u003Ca href=\u0022http:\/\/iisp.gatech.edu\/\u0022\u003EInstitute for Information Security and Privacy\u003C\/a\u003E are hosting Blum who will present a lecture titled, \u0026ldquo;\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/calendar\/day\/2016\/10\/27\/19985\u0022 target=\u0022_blank\u0022\u003EHuman Computation with an Application to Passwords\u003C\/a\u003E.\u0026rdquo; The event begins at 11 a.m. in room 1443 of the Klaus Building.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDuring his presentation Blum, who serves as the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, will explore documented facets of long- and short-term human memory that have implications on what people can and cannot remember.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EWith this, Blum will then share his insights into how people \u0026ndash; working only in their minds \u0026ndash;can \u0026ldquo;transform website names into random-looking passwords that are provably hard to forge.\u0026rdquo; Although creating and remembering online passwords is a focus, Blum\u0026rsquo;s notions also apply to other problems that people might want to solve in their heads such as solutions for speed chess, crossword puzzles, cryptographic problems, and other analytical challenges.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EBlum will greet attendees prior to the lecture during a 30-minute reception, which begins at 10:30 a.m.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EBlum is recognized as a pioneer in the field of theoretical computer science. Throughout his career his research has focused on the single unifying theme of finding positive, practical results of living in a world where computational resources are restricted.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EA member of numerous science and computing organizations, such as the National Academy of Sciences and the Institute of Electrical and Electronics Engineers, Blum has received several awards. These include a University of California at Berkeley Distinguished Teaching Award, their Faculty Research Award, the Sigma Xi\u0026rsquo;s Monie A. Ferst Award, and the Carnegie Mellon Herbert A. Simons Teaching Award.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EBlum\u0026rsquo;s lecture is part of a unique back-to-back presentation. He and \u003Ca href=\u0022http:\/\/www.scs.gatech.edu\/news\/582709\/renowned-computer-scientist-lenore-blum-present-annual-imlay-lecture\u0022\u003EProfessor Lenore Blum\u003C\/a\u003E\u0026nbsp;are both speaking at Georgia Tech on October 27. Lenore Blum will present the Georgia Tech College of Computing\u0026rsquo;s annual John P. Imlay Jr. Distinguished Lecture on at 5 p.m. The\u0026nbsp;Blum\u0026#39;s are married and both are MIT alumni.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbout The Institute for Information Security and Privacy\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe Institute for Information Security and Privacy (IISP) at Georgia Tech connects government, industry, and academia to solve the grand challenges of cybersecurity. As a coordinating body for nine information security labs dedicated to academic and solution-oriented applied research, the IISP leverages intellectual capital from across Georgia Tech and its external partners to address vital solutions for national security, economic continuity, and individual safety.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbout The \u003C\/strong\u003E\u003Cstrong\u003EAlgorithms and Randomness Center\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EAlgorithms and Randomness Center (ARC) is charged with identifying problems with natural connections to algorithms and randomness. As part of this think tank, professors, researchers and students not only devise, extend and solidify theories of algorithms, they create practical solutions for scientists here at Georgia Tech and around the world.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"1995 Turing Award Winner Manuel Blue will present his latest insight regarding mind-based computation during the 2016 ARC-IISP Distinguished Lecture"}],"uid":"30267","created_gmt":"2016-10-19 19:16:38","changed_gmt":"2017-09-18 12:41:18","author":"Devin Young","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-09-19T00:00:00-04:00","iso_date":"2016-09-19T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"50876","name":"School of Interactive Computing"},{"id":"50877","name":"School of Computational Science and Engineering"},{"id":"70263","name":"ARC"},{"id":"430601","name":"Institute for Information Security and Privacy"}],"categories":[{"id":"129","name":"Institute and Campus"},{"id":"133","name":"Special Events and Guest Speakers"},{"id":"134","name":"Student and Faculty"},{"id":"135","name":"Research"},{"id":"153","name":"Computer Science\/Information Technology and Security"},{"id":"143","name":"Digital Media and Entertainment"}],"keywords":[{"id":"1051","name":"Computer Science"},{"id":"4265","name":"ARC"},{"id":"166940","name":"SCS"},{"id":"166941","name":"School of Computer Science"},{"id":"172515","name":"Human-Computation"},{"id":"10419","name":"passwords"}],"core_research_areas":[{"id":"145171","name":"Cybersecurity"},{"id":"39501","name":"People and Technology"}],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDevin M. Young,\u003C\/p\u003E\r\n\r\n\u003Cp\u003ECommunications Assistant\u003C\/p\u003E\r\n","format":"limited_html"}],"email":["devin.young@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"596029":{"#nid":"596029","#data":{"type":"news","title":"Archive of Fall \u002716 ARC Colloquium Series","body":[{"value":"\u003Ch3\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/114\u0022\u003EArchive of the Fall 2016 ARC Colloquium series is available here.\u003C\/a\u003E\u003C\/h3\u003E\r\n\r\n\u003Ch3\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/162\u0022\u003EThe Fall 2017 schedule is available here.\u003C\/a\u003E\u003C\/h3\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Fall 2016 ARC Colloquium Schedule"}],"uid":"32895","created_gmt":"2017-09-18 12:28:40","changed_gmt":"2017-09-18 12:39:57","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-10-05T00:00:00-04:00","iso_date":"2016-10-05T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"596030":{"#nid":"596030","#data":{"type":"news","title":"Theoretical Neuroscience Day, March 15, 2017","body":[{"value":"\u003Ch3\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/160\u0022\u003EThe schedule for the Theoretical Neuroscience Day on March 15, 2017 is available here.\u003C\/a\u003E\u003C\/h3\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Featuring distinguished lecture by Bruno Olshausen"}],"uid":"32895","created_gmt":"2017-09-18 12:31:06","changed_gmt":"2017-09-18 12:31:06","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2017-03-15T00:00:00-04:00","iso_date":"2017-03-15T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"585415":{"#nid":"585415","#data":{"type":"news","title":"Spring \u002717 ARC Fellowship Winners","body":[{"value":"\u003Cp\u003EARC is delighted to announce that 4\u0026nbsp;fellowships were awarded to PhD students in Math, ISyE, and CS for the Spring 2017 semester:\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EMarcel Celaya\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(ACO PhD, Math), advisor: Josephine Yu\r\n\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EAn algorithmic approach to the Gohberg-Markus-Hadwiger conjecture\u0026nbsp;\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003ESamira Samida\u0026nbsp;\u003C\/em\u003E\u003C\/strong\u003E(CS\u0026nbsp;PhD, CS), advisor: Santosh Vempala\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u003Cem\u003E\u0026nbsp;Human Computation with Application to Humanly Usable and Secure Password Methods\u0026nbsp;\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EAlfredo Torrico\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(OR\u0026nbsp;PhD, ISyE), advisor: Sebastian Pokutta\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title: \u003Cem\u003EOnline Constrained Submodular Minimization with\u0026nbsp;Bandit Feedback\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EDi Wu\u0026nbsp;\u003C\/em\u003E\u003C\/strong\u003E(OR\u0026nbsp;PhD, ISyE), advisor: Enlu Zhou\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003ESimulation Budget Allocation Under Input Uncertainty\u0026nbsp;\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003EThanks to the generosity of\u0026nbsp;\u003Ca href=\u0022https:\/\/iisp.gatech.edu\/\u0022\u003EIISP\u003C\/a\u003E, Samida\u0026#39;s award was a joint IISP-ARC fellowship.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":[{"value":"4 students from Math, ISyE, and CoC awarded fellowships"}],"field_summary":[{"value":"\u003Cp\u003EAwarded to 4 PhD students from Math, ISyE, and CoC\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"Awarded to 4 PhD students from Math, ISyE, and CoC"}],"uid":"32895","created_gmt":"2016-12-30 07:37:55","changed_gmt":"2017-09-18 12:24:10","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-10-10T00:00:00-04:00","iso_date":"2016-10-10T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"8862","name":"Student Research"}],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EEric Vigoda\u003C\/p\u003E\r\n","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"587943":{"#nid":"587943","#data":{"type":"news","title":"ARC has 4 papers in upcoming STOC \u002717","body":[{"value":"\u003Cp\u003EGeorgia Tech faculty, postdocs, and students had 4\u0026nbsp;papers accepted to appear at the upcoming \u003Ca href=\u0022http:\/\/acm-stoc.org\/stoc2017\/\u0022\u003E\u003Cem\u003E49th Annual ACM Symposium on Theory of Computing (STOC)\u003C\/em\u003E\u003C\/a\u003E\u0026nbsp;conference in Montreal, Canada on June 19-23, 2017. \u0026nbsp;STOC and\u0026nbsp;\u003Ca href=\u0022http:\/\/dimacs.rutgers.edu\/FOCS16\/\u0022\u003EFOCS\u003C\/a\u003E are the premier venues for publishing algorithms research (STOC occurs annually in the spring and FOCS in the fall). \u0026nbsp;In particular, STOC`17 will be part of a 5-day Theory Festival that brings together the best of algorithmic research from a variety of venues. \u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe authors include\u0026nbsp;ACO Ph.D. students David Durfee and Sadra Yazdanbod, ARC Postdoctoral Fellow\u0026nbsp;Anup Rao, and ARC Professors Richard Peng, Vijay Vazirani, and Santosh Vempala.\u0026nbsp; In addition, Jugal Garg and Ruta Mehta are former ARC Postdoctoral Fellows. \u0026nbsp;Ruta is now an \u003Ca href=\u0022http:\/\/rutamehta.cs.illinois.edu\u0022\u003EAssistant Professor at UIUC\u003C\/a\u003E. \u0026nbsp;Professor Mohit Singh was on the program committee.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe four\u0026nbsp;\u003Cem\u003ESTOC\u0026nbsp;\u003C\/em\u003Epapers are the following:\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1411.5060\u0022\u003ESettling the Complexity of Leontief and PLC Exchange Markets under Exact and Approximate Equilibria\u003C\/a\u003E\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- Jugal Garg (UIUC), Ruta Mehta (UIUC), Vijay V. Vazirani (GT), and Sadra Yazdanbod (GT)\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1606.04696\u0022\u003EGeodesic Walks in Polytopes\u003C\/a\u003E\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; - Yin Tat Lee (Microsoft\/Washington), Santosh S. Vempala (GT)\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1611.00755\u0022\u003EAlmost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs\u0026nbsp;\u003C\/a\u003E\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- Michael B. Cohen (MIT), Jonathan Kelner (MIT), \u0026nbsp;John Peebles (MIT), Richard Peng (GT), Anup Rao (GT), Aaron Sidford (Stanford), and Adrian Vladu (MIT).\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1611.07451\u0022\u003ESampling Random Spanning Trees Faster than Matrix Multiplication\u0026nbsp;\u0026nbsp; \u003C\/a\u003E\u003Cbr \/\u003E\r\n\t\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- David Durfee (GT), Rasmus Kyng (Yale),\u0026nbsp;John Peebles (MIT), Anup B. Rao (GT), and Sushant Sachdeva (Google).\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":" ARC has 4 papers in upcoming STOC \u002717"}],"uid":"32895","created_gmt":"2017-02-24 20:58:29","changed_gmt":"2017-09-18 12:22:13","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-10-01T00:00:00-04:00","iso_date":"2016-10-01T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"595847":{"#nid":"595847","#data":{"type":"news","title":"ARC 10 featuring Jon Kleinberg (Cornell)","body":[{"value":"\u003Ch3\u003E\u003Cstrong\u003EARC10:\u0026nbsp;\u003C\/strong\u003ESpecial event celebrating the 10\u003Csup\u003Eth\u003C\/sup\u003E\u0026nbsp;anniversary of GT\u0026#39;s\u0026nbsp;Algorithms and Randomness Center, featuring Nevanlinna Prize winner Jon Kleinberg (Cornell University).\u003C\/h3\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EOctober 24, 2016.\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/node\/113\u0022\u003E\u003Cstrong\u003EThe program for the event is available here.\u003C\/strong\u003E\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Special event celebrating the 10-year anniversary of ARC (October 24, 2016)"}],"uid":"32895","created_gmt":"2017-09-13 13:57:17","changed_gmt":"2017-09-13 14:04:41","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-10-24T00:00:00-04:00","iso_date":"2016-10-24T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"595845":{"#nid":"595845","#data":{"type":"news","title":"Blum Doubleheader Distinguished Lectures: Oct. 27, 2016","body":[{"value":"\u003Ch3 align=\u0022center\u0022\u003E\u003Cstrong\u003ESpecial event featuring a pair of distinguished lectures\u003C\/strong\u003E\u003C\/h3\u003E\r\n\r\n\u003Ch3 align=\u0022center\u0022\u003E\u003Cstrong\u003ESponsored by ARC, GTISC, and CoC\u003C\/strong\u003E\u003C\/h3\u003E\r\n\r\n\u003Ch3 align=\u0022center\u0022\u003E\u003Cstrong\u003EThursday, October 27, 2016\u003C\/strong\u003E\u003C\/h3\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003E11 am: ARC-IISP Distinguished Lecture by\u0026nbsp;Manuel Blum \u003C\/strong\u003E(Klaus 1443)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; Turing Award winner Manuel Blum will lecture on: \u0026nbsp; \u0026nbsp; \u0026nbsp;\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\u0026nbsp;Human Computation with an Application to Passwords\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\u003C\/strong\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/hg\/item\/582188\u0022\u003E\u003Cstrong\u003EAbstract and further talk information is available here\u003C\/strong\u003E\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003E5pm: John P. Imlay Distinguished Lecture by\u0026nbsp;Lenore Blum \u003C\/strong\u003E(Howey Physics L4)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; CMU Distinguished Professor Lenore Blum will lecture on:\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\u003Cstrong\u003EAlan Turing and the Other Theory of Computing\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\u003C\/strong\u003E\u003Cstrong\u003E\u003Ca href=\u0022http:\/\/arc.gatech.edu\/hg\/item\/581835\u0022\u003EAbstract and further talk information is available here\u003C\/a\u003E\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Special event featuring Turing Award winner Manuel Blum and CMU Distinguished Professor Lenore Blum"}],"uid":"32895","created_gmt":"2017-09-13 13:52:48","changed_gmt":"2017-09-13 13:52:48","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-10-27T00:00:00-04:00","iso_date":"2016-10-27T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"560701":{"#nid":"560701","#data":{"type":"news","title":"ARC Fellowship Winners for Fall 2016 ","body":[{"value":"\u003Cp\u003EARC is delighted to announce that 5 fellowships were awarded to PhD students in CS and ISyE for the Fall 2016 semester:\u003C\/p\u003E\r\n\r\n\u003Cul\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EDavid Durfee\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(ACO PhD, CS), advisor:\u0026nbsp;Richard Peng\r\n\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EVertex Elimination Techniques and their Applications to Graph Algorithms\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EEzgi Karabulut\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(OR PhD, ISyE), advisors:\u0026nbsp;Shabbir Ahmed and\u0026nbsp;George Nemhauser\u0026nbsp;\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u003Cem\u003E\u0026nbsp;Auction Algorithms for Distributed Integer Programming\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003EKevin Lai\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(ACO PhD, CS), advisor: Santosh Vempala\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EParameter Estimation for Mixtures of Gaussians with Adversarial Noise\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003ETung Mai\u0026nbsp;\u003C\/em\u003E\u003C\/strong\u003E(ACO PhD, CS), advisor: Vijay Vazirani\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EApproximating the Non-symmetric Nash Social Welfare\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\t\u003Cli\u003E\u0026nbsp;\u003Cstrong\u003E\u003Cem\u003ETianxin Tang\u003C\/em\u003E\u003C\/strong\u003E\u0026nbsp;(CS PhD, CS), advisor: Alexandra Boldyreva\r\n\t\u003Cul\u003E\r\n\t\t\u003Cli\u003EProject title:\u0026nbsp;\u003Cem\u003EKeyless Fuzzy Search on Encrypted Data\u003C\/em\u003E\u003C\/li\u003E\r\n\t\u003C\/ul\u003E\r\n\t\u003C\/li\u003E\r\n\u003C\/ul\u003E\r\n\r\n\u003Cp\u003EThanks to the generosity of \u003Ca href=\u0022https:\/\/iisp.gatech.edu\u0022\u003EIISP\u003C\/a\u003E, Tang\u0026#39;s award was a joint GTISC-ARC fellowship.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003E5 PhD students awarded fall fellowships\u003C\/p\u003E\r\n","format":"limited_html"}],"field_summary_sentence":[{"value":"5 PhD students were awarded fellowships"}],"uid":"32895","created_gmt":"2016-08-09 13:52:57","changed_gmt":"2016-12-30 07:44:55","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-08-09T00:00:00-04:00","iso_date":"2016-08-09T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EEric Vigoda\u003C\/p\u003E\r\n","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"565371":{"#nid":"565371","#data":{"type":"news","title":"Sadra Yazdanbod wins a 2016 Google Fellowship","body":[{"value":"\u003Cp\u003EACO student Sadra Yazdanbod is one of the 39 recipients of a \u003Ca href=\u0022http:\/\/googleresearch.blogspot.com\/2016\/03\/announcing-2016-google-phd-fellows-for.html\u0022 target=\u0022_blank\u0022\u003E 2016 Google Fellowship for North America, Europe and the Middle East\u003C\/a\u003E. Sadra\u0027s advisor is Vijay Vazirani and Sadra was one of the four winners in the area of Market Algorithms. The award is for two years with a possible extension to a third year.\u003C\/p\u003E\u003Cp\u003EGoogle created the PhD Fellowship program in 2009 to recognize and support outstanding graduate students doing exceptional research in Computer Science and related disciplines. Now in its eighth year, their fellowship program has supported hundreds of future faculty, industry researchers, innovators and entrepreneurs.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"2016 Google Fellowship Awarded to Sadra Yazdanbod"}],"uid":"27466","created_gmt":"2016-08-19 09:30:13","changed_gmt":"2016-10-08 03:22:23","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-08-19T00:00:00-04:00","iso_date":"2016-08-19T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"related_links":[{"url":"https:\/\/research.googleblog.com\/2016\/03\/announcing-2016-google-phd-fellows-for.html","title":"2016 Google Fellowship for North America, Europe and the Middle East."}],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"42911","name":"Education"}],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"},{"id":"172279","name":"Market Algorithms"}],"core_research_areas":[{"id":"39431","name":"Data Engineering and Science"},{"id":"39501","name":"People and Technology"}],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003C\/p\u003E\u003Cp\u003Edenton at cc dot gatech dot edu\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"565411":{"#nid":"565411","#data":{"type":"news","title":"ARC has 5 papers in top algorithms conference FOCS","body":[{"value":"\u003Cp\u003EGeorgia Tech faculty, postdocs, and students had 5 papers accepted to appear at the upcoming \u003Cem\u003E\u003Ca href=\u0022http:\/\/dimacs.rutgers.edu\/FOCS16\/\u0022\u003E57th Annual Symposium on Foundations of Computer Science\u003C\/a\u003E (FOCS)\u003C\/em\u003E conference in New Brunswick, New Jersey from October 9-11, 2016. \u0026nbsp;FOCS (together with\u0026nbsp;\u003Cem\u003ESTOC\u0026nbsp;\u003C\/em\u003Ewhich occurs in the spring) are the premier venues for publishing algorithms research. \u0026nbsp;\u003C\/p\u003E\u003Cp\u003EThe authors included ACO Ph.D. students David Durfee and Kevin Lai, ARC Postdoctoral Fellows Charilaos Efthymiou and Anup Rao, and ARC Professors Richard Peng, Santosh Vempala, and Eric Vigoda. \u0026nbsp;In addition, Anand Louis is a recent graduate from Georgia Tech with an ACO PhD, and is now a postdoc at Princeton University.\u003C\/p\u003E\u003Cp\u003EThe five \u003Cem\u003EFOCS\u0026nbsp;\u003C\/em\u003Epapers are the following:\u0026nbsp;\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003E \u003Ca href=\u0022http:\/\/arxiv.org\/abs\/1511.03186\u0022\u003EAccelerated Newton Iteration for Roots of Black Box Polynomials\u003C\/a\u003E\u003C\/em\u003E\u003C\/strong\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- Anand Louis (Princeton) and\u0026nbsp;Santosh Vempala (Georgia Tech).\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003E\u003Ca href=\u0022http:\/\/arxiv.org\/abs\/1604.06968\u0022\u003EAgnostic Estimation of Mean and Covariance\u003C\/a\u003E\u003C\/em\u003E\u003C\/strong\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; - Kevin Lai (Georgia Tech), Anup Rao (Georgia Tech), and Santosh Vempala (Georgia Tech).\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1604.01422\u0022\u003EConvergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model\u003C\/a\u003E\u0026nbsp;\u0026nbsp;\u003C\/em\u003E\u003C\/strong\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; - Charilaos Efthymiou (Georgia Tech), Thomas P. Hayes (New Mexico), Daniel Stefankovic (University of Rochester),\u0026nbsp;Eric Vigoda (Georgia Tech), and Yitong Yin (Nanjing University).\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1608.03270\u0022\u003E\u003Cstrong\u003E\u003Cem\u003EFaster\u003C\/em\u003E\u003C\/strong\u003E\u003Cstrong\u003E\u003Cem\u003E\u0026nbsp;Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More\u003C\/em\u003E\u003C\/strong\u003E\u003C\/a\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- Michael B. Cohen (MIT), Jonathan Kelner (MIT), \u0026nbsp;John Peebles (MIT), Richard Peng (Georgia Tech),\u0026nbsp;Aaron Sidford (Microsoft), and Adrian Vladu (MIT).\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Cstrong\u003E\u003Cem\u003E\u003Ca href=\u0022https:\/\/arxiv.org\/abs\/1604.02094\u0022\u003EOn Fully Dynamic Graph Sparsifiers\u003C\/a\u003E\u0026nbsp; \u0026nbsp;\u003C\/em\u003E\u003C\/strong\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;- Ittai Abraham (VMware),\u0026nbsp;David Durfee (Georgia Tech), Ioannis Koutis (Puerto Rico),\u0026nbsp;Sebastian Krinninger (Max Planck), and\u0026nbsp;Richard Peng (Georgia Tech).\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u0026nbsp;","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"5 papers accepted to FOCS \u002716"}],"uid":"32895","created_gmt":"2016-08-19 11:49:05","changed_gmt":"2016-10-08 03:22:04","author":"Eric Vigoda","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2016-08-19T00:00:00-04:00","iso_date":"2016-08-19T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EEric Vigoda\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"484641":{"#nid":"484641","#data":{"type":"news","title":"Georgia Tech Team Wins Gold in International Open Source Competition","body":[{"value":"\u003Cp\u003EA healthcare system for developing countries designed at Georgia Tech recently won the Gold Prize in the 2015 Open Source Software World Challenge.\u003C\/p\u003E\u003Cp\u003EHosted annually by the Republic of Korea\u2019s Ministry of ICT and Future Planning, the Open Source Software World Challenge promotes software development and the expansion of international exchanges amongst developers. Georgia Tech\u2019s Computing for Good Basic Laboratory Information System (C4G BLIS) received the Gold Prize and $5,000 in prize money.\u003C\/p\u003E\u003Cp\u003EC4G BLIS is open-source software used to track patient specimens and laboratory results. It replaces paper records, resulting in a sustainable, more efficient and more accountable process that also tracks workflow and generates customizable reports. More than 60 healthcare facilities or hospitals use it in Africa today.\u003C\/p\u003E\u003Cp\u003EDistinguished Professor Santosh Vempala (CS) developed C4G BLIS in collaboration with the International Laboratory Branch of the U.S. Centers for Disease Control to address persistent health care challenges in sub-Saharan Africa, partly as a research project in the College of Computing\u2019s C4G course in 2010 and 2012. C4G BLIS launched in 2010 in Cameroon and has since expanded into Uganda, Tanzania, Ghana, the Democratic Republic of Congo, and Kenya.\u003C\/p\u003E\u003Cp\u003E\u201cUser satisfaction is high, error rates are down, workloads are lower (hence more patients can be served) and hospital revenues are up,\u201d Vempala said.\u0026nbsp;\u003C\/p\u003E\u003Cp\u003EC4G BLIS has undergone more than 70 revisions since its launch with students handling the updates, Vempala said. Alumnus Aishwarya Rajagopal, MS CS \u201915, is still working on C4G BLIS and says it has been an extraordinary experience.\u003C\/p\u003E\u003Cp\u003E\u201cThe system is continuously evolving and there have been many challenging tasks in the last one year,\u201d Rajagopal said. \u201cComing through these and having a release rolled out is a great feeling. The idea that something I do touches the lives of people in another continent thoroughly excites me.\u201d\u003C\/p\u003E\u003Cp\u003EC4G BLIS continues to evolve based on user feedback, and other developers are joining in, from Kenya and Ghana most recently, as it is open-source software.\u003C\/p\u003E\u003Cp\u003E\u201cTo be sustainable in the long term, the development of a system like C4G BLIS has to be collaborative, involving all its stakeholder and local IT expertise,\u201d Vempala said. \u201cOpen source is the only way to go.\u201d\u003C\/p\u003E\u003Cp\u003EChallenges remain, but with expanding deployment throughout Africa and international recognition for C4G BLIS, the future is bright.\u003C\/p\u003E\u003Cp\u003E\u201cSustainable progress is hard to be certain of,\u201d Vempala said. \u201cBut with a collaborative and ultra-configurable design, and a talent pool of inspired students, we appear to be meeting the diverse needs of hospital laboratories in Africa; so far, so good.\u201d\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"A healthcare system for developing countries designed at Georgia Tech recently won the Gold Prize in the 2015 Open Source Software World Challenge."}],"uid":"27466","created_gmt":"2016-01-11 17:42:42","changed_gmt":"2016-10-08 03:20:24","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2015-12-14T00:00:00-05:00","iso_date":"2015-12-14T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"478291":{"id":"478291","type":"image","title":"C4G BLIS","body":null,"created":"1450285200","gmt_created":"2015-12-16 17:00:00","changed":"1475895230","gmt_changed":"2016-10-08 02:53:50","alt":"C4G BLIS","file":{"fid":"204128","name":"blis_image.jpeg","image_path":"\/sites\/default\/files\/images\/blis_image_0.jpeg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/blis_image_0.jpeg","mime":"image\/jpeg","size":81966,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/blis_image_0.jpeg?itok=t2jb2qS-"}}},"media_ids":["478291"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"171534","name":"Aishwarya Rajagopal"},{"id":"171535","name":"C4G BLIS"},{"id":"171536","name":"Open Source Software World Challenge"},{"id":"167405","name":"santosh vempala"},{"id":"166941","name":"School of Computer Science"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003E\u003Ca href=\u0022mailto:tsharp@cc.gatech.edu\u0022\u003ETyler Sharp\u003C\/a\u003E\u003Cbr \/\u003EPR\/Social Media Officer\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"484701":{"#nid":"484701","#data":{"type":"news","title":"Randall Picked to Lead Algorithms and Randomness Center","body":[{"value":"\u003Cp class=\u0022p1\u0022\u003ETo ensure a smooth transition of leadership of one of its most important research programs, the School of Computer Science has selected \u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/dana-randall\u0022\u003EProfessor Dana Randall\u003C\/a\u003E as the next director of the \u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/\u0022\u003EAlgorithms and Randomness Center (ARC).\u003C\/a\u003E\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003ERandall, the Advance Professor of Computing in the \u003Ca href=\u0022http:\/\/www.scs.gatech.edu\/\u0022\u003ESchool of Computer Science\u003C\/a\u003E, will succeed Professor Prasad Tetali as ARC director. Her appointment becomes effective May 15.\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003EThe center is charged with identifying problems with natural connections to algorithms and randomness. As part of this think tank, professors, researchers and students not only devise, extend and solidify theories of algorithms, they create practical solutions for scientists here at Georgia Tech and around the world.\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u201cARC has transformed research in algorithms and randomness at Georgia Tech by building bridges across units and centers, engaging in new industrial collaborations, providing alternative perspectives on projects across the campus, and engaging students and postdoctoral researchers in novel and impactful ways,\u201d Randall said. \u201cThere are many opportunities for strengthening these connections, both internally and externally, as we move forward.\u201d\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003ERandall is a professor of theoretical computer science at Georgia Tech who studies randomized algorithms with her primary research focused on Markov chains. She also holds an adjunct appointment with the School of Mathematics.\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003EShe earned her bachelor\u2019s degree in mathematics from Harvard and her doctorate in computer science from the University of California, Berkeley. She was a Sloan fellow and gave the 2009 AMS Arnold Ross Lecture at the Augusta National Science Center. In 2012, she became an inaugural fellow of the American Mathematical Society.\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u201cWe are extremely excited that Dana has agreed to lead the Algorithms and Randomness Center,\u201d said Lance Fortnow, chair of the School of Computer Science. \u201cNot only is Dana an excellent computer scientist and mathematician, she is an outstanding mentor through her work as the Advance Professor of Computing. We are lucky to have her take this new role.\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003E\u201cDana is a recognized leader in the field of randomized algorithms where she has pioneered work in fast polynomial time algorithms with rigorous and provable performance guarantees,\u201d said Zvi Galil, the dean of the College of Computing. \u201cI am confident that she will effectively lead ARC in exciting and innovative directions.\u201d\u003C\/p\u003E\u003Cp class=\u0022p1\u0022\u003ERandall expressed excitement about her new appointment but noted that past and continued successes at the center rests upon many people.\u003C\/p\u003E\u003Cp class=\u0022p3\u0022\u003E\u0026nbsp;\u201cWe owe much gratitude to the founding ARC directors, Santosh Vempala and Prasad Tetali, for their excellent leadership and boundless energy, as well as the countless faculty and students who continue to contribute to the center\u0027s success,\u201d she said.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"To ensure a smooth transition of leadership of one of its most important research programs, the School of Computer Science has selected Professor Dana Randall as the next director of the Algorithms and Randomness Center (ARC)."}],"uid":"27466","created_gmt":"2016-01-11 18:19:36","changed_gmt":"2016-10-08 03:20:24","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2014-04-28T00:00:00-04:00","iso_date":"2014-04-28T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"71775":{"id":"71775","type":"image","title":"Dana Randall - Profile","body":null,"created":"1449177405","gmt_created":"2015-12-03 21:16:45","changed":"1475894642","gmt_changed":"2016-10-08 02:44:02","alt":"Dana Randall - Profile","file":{"fid":"193601","name":"dana_randall_web.png","image_path":"\/sites\/default\/files\/images\/dana_randall_web_0.png","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/dana_randall_web_0.png","mime":"image\/png","size":35835,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/dana_randall_web_0.png?itok=2qz6lkXN"}}},"media_ids":["71775"],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"153","name":"Computer Science\/Information Technology and Security"},{"id":"143","name":"Digital Media and Entertainment"}],"keywords":[{"id":"92341","name":"Algorithms and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"10467","name":"Dana Randall"},{"id":"12708","name":"prasad tetali"},{"id":"114601","name":"Press Release"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EPhillip Taylor\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:ptaylor@cc.gatech.edu\u0022\u003Eptaylor@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":["ptaylor@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"484711":{"#nid":"484711","#data":{"type":"news","title":"Six Computing Faculty Earn GT Teaching Awards","body":[{"value":"\u003Cp\u003ESix College of Computing professors have earned the Class of 1940 Course Survey Teaching Effectiveness Award for instructional excellence from the Georgia Tech Center for the Enhancement of Teaching and Learning (CETL).\u003C\/p\u003E\u003Cp\u003EThey are:\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/mostafa-ammar\u0022\u003EProfessor Mostafa Anmar\u003C\/a\u003E, School of Computer Science\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/thomas-conte\u0022\u003EProfessor Tom Conte\u003C\/a\u003E, School of Computer Science\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/ashok-goel\u0022\u003EProfessor Ashok Goel\u003C\/a\u003E, School of Interactive Computing\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/dana-randall\u0022\u003EProfessor Dana Randall\u003C\/a\u003E, School of Computer Science\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/jay-summet\u0022\u003ELecturer Jay Summet\u003C\/a\u003E, Division of Computing Instruction\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/people\/greg-turk\u0022\u003EProfessor Greg Turk\u003C\/a\u003E, School of Interactive Computing\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003EThe Class of 1940 Award is given annually to honor teachers with exceptional response rates and scores on the Course-Instructor Opinion Survey (CIOS). Current award recipients were evaluated during the Fall 2013 and Spring 2014 semesters. Recipients must have had a class response rate of at least 85 percent along with near-perfect evaluation scores of teaching effectiveness. Fewer than 40 teachers across Georgia Tech receive the award annually.\u003C\/p\u003E\u003Cp\u003EAll recipients will be formally honored in March at CETL\u2019s annual Celebrating Teaching Day.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Six College of Computing professors have earned the Class of 1940 Course Survey Teaching Effectiveness Award for instructional excellence from the Georgia Tech Center for the Enhancement of Teaching and Learning (CETL)."}],"uid":"27466","created_gmt":"2016-01-11 18:25:45","changed_gmt":"2016-10-08 03:20:24","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2014-12-18T00:00:00-05:00","iso_date":"2014-12-18T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"112431","name":"ashok goel"},{"id":"10467","name":"Dana Randall"},{"id":"37781","name":"Greg Turk"},{"id":"112881","name":"jay summet"},{"id":"112871","name":"mostafa anmar"},{"id":"112861","name":"teaching excellence awards"},{"id":"10466","name":"tom conte"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003ETyler Sharp\u003C\/p\u003E\u003Cp\u003EPR and Social Media Officer\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:tsharp@cc.gatech.edu\u0022\u003Etsharp@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":["tsharp@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"462391":{"#nid":"462391","#data":{"type":"news","title":"ARC Postdoc Position at Georgia Tech","body":[{"value":"\u003Cp\u003EThe Algorithms, Randomness and Complexity (ARC) Center at Georgia Tech \u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/\u0022 target=\u0022_blank\u0022\u003Ehttp:\/\/www.arc.gatech.edu\/\u003C\/a\u003E\u0026nbsp; is seeking a postdoctoral fellow to participate in research investigations.\u0026nbsp; Candidates with a PhD in Computer Science, Mathematics, Operations Research or a related field are encouraged to apply. The selected candidate will have the opportunity to work on any aspect of algorithms and complexity, broadly interpreted, and collaborate with ARC faculty.\u003C\/p\u003E\u003Cp\u003EThe position is for up to two years, with a start date between July 1 and September 1, 2016. There is no teaching requirement, but the postdoc is encouraged to lead a research seminar. Interested candidates should send a CV, research statement, and request 3 letters of recommendation be sent to:\u0026nbsp; \u003Ca href=\u0022mailto:arc-postdoc@cc.gatech.edu\u0022 target=\u0022_blank\u0022\u003Earc-postdoc@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\u003Cp\u003EApplications should be received by December 10, 2015 for full consideration.\u0026nbsp; URL: \u003Ca href=\u0022http:\/\/arc.gatech.edu\/hg\/item\/462391\u0022\u003Ehttp:\/\/arc.gatech.edu\/hg\/item\/462391\u003C\/a\u003E\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe Algorithms, Randomness and Complexity (ARC) Center at Georgia Tech \u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/\u0022 target=\u0022_blank\u0022\u003Ehttp:\/\/www.arc.gatech.edu\/\u003C\/a\u003E\u0026nbsp; is seeking a postdoctoral fellow to participate in research investigations.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"Deadline date is Dec. 10, 2015"}],"uid":"27466","created_gmt":"2015-10-26 10:40:14","changed_gmt":"2016-10-08 03:19:51","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2015-10-26T00:00:00-04:00","iso_date":"2015-10-26T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"related_links":[{"url":"http:\/\/www.arc.gatech.edu\/","title":"Algorithms \u0026 Randomness Center (ARC)"}],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"153","name":"Computer Science\/Information Technology and Security"}],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"},{"id":"145691","name":"Postdoc Position"}],"core_research_areas":[{"id":"39431","name":"Data Engineering and Science"},{"id":"39501","name":"People and Technology"}],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003Cbr \/\u003ECollege of Computing, School of Computer Science at Georgia Tech\u003Cbr \/\u003E266 Ferst Drive, NW\u003Cbr \/\u003EAtlanta, GA 30135-0765\u003C\/p\u003E\u003Cp\u003EOffice: 404-385-6440\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:arc-postdoc@cc.gatech.edu\u0022\u003Earc-postdoc@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":["arc-postdoc@cc.gateh.edu"],"slides":[],"orientation":[],"userdata":""}},"452141":{"#nid":"452141","#data":{"type":"news","title":"CS Students Outperform in Race for \u2018World\u2019s Smartest Trophy\u2019","body":[{"value":"\u003Cp\u003EComputer science students from Georgia Tech\u2019s College of Computing finished 15\u003Csup\u003Eth\u003C\/sup\u003E among 128 international teams in the ACM International Collegiate Programming Contest Finals, held this week in Morocco.\u003C\/p\u003E\u003Cp\u003EIt is a triumphant finish in a challenging competition often referred to as the \u201cWorld\u2019s Smartest Trophy.\u201d The contest asks teams to solve complex algorithms in less than five hours on a single computer. It was a race against the clock in a battle of logic, strategy and mental endurance.\u003C\/p\u003E\u003Cp\u003ECompeting for Georgia Tech were \u003Cstrong\u003EZhongtian Jiang\u003C\/strong\u003E and \u003Cstrong\u003EYijie Wang\u003C\/strong\u003E, undergraduates in computer science, and \u003Cstrong\u003EHanjun Dai\u003C\/strong\u003E, masters student in computer science. They were led by coach \u003Cstrong\u003EBen Cousins\u003C\/strong\u003E, a PhD candidate in algorithms, combinatorics and optimization. The team was joined by \u003Cstrong\u003ETroy Peace \u003C\/strong\u003Eand \u003Cstrong\u003EAlyshia Jackson\u003C\/strong\u003E\u0026nbsp;from the Office of Outreach, Enrollment and Community.\u003C\/p\u003E\u003Cp\u003E\u201cWe are so proud of this team and their tremendous advancement in an incredibly difficult competition,\u201d said Dean \u003Cstrong\u003EZvi Galil\u003C\/strong\u003E. \u201cThis was Georgia Tech\u2019s best performance in a decade and it is further evidence of the passion for problem solving that our students hold.\u201d\u003C\/p\u003E\u003Cp\u003EGetting to the world finals in Marrakech came with its own pressure. Georgia Tech competed in regional North American contests to advance. In all, more than 38,160 students from 2,534 universities in 101 countries across six continents sought to reach the world finals. Few did, and the competition in Morocco represented the best of the best.\u003C\/p\u003E\u003Cp\u003EThe final results left Georgia Tech tied with Carnegie Mellon, Harvard University, University of California at Los Angeles and University of Southern California. Only two other teams from North America performed better -- Massachusetts Institute of Technology and University of California at Berkeley. Harvard was the last North American team to crack into the top 10 in 2012. Georgia Tech received honorable mentions in 2012, 2008, 2006 and 2005.\u003C\/p\u003E\u003Cp\u003EThe top 12 teams in 2015 received medals.\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003ESt. Petersburg National Research University of IT, Mechanics and Optics (GOLD, 2015 WORLD CHAMPION)\u003C\/li\u003E\u003Cli\u003EMoscow State University (GOLD, 2\u003Csup\u003End\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EThe University of Tokyo (GOLD, 3\u003Csup\u003Erd\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003ETsinghua University (GOLD, 4\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EPeking University (SILVER, 5\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EUniversity of California at Berkeley (SILVER, 6\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EUniversity of Zagreb (SILVER, 7\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003ECharles University in Prague (SILVER, 8\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EShanghai Jiao Tong University (BRONZE, 9\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EMassachusetts Institute of Technology (BRONZE, 10\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003Cli\u003EKorea University (BRONZE, 11\u003Csup\u003Eth\u003C\/sup\u003E, Place)\u003C\/li\u003E\u003Cli\u003EUniversity of Warsaw (BRONZE, 12\u003Csup\u003Eth\u003C\/sup\u003E Place)\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003EFor a full list of teams, visit:\u0026nbsp;\u003Ca href=\u0022http:\/\/icpc.baylor.edu\/worldfinals\/teams\u0022\u003Ehttp:\/\/icpc.baylor.edu\/worldfinals\/teams\u003C\/a\u003E.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Computer science students from Georgia Tech\u2019s College of Computing finished 15th among 128 international teams in the ACM International Collegiate Programming Contest Finals, held this week in Morocco."}],"uid":"27466","created_gmt":"2015-09-25 09:02:41","changed_gmt":"2016-10-08 03:19:36","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2015-05-21T00:00:00-04:00","iso_date":"2015-05-21T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"406581":{"id":"406581","type":"image","title":"Morocco team 2015","body":null,"created":"1449254153","gmt_created":"2015-12-04 18:35:53","changed":"1475895122","gmt_changed":"2016-10-08 02:52:02","alt":"Morocco team 2015","file":{"fid":"76142","name":"morocco_682.jpeg","image_path":"\/sites\/default\/files\/images\/morocco_682.jpeg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/morocco_682.jpeg","mime":"image\/jpeg","size":1030128,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/morocco_682.jpeg?itok=cgNsJrxB"}}},"media_ids":["406581"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"3047","name":"ACM"},{"id":"126701","name":"International Collegiate Programming Competition"},{"id":"126691","name":"Morocco"}],"core_research_areas":[{"id":"39431","name":"Data Engineering and Science"},{"id":"39501","name":"People and Technology"}],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003ETara La Bouff\u003Cbr \/\u003ECommunications Manager\u003Cbr \/\u003E\u003Ca href=\u0022mailto:tlabouff@cc.gatech.edu\u0022\u003Etlabouff@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"359691":{"#nid":"359691","#data":{"type":"news","title":"AJC Article on Dick Lipton","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003EIf your doctor diagnoses your malady by ordering an MRI, a tiny smidgen of the credit may be due to Richard Lipton. If you use the \u201cpeople you may know\u201d function to expand your LinkedIn network, theorems Lipton developed may be lurking somewhere deep, deep in the background.\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022http:\/\/www.myajc.com\/news\/news\/local\/like-a-kardashian-only-for-geeks\/njZL2\/?icmp=ajc_internallink_invitationbox_apr2013_ajcstubtomyajcpremium#9311f650.3901895.735596\u0022\u003Ehttp:\/\/www.myajc.com\/news\/news\/local\/like-a-kardashian-only-for-geeks\/njZL2\/?icmp=ajc_internallink_invitationbox_apr2013_ajcstubtomyajcpremium#9311f650.3901895.735596\u003C\/a\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":[{"value":"Like a Kardashian, only for geeks"}],"field_summary":[{"value":"\u003Cp\u003EIf your doctor diagnoses your malady by ordering an MRI, a tiny smidgen of the credit may be due to Richard Lipton. If you use the \u201cpeople you may know\u201d function to expand your LinkedIn network, theorems Lipton developed may be lurking somewhere deep, deep in the background.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"The AJC highlights the many contributions made to the field of computer science by Professor Richard Lipton, from the School of Computer Science."}],"uid":"27466","created_gmt":"2014-12-31 16:12:19","changed_gmt":"2016-10-08 03:17:37","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2014-12-31T00:00:00-05:00","iso_date":"2014-12-31T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"related_links":[{"url":"http:\/\/www.myajc.com\/news\/news\/local\/like-a-kardashian-only-for-geeks\/njZL2\/?icmp=ajc_internallink_invitationbox_apr2013_ajcstubtomyajcpremium#7b1af48e.3573201.735596","title":"Atlanta Journal Constitution - Dick Lipton article"},{"url":"http:\/\/www.arc.gatech.edu\/","title":"Algorithms \u0026 Randomness Center (ARC)"}],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"92341","name":"Algorithms and Randomness Center"},{"id":"10477","name":"Dick Lipton"},{"id":"109","name":"Georgia Tech"},{"id":"15711","name":"richard lipton"},{"id":"14673","name":"theory"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003C\/p\u003E\u003Cp\u003Edenton at cc dot gatech dot edu\u003C\/p\u003E","format":"limited_html"}],"email":["denton@cc.gatech.edu"],"slides":[],"orientation":[],"userdata":""}},"261561":{"#nid":"261561","#data":{"type":"news","title":"ARC Student Fellowship Winners - Spring 2014","body":[{"value":"\u003Cp\u003EThe ARC Committee consisting of Gregory Blekherman, Math; Santanu Dey (Chair); David Goldberg, ISYE; Alexandra Boldyreva, CS, Nina Balcan, CS and Santosh Vempala, CS announced the winners of ARC Fellowships for spring 2014. Thanks to the committee members for their hard work. Congratulations to the winners and all the best in their research efforts! The recipients, and their advisors, are:\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/Gustavo_Angulo_ARC_Spring%202014_Proposal.pdf\u0022\u003EGustavo Angulo\u003C\/a\u003E, (Advisors : Shabbir Ahmed and Santanu S. Dey, ISYE ) \u201cA polyhedral study of all-different polytopes\u0022\u003C\/li\u003E\u003Cli\u003E\u0026nbsp;\u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/SBackman_ARC_Spring2014Proposal.pdf\u0022\u003ESpencer Backman\u003C\/a\u003E, (Advisor: Matt Baker, Math) \u0022A Complex Valued\u0026nbsp; Hypergraph Laplachain\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/AGalanis_ARCSpring2014Proposal.pdf\u0022\u003EAndreas Galanis\u003C\/a\u003E, (Advisor: Eric Vigoda, CS) \u0022Hardness of Approximately Counting Colorings\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/SaraKrehbiel_ARCSpring2014Proposal.pdf\u0022\u003ESara Krehbiel\u003C\/a\u003E, (Advisor:\u0026nbsp; Chris Peikert, CS) \u0022Paying for Privacy\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/Robert%20Krone_ARCSpring2014Proposal.pdf\u0022\u003ERobert Krone\u003C\/a\u003E, (Advisor: Anton Leykin, ISYE) \u201cAlgorithms for Equivariant Ideals and Varieties\u201d\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/AKMassimino_ARCSpring2014Proposal.pdf\u0022\u003EAndrew Massimino\u003C\/a\u003E, (Advisor:\u0026nbsp; Mark Davenport) \u201cConstrained Adaptive Sensing\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/Sarah%20Miracle_ARCSpring2014Proposal.pdf\u0022\u003ESarah Miracle\u003C\/a\u003E, (Advisor: Dana Randall, CS and Math) \u201cMarkov Chains to Model Segregation and Biased Surfaces\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022\/\/www.arc.gatech.edu\/sites\/arc.gatech.edu\/files\/AurkoRoy_ARCSpring2014Proposal.pdf\u0022\u003EAurko Roy\u003C\/a\u003E, (Advisor: \u0026nbsp;Santosh Vempala CS and ISYE) \u0022Learning a Polytope\u0022\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E \u003Cbr \/\u003E\u003C\/p\u003E\u003Cp\u003E \u003Cbr \/\u003E\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u0026nbsp;\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe ARC Committee consisting of Gregory Blekherman, Math; Santanu Dey (Chair); David Goldberg, ISYE; Alexandra Boldyreva, CS, Nina Balcan, CS and Santosh Vempala, CS announced the winners of ARC Fellowships for spring 2014. \u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"ARC Student Fellowship - Spring 2014"}],"uid":"27263","created_gmt":"2013-12-17 11:06:36","changed_gmt":"2016-10-08 03:15:33","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2013-12-17T00:00:00-05:00","iso_date":"2013-12-17T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"72141","name":"2014"},{"id":"111111","name":"ARC Fellowship Winners"},{"id":"167083","name":"spring"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EPrasad Tetali\u003Cbr \/\u003EDirector, Algorithms\u0026nbsp;Research Center\u0026nbsp;\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"177831":{"#nid":"177831","#data":{"type":"news","title":"ARC Student Fellowship Winners - Spring 2013","body":[{"value":"\u003Cp\u003EThe ARC Student Fellowship Committee consisting of Santosh Vempala, (chair), CS and ISYE, Gregory Blekherman, Math, Santanu Dey, ISYE, David Goldberg, ISYE \u0026nbsp;and Alexandra Boldyreva, CS and\u0026nbsp;Nina Balcan, (CS)\u0026nbsp;announced the winners of ARC Fellowships for\u0026nbsp;Spring 2013. Many thanks to the committee members for their hard work and congratulations to the winners and all the best in their research efforts! The recipients, and their advisors, are:\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/guzman_appl_arc_sp13.pdf\u0022\u003ECrist\u00f3bal Guzm\u00e1n - Advisor - Arkadi Nemirovski, School of ISYE\u0026nbsp;\u0022 A new model for image regularization\u0022\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arc-2013-spring-version-6_chun-hung_liu.pdf\u0022\u003EChun-Hung Liu - Advisor - Robin Thomas, School of Math\u0026nbsp;\u0022Well-quasi-ordering graphs by the immersion relation\u0022\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arcv5_diego_moran.pdf\u0022\u003EDiego Mor\u00e1n - Advisor - Santanu Dey, School of ISYE\u0026nbsp;\u0022On cutting planes for convex mixed-integer programs\u003C\/a\u003E\u0022\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arc-proposal_v_3sp13_ioannispanageas.pdf\u0022\u003EIoannis Panageas - Advisors - \u0026nbsp;Prasad Tetali (Math \u0026amp; CS), Frank Dellaert (IC)\u0026nbsp;\u0022 Preconditioning in non-Laplacian case\u0022\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/linwei_xin_arc_fellowship_proposal.pdf\u0022\u003ELinwei Xin - Advisors - David Goldberg, Alexander Shapiro\u0022Moment Convergence Rate in Stochastic Optimization\u0022\u003C\/a\u003E\u003C\/li\u003E\u003C\/ul\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe ARC Student Fellowship Committee\u0026nbsp;announced the\u0026nbsp;winners of ARC\u0026nbsp;student\u0026nbsp;fellowship for Spring 2013.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"ARC Student Fellowship Winners - Spring 2013"}],"uid":"27263","created_gmt":"2012-12-17 09:29:07","changed_gmt":"2016-10-08 03:13:22","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2012-12-17T00:00:00-05:00","iso_date":"2012-12-17T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"128101","name":"ARC Student Fellowship Winners for Spring 2013"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"161071":{"#nid":"161071","#data":{"type":"news","title":"ARC Student Fellowship Winners - Fall 2012","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003EARC Students Fellowship - Fall 2012\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EThe ARC Committee consisting of Santosh Vempala, (chair), CS and ISYE, Gregory Blekherman, Math, Santanu Dey, ISYE, David Goldberg, ISYE \u0026nbsp;and Dana Randall, CS and Math (Adjunct) announced the winners of ARC Fellowships for Fall 2012. Many thanks to the committee members for their hard work. Congratulations to the winners and all the best in their research efforts! The recipients, and their advisors, are:\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/prateekbhakta_researchproposal_fall_2012.pdf\u0022\u003EPrateek Bhakta, CS\/ACO, (Mentor: Dana Randall, CS and Math)\u0026nbsp; \u201cMixing Times of the Schelling Segregation Model and Biased Permutations\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arindamkhan_arcpropf12pallet.pdf\u0022\u003EArindam Khan, CS, (Mentors: \u0026nbsp;Prof. Prasad Tetali, CS and Math and Prof. Henrik I. Christensen, IC) \u201cAlgorithms for 3-D Geometric Bin Packing\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/anandlouis_arcfall12.pdf\u0022\u003EAnand Louis, CS (Mentor: \u0026nbsp;Prasad Tetali, CS and Math and Prof. Santosh Vempala, CS) \u201cA New Approach Towards Graph Coloring\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/farbod--arc_fall_2012.pdf\u0022\u003EFarbod Shokrieh, CS (Mentor: Matt Baker, Math)\u0026nbsp; \u201cRandom Basis Algorithm\u0026nbsp; for Regular Matroids\u0022\u003C\/a\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe ARC Committee consisting of Santosh Vempala, (chair), CS, Gregory Blekherman, Math, Santanu Dey, ISYE, David Goldberg, ISYE \u0026nbsp;and Dana Randall, CS and Math (Adjunct) announced the winners of ARC Fellowships for Fall 2012.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"ARC Students Fellowships Awarded for Fall 2012"}],"uid":"27263","created_gmt":"2012-10-10 12:11:43","changed_gmt":"2016-10-08 03:12:58","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2012-10-10T00:00:00-04:00","iso_date":"2012-10-10T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"4265","name":"ARC"},{"id":"40851","name":"fall 2012"},{"id":"171231","name":"Student Fellowship Winners"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"107131":{"#nid":"107131","#data":{"type":"news","title":"ARC Student Fellowship Winners - Spring 2012","body":[{"value":"\u003Cp\u003EThe ARC Committee consisting of Ton Dieker (chair), ISYE, Alexandra Boldyreva, CS, Santanu Dey, ISYE, Vladimir Koltchinskii, Math, Milena Mihail, CS and Dana Randall, CS and Math (Adjunct) announced the winners of ARC Fellowships for\u0026nbsp;Spring 2012. Many thanks to the committee members for their work in considering a large pool of competitive applicants. Congratulations to the winners and all the best in their research efforts! The recipients, and their advisors, are:\u003C\/p\u003E\u003Cul\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arc-fellowship-application-spring-2012_karthik.pdf%20\u0022\u003EKarthik Chandrasekaran, CS\/ACO, (Mentor: Santosh Vempala, CS)\u0026nbsp; \u201cThe Complexity of the Cutting Plane Method\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arcfellowshipsp12_natechenette.pdf\u0022\u003ENate Chenette, CS, (Mentor: Sasha Boldyreva, CS) \u201cEfficient Fuzzy-Searchable Encryption\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arcproposal_spring2012_agalanis.pdf\u0022\u003EAndreas Galanis, CS (Mentor: Eric Vigoda, CS) \u201cPhase Transitions in the Complexity of Counting\u201d\u003C\/a\u003E\u003C\/li\u003E\u003Cli\u003E\u003Ca href=\u0022http:\/\/hg.gatech.edu\/sites\/default\/files\/arc-fellowship_spring12_jiajinyu.pdf\u0022\u003EJiajin Yu, CS (Mentor: Ozlem Ergun, ISYE)\u0026nbsp; \u201cAtomic Congestion Games with Taxes on Resources\u201d\u003C\/a\u003E\u003C\/li\u003E\u003C\/ul\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe ARC Committee consisting of Ton Dieker (chair), ISYE, Alexandra Boldyreva, CS, Santanu Dey, ISYE, Vladimir Koltchinskii, Math, Milena Mihail, CS and Dana Randall, CS and Math (Adjunct) announced the winners of ARC Fellowships for\u0026nbsp;Spring 2012.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"ARC Students Fellowships Awarded for Spring 2012"}],"uid":"27263","created_gmt":"2012-02-06 16:47:31","changed_gmt":"2016-10-08 03:11:40","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2011-11-23T00:00:00-05:00","iso_date":"2011-11-23T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"4265","name":"ARC"},{"id":"109","name":"Georgia Tech"},{"id":"171182","name":"Spring 2012"},{"id":"171183","name":"Student Fellowship"},{"id":"61161","name":"winners"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EPrasad Tetali\u003Cbr \/\u003EDirector, Algorithms\u0026nbsp;Research Center\u0026nbsp;\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}},"71281":{"#nid":"71281","#data":{"type":"news","title":"ARC Thematic Years","body":[{"value":"\u003Cp\u003E\u003Cbr \/\u003EThe first of the thematic years spanning Fall 2011 - Dec 2012 will focus on topics at the intersection of Optimization and Computer Science. Besides hosting short and long term visitors, workshops on Integer and Convex Programming and Submodular Optimization are planned. These activities will be coordinated by a committee consisting of Bill Cook, Arkadi Nemirovskii, Santosh Vempala and Eric Vigoda.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EThe first of the thematic years spanning Fall 2011 - Dec 2012\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":"","uid":"27263","created_gmt":"2011-10-14 11:15:22","changed_gmt":"2016-10-08 03:10:26","author":"Elizabeth Ndongi","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2011-10-14T00:00:00-04:00","iso_date":"2011-10-14T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[{"id":"135","name":"Research"}],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EPrasad Tetali\u003Cbr \/\u003EDirector, Algorithms\u0026nbsp;Research Center\u0026nbsp;\u003C\/p\u003E","format":"limited_html"}],"email":["tetali@math.gatech.edu"],"slides":[],"orientation":[],"userdata":""}}}