index.json

[{"authors":null,"categories":null,"content":"Hi there! I\u0026rsquo;m a PhD student at UChicago\u0026rsquo;s CS department advised by Lorenzo. I\u0026rsquo;m broadly interested in topics related to algorithmic spectral graph theory, convex optimization, and applications of statistical physics to the design of algorithms. I also enjoy cooking and various handicraft hobbies. I can make a reasonably mean gumbo.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"92fcbed5ca4d81801e09bf4047f7a78c","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/antares-chen/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/antares-chen/","section":"authors","summary":"Hi there! I\u0026rsquo;m a PhD student at UChicago\u0026rsquo;s CS department advised by Lorenzo. I\u0026rsquo;m broadly interested in topics related to algorithmic spectral graph theory, convex optimization, and applications of statistical physics to the design of algorithms.","tags":null,"title":"Antares Chen","type":"authors"},{"authors":null,"categories":null,"content":"Erasmo joined the University of Chicago in September 2019. Prior to that, he obtained a Master\u0026rsquo;s degree in Computer Science from Boston University. He also graduated at the top of his class with a Master\u0026rsquo;s of Engineering in Mathematics and Computer Science from the University of Bristol, UK, in 2017.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"3bf1d847d334c99470d4d35d77a87171","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/erasmo-tani/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/erasmo-tani/","section":"authors","summary":"Erasmo joined the University of Chicago in September 2019. Prior to that, he obtained a Master\u0026rsquo;s degree in Computer Science from Boston University. He also graduated at the top of his class with a Master\u0026rsquo;s of Engineering in Mathematics and Computer Science from the University of Bristol, UK, in 2017.","tags":null,"title":"Erasmo Tani","type":"authors"},{"authors":null,"categories":null,"content":"Isabella is currently a second-year student at the University of Chicago majoring in Statistics and minoring in Computer Science. She first became involved with the group through UChicago\u0026rsquo;s Center for Data and Computing Summer Lab program, where she worked on implementing statistical algorithms to contribute to a larger manifold learning project.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"e2679308722c51f7d3cc12e7f8a6e872","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/isabella-declue/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/isabella-declue/","section":"authors","summary":"Isabella is currently a second-year student at the University of Chicago majoring in Statistics and minoring in Computer Science. She first became involved with the group through UChicago\u0026rsquo;s Center for Data and Computing Summer Lab program, where she worked on implementing statistical algorithms to contribute to a larger manifold learning project.","tags":null,"title":"Isabella Declue","type":"authors"},{"authors":null,"categories":null,"content":"I am a second year PhD student at the Computer Science Department at the University of Chicago. My advisor is Lorenzo Orecchia. My research interests include algorithms, graphs, Semidefinite Programming and optimization. My undergrad was in the Electrical and Computer Engineering department of the National Technical University of Athens where I completed my thesis on Minimum and Maximum Constraints in the Team Orienteering with Time Windows under the supervision of Dimitris Fotakis and Nikos Vathis.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"659c5d6c569837925e111f986368525b","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/konstantinos-ameranis/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/konstantinos-ameranis/","section":"authors","summary":"I am a second year PhD student at the Computer Science Department at the University of Chicago. My advisor is Lorenzo Orecchia. My research interests include algorithms, graphs, Semidefinite Programming and optimization.","tags":null,"title":"Konstantinos Ameranis","type":"authors"},{"authors":null,"categories":null,"content":"BSc, The University of Hong Kong\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"acacb62bd0416ee9815fa6df8f90a39b","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/lialex-wei/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/lialex-wei/","section":"authors","summary":"BSc, The University of Hong Kong","tags":null,"title":"Li(Alex) Wei","type":"authors"},{"authors":null,"categories":null,"content":"\nMy research work focuses on the design of simple, efficient algorithms for computational problems at the intersection of discrete and continuous optimization. Currently, I am particularly interested into translating well-established mathematical theories from the study of dynamical systems, such as Hamilton-Jacobi Theory, into generic frameworks for algorithm design.\nMy paedagogical philosophy is shaped by seeking variational characterizations for mathematical objects and algorithms\u0026hellip;. thoughts on teaching \u0026hellip; moticate\nVariational problems \u0026hellip;\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"2525497d367e79493fd32b198b28f040","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/lorenzo-orecchia/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/lorenzo-orecchia/","section":"authors","summary":"My research work focuses on the design of simple, efficient algorithms for computational problems at the intersection of discrete and continuous optimization. Currently, I am particularly interested into translating well-established mathematical theories from the study of dynamical systems, such as Hamilton-Jacobi Theory, into generic frameworks for algorithm design.","tags":null,"title":"Lorenzo Orecchia","type":"authors"},{"authors":null,"categories":null,"content":"If I can be in Zelda universe, I would. That being said, I also enjoy playing tennis, reading books and doing math.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"446438ba8197451844e653bea3d76b20","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/ruimin-zhang/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/ruimin-zhang/","section":"authors","summary":"If I can be in Zelda universe, I would. That being said, I also enjoy playing tennis, reading books and doing math.","tags":null,"title":"Ruimin Zhang","type":"authors"},{"authors":null,"categories":null,"content":"Howdy! I am a second-year PhD student in the University of Chicago\u0026rsquo;s Department of Computer Science. I am also a 2019 National Science Foundation Fellow and an avid consumer of caffeinated beverages.\nI earned my BS in Mathematics from the Massachusetts Institute of Technology. At MIT, I had the privilege of doing biomathematical research with the Meyer Lab at the Koch Institute for Integrative Cancer Research and later doing work on sparse neural network topologies with Dr. Jeremy Kepner at MIT Beaver Works.\nMy current research at U Chicago is focused on dimensionality reduction and first-order methods for optimization on manifolds constructed from point clouds using moving least-squares. This work is being done in collaboration with Prof. Lorenzo Orecchia in the Department of Computer Science and Prof. Samantha Riesenfeld in the Pritzker School of Molecular Engineering.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"4333622a8fc68c2c096965c0fa05626f","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/ryan-allen-robinett/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/ryan-allen-robinett/","section":"authors","summary":"Howdy! I am a second-year PhD student in the University of Chicago\u0026rsquo;s Department of Computer Science. I am also a 2019 National Science Foundation Fellow and an avid consumer of caffeinated beverages.","tags":null,"title":"Ryan Allen Robinett","type":"authors"},{"authors":null,"categories":null,"content":"I am a senior undergraduate student at the University of Chicago, and I am completing a joint master degree in CS at the same time. I am fortunate to be advised by Lorenzo Orecchia.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"f7169d6ec38a9f7311b3977bb31bd01d","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/xifan-yu/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/xifan-yu/","section":"authors","summary":"I am a senior undergraduate student at the University of Chicago, and I am completing a joint master degree in CS at the same time. I am fortunate to be advised by Lorenzo Orecchia.","tags":null,"title":"Xifan Yu","type":"authors"},{"authors":null,"categories":null,"content":"I am a fourth-year college student at UChicago majoring in CS and math. I am currently interested in local algorithms on graphs, diffusion processes on graphs, and fast approximation algorithms via convex optimization.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"dbe290e8ef3863659400f96f86b73919","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/yueheng-zhang/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/yueheng-zhang/","section":"authors","summary":"I am a fourth-year college student at UChicago majoring in CS and math. I am currently interested in local algorithms on graphs, diffusion processes on graphs, and fast approximation algorithms via convex optimization.","tags":null,"title":"Yueheng Zhang","type":"authors"},{"authors":null,"categories":null,"content":"I am a first year phd student at Uchicago CS, advised by Prof. Lorenzo Orecchia. Before coming to US, I grew up in Beijing. I completed my bachelor’s degree at Boston University with Summa Cum Laude, majoring in mathematics with a specialization in statistics and a minor in computer science.\n","date":-62135596800,"expirydate":-62135596800,"kind":"term","lang":"en","lastmod":1640572578,"objectID":"03cd0b76870f4b0860811670238b3827","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/author/zixin-ding/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/author/zixin-ding/","section":"authors","summary":"I am a first year phd student at Uchicago CS, advised by Prof. Lorenzo Orecchia. Before coming to US, I grew up in Beijing. I completed my bachelor’s degree at Boston University with Summa Cum Laude, majoring in mathematics with a specialization in statistics and a minor in computer science.","tags":null,"title":"Zixin Ding","type":"authors"},{"authors":null,"categories":null,"content":"Course Description Convex optimization algorithms and their applications to efficiently solving fundamental computational problems. Intended audience is advanced undergraduate students. Topics include modeling using mathematical programs, gradient descent algorithms, linear programming, Lagrangian duality, and applications to algorithm design, machine learning and physics.\nTeaching Staff Lorenzo Orecchia, Instructor. Office Hours: \nKonstantinos Ameranis, Teaching Assistant. Office Hours: \nClass Organization There will be three main means in which content will be delivered to you during the course:\n  Aynchronus mini-lectures: The bulk of the course content will be delivered to you as pre-recorded mini-lectures, which you can watch at your own convenience within a specified time frame (usually 3-5 days after posting). Each mini-lecture will focus on a single concept and, on average, last around 20 minutes. Expect roughly three mini-lectures for each traditional 80-minute lecture block. At the end of each mini-lecture, you will be presented with a small quiz on the material covered. Answers to these quizzes will be recorded.\n  Synchronous Review Sessions: Mon Wed Fri : 13:50-14:40, I will hold review sessions over Zoom. The plan for these interactions is i) to quickly review the material covered in the mini-lecture, highlighting critical concepts, ii) to answer any questions about the material, and iii) to work together on a related exercise or programming activity. Attendance in these review sessions is optional. All sessions will be recorded for those who are not able to attend or choose not to. You are also encouraged to post any questions you would like to have answered in the review session on Canvas under Discussions, especially if you are not attending the session.\n  Synchronous Office Hours: Konstantinos and I will hold Zoom office hours to answer more specific questions.\n  Assigned Work and Grading The final course grade will break down as follows:\n In-course quizzes/participation: 15% Homeworks: 50% Take-home final exam: 35%  QUIZZES: Each mini-lecture will contain a few quiz questions on its material. While the answers will be collected, the purpose of these is mostly to evaluate your participation in the class and to give you quick feedback on your level of understanding. Occasional quizzes may be released outside of mini-lectures at natural places in the course, e.g., the end of a module.\nHOMEWORK: Fortnightly homework assignments to be submitted via Gradescope. Discussion with other students is permitted, but solutions must be individually written.\nFINAL EXAM: Take-home exam. Details TBD.\nATTENDANCE AND PARTICIPATION: Attendance and participation in synchronous events is entirely optional. Office hours and review sessions will be recorded.\nCourse Materials You will need access to the following two textbooks for weekly readings. They are both available online.\n  (CZ): An Introduction to Optimization by Chong and Zak An introductory text for undergraduates. Good for background and introductory topics.\n  (BV) Convex Optimization by Boyd and Vandenberghe A graduate textbook with a broad coverage of advanced topics.\n  There are other textbooks and lecture notes which you may use as references, espcesially for more advanced material:\n Convex Analysis and Nonlinear Optimization: Theory and Examples By Jonathan Borwein, Adrian S. LewisLinks to an external site. A more formal mathematical treatment of convexity. Introductory Lectures on Convex Optimization by Yurii Nesterov A mathematical treatment of first-order methods.  See this page for similar courses at other institutions.\n","date":1614297600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"9e5ef2331ff307db054051f4c43588ed","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cmsc25460/","publishdate":"2021-02-26T00:00:00Z","relpermalink":"/orecchia-githubio/z_teaching/cmsc25460/","section":"z_teaching","summary":"Introduction to Optimization","tags":null,"title":"CMSC 25460 1 (Spring 2021): Introduction to Optimization","type":"z_teaching"},{"authors":null,"categories":null,"content":"STOC 2017 Workshop on User-Friendly Tools from Continuous Optimization on 6/23/2017 [PPT Slides]\n","date":1530144000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"72cb4db13683833896939acc13cbfb4a","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/user-friendly-primal-dual/","publishdate":"2018-06-28T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/user-friendly-primal-dual/","section":"z_talk","summary":"STOC 2017 Workshop on User-Friendly Tools from Continuous Optimization on 6/23/2017 [PPT Slides]","tags":null,"title":"A User-Friendly Primal-Dual View of First Order Methods","type":"z_talk"},{"authors":null,"categories":null,"content":"With Jelena Diakonikolas [ArXiv]\n","date":1527724800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"1a81ef1f6ce8c73f0c763de7e6d627d9","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-acceleration-with-noise-corrupted-gradients/","publishdate":"2018-05-31T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/on-acceleration-with-noise-corrupted-gradients/","section":"z_publicationAll","summary":"With Jelena Diakonikolas. To appear in ICML'18. [[ArXiv]](https://arxiv.org/abs/1805.12591)","tags":null,"title":"On Acceleration with Noise-Corrupted Gradients","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Jelena Diakonikolas [ArXiv]\n","date":1527033600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"bca83eb999014e233d870bbc003e0b74","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/alternating-randomized-block-coordinate-descent-copy/","publishdate":"2018-05-23T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/alternating-randomized-block-coordinate-descent-copy/","section":"z_publicationAll","summary":"With Jelena Diakonikolas. To appear in ICML'18. [[ArXiv]](https://arxiv.org/abs/1805.09185)","tags":null,"title":"Alternating Randomized Block Coordinate Descent","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Cem Aksoylar and Venkatesh Saligrama. [Proceedings]\n","date":1518566400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"0382c297f5baf7055d094b80e14ea575","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/connected-subgraph-detection-with-mirror-descent-on-sdps/","publishdate":"2018-02-14T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/connected-subgraph-detection-with-mirror-descent-on-sdps/","section":"z_publicationAll","summary":"With Cem Aksoylar and Venkatesh Saligrama. ICML’17. [[Proceedings]](http://proceedings.mlr.press/v70/aksoylar17a.html)","tags":null,"title":"Connected Subgraph Detection with Mirror Descent on SDPs","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu. In Mathematical Programming 2018. [Journal]\n","date":1518566400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"4fa6b88088cbcc1681769b089f55c159","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solvers/","publishdate":"2018-02-14T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solvers/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu. In Mathematical Programming 2018. [[Journal]](https://link.springer.com/article/10.1007/s10107-018-1244-x)","tags":null,"title":"Nearly linear-time packing and covering LP solvers","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Jelena Diakonikolas [ArXiv]\n","date":1512604800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"74cdccb4bbab65f70525c86f01f10343","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/the-approximate-duality-gap-technique-a-unified-theory-of-first-order-methods/","publishdate":"2017-12-07T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/the-approximate-duality-gap-technique-a-unified-theory-of-first-order-methods/","section":"z_publicationAll","summary":"With Jelena Diakonikolas. In Submission. [[ArXiv]](https://arxiv.org/abs/1712.02485)","tags":null,"title":"The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Jelena Diakonikolas [ArXiv]\n","date":1508803200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1508803200,"objectID":"a10d601796e09b2d39cde949cf3eb7d8","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/solving-packing-and-covering-lps-in-o1%CE%B52/","publishdate":"2017-10-24T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/solving-packing-and-covering-lps-in-o1%CE%B52/","section":"z_publicationAll","summary":"With Jelena Diakonikolas [[ArXiv]](https://arxiv.org/abs/1710.09002)","tags":null,"title":"Solving Packing and Covering LPs in Õ(1ε2) Distributed Iterations with a Single Algorithm and Simpler Analysis","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Jelena Diakonikolas [ArXiv]\n","date":1497398400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"f038105795d51f1785f2c75698d9fd37","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/accelerated-extra-gradient-descent-a-novel-accelerated-first-order-method/","publishdate":"2017-06-14T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/accelerated-extra-gradient-descent-a-novel-accelerated-first-order-method/","section":"z_publicationAll","summary":"With Jelena Diakonikolas. ITCS'18. [[ArXiv]](https://arxiv.org/abs/1706.04680)","tags":null,"title":"Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu, Aditya Bhaskara, Silvio Lattanzi and Vahab Mirrokni. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1-15, 2016. [ArXiv]\n","date":1445904000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"f2418f6939f4792e45c05a4b52515d1d","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/expanders-using-local-edge-flips/","publishdate":"2015-10-27T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/expanders-using-local-edge-flips/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu, Aditya Bhaskara, Silvio Lattanzi and Vahab Mirrokni. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1-15, 2016. [[ArXiv]](http://arxiv.org/abs/1510.07768)","tags":null,"title":"Expanders Using Local Edge Flips","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu and YinTat Lee. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1824-1831, 2016. [ArXiv]\n","date":1436313600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"f07aaf6f95eec8df5fa05688f85c3f60","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-obtain-a-width-independent-parallel-simpler-and-faster-positive-sdp-solver/","publishdate":"2015-07-08T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/using-optimization-to-obtain-a-width-independent-parallel-simpler-and-faster-positive-sdp-solver/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu and YinTat Lee. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1824-1831, 2016. [[ArXiv]](http://arxiv.org/abs/1507.02259)","tags":null,"title":"Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu and Zhenyu Liao. STOC’15: Proc. Symp. Theory Computing, pp. 237-245, 2015. [ArXiv]\n","date":1434412800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"6a1a5803fb4f0e9e832abbf5cc94709f","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-sized-spectral-sparsification-in-almost-quadratic-time-and-regret-minimization-beyond-matrix-multiplicative-weight-updates/","publishdate":"2015-06-16T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/linear-sized-spectral-sparsification-in-almost-quadratic-time-and-regret-minimization-beyond-matrix-multiplicative-weight-updates/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu and Zhenyu Liao. STOC’15: Proc. Symp. Theory Computing, pp. 237-245, 2015. [[ArXiv]](https://arxiv.org/abs/1506.04838)","tags":null,"title":"Linear-Sized Spectral Sparsification in Almost Quadratic Time and Regret Minimization Beyond Matrix Multiplicative Weight Updates","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu. STOC’15: Proc. Symp. Theory Computing, pp. 229-236, 2015. [ArXiv]\n","date":1415059200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"f6d1c01fe58a7d3582d16b9b5dd973b5","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solver-with-faster-convergence-rate/","publishdate":"2014-11-04T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solver-with-faster-convergence-rate/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu. STOC’15: Proc. Symp. Theory Computing, pp. 229-236, 2015. [[ArXiv]](http://arxiv.org/abs/1411.1124)","tags":null,"title":"Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu. SODA'15: Proc. Symp. Discrete Algorithms, pp.~1439-1456, 2015. [ArXiv] [Proceedings]\n","date":1404777600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"21b3a4820e9c9352034cd57ef584378c","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-break-the-epsilon-barrier-a-faster-and-simpler-width-independent-algorithm-for-solving-positive-linear-programs-in-parallel/","publishdate":"2014-07-08T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/using-optimization-to-break-the-epsilon-barrier-a-faster-and-simpler-width-independent-algorithm-for-solving-positive-linear-programs-in-parallel/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu. SODA'15: Proc. Symp. Discrete Algorithms, pp.~1439-1456, 2015. [[ArXiv]](http://arxiv.org/abs/1407.1925) [[Proceedings]](http://dl.acm.org/citation.cfm?id=2722129.2722224)","tags":null,"title":"Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu. ICML’17. [ArXiv]\n","date":1404604800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"6513920b84ce11b7d78338994802cb3d","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-coupling-an-ultimate-unification-of-gradient-and-mirror-descent/","publishdate":"2014-07-06T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/linear-coupling-an-ultimate-unification-of-gradient-and-mirror-descent/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu. ICML’17. [[ArXiv]](https://arxiv.org/abs/1407.1537)","tags":null,"title":"Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"ICERM Workshop on Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond Workshop on 4/8/2014 [PDF Slides]\n","date":1396915200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"1f4f8bbe60c1615b2d038286879716bd","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/random-walks-as-a-stable/","publishdate":"2014-04-08T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/random-walks-as-a-stable/","section":"z_talk","summary":"ICERM Workshop on Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond Workshop on 4/8/2014 [PDF Slides]","tags":null,"title":"Random Walks as a Stable Analogue of Eigenvectors (with Applications to Nearly-Linear-Time Graph Partitioning)","type":"z_talk"},{"authors":null,"categories":null,"content":"Colloquium talk at the Computer Science Department of Boston University on 3/21/2014 [PDF Slides]\n","date":1395360000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"eb0be8c9f601110ed022ea7d0210a86e","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/almost-linear-time-algorithms/","publishdate":"2014-03-21T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/almost-linear-time-algorithms/","section":"z_talk","summary":"Colloquium talk at the Computer Science Department of Boston University on 3/21/2014 [PDF Slides]","tags":null,"title":"Almost-Linear-Time Algorithms for Fundamental Graph Problems: A New Framework and Its Applications","type":"z_talk"},{"authors":null,"categories":null,"content":"TCS+ Talk on 11/6/2013 [PDF Slides]\n","date":1383696000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"532668dd6a69b00cf906e0410accf248","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-simple-combinatorial-algorithm/","publishdate":"2013-11-06T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/a-simple-combinatorial-algorithm/","section":"z_talk","summary":"TCS+ Talk on 11/6/2013 [PDF Slides]","tags":null,"title":"A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time","type":"z_talk"},{"authors":null,"categories":null,"content":"With Zeyuan Allen-Zhu. SODA’14: Proc. Symp. Discrete Algorithms, pp. 1267–1286, 2014. [ArXiv] [Proceedings]\n","date":1373414400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"42937ca95c0300e2f6d61d23b0beed18","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/flow-based-algorithms-for-local-graph-clustering/","publishdate":"2013-07-10T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/flow-based-algorithms-for-local-graph-clustering/","section":"z_publicationAll","summary":"With Zeyuan Allen-Zhu. SODA’14: Proc. Symp. Discrete Algorithms, pp. 1267–1286, 2014. [[ArXiv]](http://arxiv.org/abs/1307.2855) [[Proceedings]](http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.94)","tags":null,"title":"Flow-Based Algorithms for Local Graph Clustering","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Jonathan A. Kelner, YinTat Lee and Aaron Sidford. SODA’14: Proc. Symp. on Discrete Algorithms, pp. 217–226, 2014. Co-winner of Best Paper Award. [ArXiv] [Proceedings]\n","date":1365379200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"e88c0b3cffafd406848cb15a8a26dd59","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/an-almost-linear-time-algorithm-for-approximate-max-flow-in-undirected-graphs-and-its-multicommodity-generalizations/","publishdate":"2013-04-08T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/an-almost-linear-time-algorithm-for-approximate-max-flow-in-undirected-graphs-and-its-multicommodity-generalizations/","section":"z_publicationAll","summary":"With Jonathan A. Kelner, YinTat Lee and Aaron Sidford. SODA’14: Proc. Symp. on Discrete Algorithms, pp. 217–226, 2014. *Co-winner of Best Paper Award.* [[ArXiv]](http://arxiv.org/abs/1304.2338) [[Proceedings]](http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.16)","tags":null,"title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"MIT TOC Colloquium on 3/19/2013 [PDF Slides]\n","date":1363651200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"d0995a904d7b02c339dda4b6ca0556e6","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-nearly-linear-time-spectral-copy/","publishdate":"2013-03-19T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/a-nearly-linear-time-spectral-copy/","section":"z_talk","summary":"MIT TOC Colloquium on 3/19/2013 [PDF Slides]","tags":null,"title":"A Nearly-linear-time Spectral Algorithm for Balanced Graph Partitioning","type":"z_talk"},{"authors":null,"categories":null,"content":"","date":1363651200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"0757bf4caf5cfafbfc61ecbfb282acec","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cs507/","publishdate":"2013-03-19T00:00:00Z","relpermalink":"/orecchia-githubio/z_teaching/cs507/","section":"z_teaching","summary":"Introduction to Optimization in Computing and Machine Learning","tags":null,"title":"CS 507: Introduction to Optimization in Computing and Machine Learning","type":"z_teaching"},{"authors":null,"categories":null,"content":"With Jonathan A. Kelner, Aaron Sidford and Zeyuan Allen-Zhu. STOC’13: Proc. Symp. Theory Computing, pp. 911–920, 2013. [ArXiv] [Proceedings]\n","date":1359331200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"6abf54cbccebc97420c0ae2a2d14a082","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/","publishdate":"2013-01-28T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/","section":"z_publicationAll","summary":"With Jonathan A. Kelner, Aaron Sidford and Zeyuan Allen-Zhu. STOC’13: Proc. Symp. Theory Computing, pp. 911–920, 2013. [[ArXiv]](http://arxiv.org/abs/1301.6628) [[Proceedings]](http://dl.acm.org/citation.cfm?id=2488724)","tags":null,"title":"A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Sushant Sachdeva and Nisheeth K. Vishnoi. STOC’12: Proc. Symp. Theory Computing, pp. 1141-1160, 2012. [ArXiv] [Conference Version] [Poster]\n","date":1359331200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"bafdc18bf09c6b188703ecdf62d9a296","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/approximating-the-exponential-the-lanczos-method-and-an-tildeom-time-spectral-algorithm-for-balanced-separator/","publishdate":"2013-01-28T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/approximating-the-exponential-the-lanczos-method-and-an-tildeom-time-spectral-algorithm-for-balanced-separator/","section":"z_publicationAll","summary":"With Sushant Sachdeva and Nisheeth K. Vishnoi. STOC’12: Proc. Symp. Theory Computing, pp. 1141-1160, 2012. [[ArXiv]](http://arxiv.org/abs/1111.1491) [Conference Version] [Poster]","tags":null,"title":"Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Smith RP*, Riesenfeld SJ*, Holloway AK, Li Q, Murphy KK, Feliciano NM, Oksenberg N, Pollard KS, Ahituv N (2013). Genome Biology, 2013. In press.\n","date":1356998400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"871d0598fe0f685e4aa5e4cb1ab4211d","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationbio/a-compact-in-vivo-screen-of-all-6-mers-reveals-drivers-of-tissue-specific-expression-and-guides-synthetic-regulatory-element-design./","publishdate":"2013-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationbio/a-compact-in-vivo-screen-of-all-6-mers-reveals-drivers-of-tissue-specific-expression-and-guides-synthetic-regulatory-element-design./","section":"z_publicationBio","summary":"With Smith RP*, Riesenfeld SJ*, Holloway AK, Li Q, Murphy KK, Feliciano NM, Oksenberg N, Pollard KS, Ahituv N (2013). Genome Biology, 2013. In press.","tags":null,"title":"A Compact, In Vivo Screen of All 6-mers Reveals Drivers of Tissue-Specific Expression and Guides Synthetic Regulatory Element Design.","type":"z_publicationBio"},{"authors":null,"categories":null,"content":"With Michael W. Mahoney and Nisheeth K. Vishnoi. J. Machine Learning Research, 13, 2339-2365, 2012. [JMLR Article]\n","date":1327708800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"32284394408c0c596225f4c8d3e3159a","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/implementing-regularization-implicitly-via-approximate-eigenvector-computation/","publishdate":"2012-01-28T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationml/implementing-regularization-implicitly-via-approximate-eigenvector-computation/","section":"z_publicationML","summary":"With Michael W. Mahoney and Nisheeth K. Vishnoi. J. Machine Learning Research, 13, 2339-2365, 2012. [[JMLR Article]](http://jmlr.csail.mit.edu/papers/volume13/mahoney12a/mahoney12a.pdf)","tags":null,"title":"A Spectral Algorithm with Applications to Exploring Data Graphs Locally","type":"z_publicationML"},{"authors":null,"categories":null,"content":"UC Berkeley Dissertation, May 2011. [UC Berkeley Tech Report]\n","date":1304208000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"3de960c3c528b782cec2597721d13500","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/fast-approximation-algorithms-for-graph-partitioning-using-spectral-and-semidefinite-programming-techniques/","publishdate":"2011-05-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/fast-approximation-algorithms-for-graph-partitioning-using-spectral-and-semidefinite-programming-techniques/","section":"z_publicationAll","summary":"UC Berkeley Dissertation, May 2011. [[UC Berkeley Tech Report]](http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-56.html)","tags":null,"title":"Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Nisheeth K. Vishnoi. SODA’11: Proc. Symp. on Discrete Algorithms, pp. 532-545, 2011. [Conference Version] [Soda Talk]\n","date":1287532800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"139caa076d7dc1a907589cdd67a147af","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/towards-an-sdp-based-approach-to-spectral-methods-a-nearly-linear-time-algorithm-for-graph-partitioning-and-decomposition/","publishdate":"2010-10-20T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/towards-an-sdp-based-approach-to-spectral-methods-a-nearly-linear-time-algorithm-for-graph-partitioning-and-decomposition/","section":"z_publicationAll","summary":"With Nisheeth K. Vishnoi. SODA’11: Proc. Symp. on Discrete Algorithms, pp. 532-545, 2011. [[Conference Version]](http://www.siam.org/proceedings/soda/2011/SODA11_042_orecchial.pdf) [Soda Talk]","tags":null,"title":"Towards an SDP-Based Approach to Spectral Methods: A Nearly-Linear Time Algorithm for Graph Partitioning and Decomposition","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Michael W. Mahoney. ICML’11: Proc. 28th Intl. Conf. Machine Learning, pp. 121-128, 2011. [Conference Version] Full Version on ArXiv ICML Talk [ICML Poster]\n","date":1286150400,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"7687aadb90ad9a2207770df41c6a8de0","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/","publishdate":"2010-10-04T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationml/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/","section":"z_publicationML","summary":"With Michael W. Mahoney. ICML’11: Proc. 28th Intl. Conf. Machine Learning, pp. 121-128, 2011. [[Conference Version]](http://www.icml-2011.org/papers/120_icmlpaper.pdf) [Full Version on ArXiv](http://arxiv.org/abs/1010.0703) [ICML Talk](http://techtalks.tv/talks/implementing-regularization-implicitly-via-approximate-eigenvector-computation/54418/) [ICML Poster]","tags":null,"title":"Implementing Regularization Implicitly Via Approximate Eigenvector Computation","type":"z_publicationML"},{"authors":null,"categories":null,"content":"With Kevin J. Lang and Michael W. Mahoney. SEA’09: Proc. Intl. Symp. Experimental Algorithms, pp. 197-208, 2009. [Conference Version]\n","date":1230768000,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"0222bfbedb15abfb8a6b9bcbc29e9002","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/empirical-evaluation-of-graph-partitioning-using-spectral-embeddings-and-flow/","publishdate":"2009-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/empirical-evaluation-of-graph-partitioning-using-spectral-embeddings-and-flow/","section":"z_publicationAll","summary":"With Kevin J. Lang and Michael W. Mahoney. SEA’09: Proc. Intl. Symp. Experimental Algorithms, pp. 197-208, 2009. [[Conference Version]](http://orecchia.scripts.mit.edu/web/files/papers/SEA2009_LangMahoneyOrecchia.pdf)","tags":null,"title":"Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Leonard Schulman, Umesh V. Vazirani, and Nisheeth K. Vishnoi. STOC’08: : Proc. Symp. Theory of Computing, pp. 461-470, 2008. [Conference Version] [STOC Talk]\n","date":1199145600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"40f4343fcf2a02d583a29265b661cbfb","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-partitioning-graphs-via-single-commodity-flows/","publishdate":"2008-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/on-partitioning-graphs-via-single-commodity-flows/","section":"z_publicationAll","summary":"With Leonard Schulman, Umesh V. Vazirani, and Nisheeth K. Vishnoi. STOC’08: : Proc. Symp. Theory of Computing, pp. 461-470, 2008. [Conference Version] [STOC Talk]","tags":null,"title":"On Partitioning Graphs via Single Commodity Flows","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Rohit Khandekar, Subhash A. Khot, and Nisheeth K. Vishnoi. EECS Dept., UC Berkeley, Tech. Rep. UCB/EECS-2007-177, 2007. UC Berkeley Tech Report\n","date":1167609600,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"cb715aa85602627b621ba8e518c82597","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/localized-techniques-for-broadcasting-in-wireless-sensor-networks/","publishdate":"2007-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/localized-techniques-for-broadcasting-in-wireless-sensor-networks/","section":"z_publicationAll","summary":"With Rohit Khandekar, Subhash A. Khot, and Nisheeth K. Vishnoi. EECS Dept., UC Berkeley, Tech. Rep. UCB/EECS-2007-177, 2007. [UC Berkeley Tech Report](http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-177.html)","tags":null,"title":"On a Cut-Matching Game for the Sparsest Cut Problem","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"With Rohit Khandekar, Subhash A. Khot, and Nisheeth K. Vishnoi. EECS Dept., UC Berkeley, Tech. Rep. UCB/EECS-2007-177, 2007. UC Berkeley Tech Report\n","date":1072915200,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"6b2a96286458258c72a3c3424c188bc5","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-a-cut-matching-game-for-the-sparsest-cut-problem/","publishdate":"2004-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_publicationall/on-a-cut-matching-game-for-the-sparsest-cut-problem/","section":"z_publicationAll","summary":"With Devidatt Dubhashi, Olle Häggström, Alessandro Panconesi, Chiara Petrioli, and Andrea Vitaletti. DIALM-POMC Workshop on the Foundations of Mobile Computing, Philadelphia, 2004. [Conference Version] Algorithmica, 49-4, 2007. [Journal Version]","tags":null,"title":"Localized Techniques for Broadcasting in Wireless Sensor Networks","type":"z_publicationAll"},{"authors":null,"categories":null,"content":"","date":-62135596800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"c1d17ff2b20dca0ad6653a3161942b64","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/people/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/people/","section":"","summary":"","tags":null,"title":"","type":"widget_page"},{"authors":null,"categories":null,"content":"","date":-62135596800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"bb238c2d1697da0a6715e7e8c8299cef","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/project/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/project/","section":"","summary":"","tags":null,"title":"","type":"widget_page"},{"authors":null,"categories":null,"content":"","date":-62135596800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"40ea366a28f9524de71378c3212c5489","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/publication/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/publication/","section":"","summary":"","tags":null,"title":"","type":"widget_page"},{"authors":null,"categories":null,"content":"","date":-62135596800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"0d23de87c496bda328fe2234e4594a01","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/talk/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/talk/","section":"","summary":"","tags":null,"title":"","type":"widget_page"},{"authors":null,"categories":null,"content":"Tutorial talk at FOCS’13 Workshop on New Techniques for Flow and Cut Problems [PDF Slides]\n","date":-62135596800,"expirydate":-62135596800,"kind":"page","lang":"en","lastmod":1640572578,"objectID":"969980b7589437ac44d85b3887f57844","permalink":"https://orecchia-research-group.github.io/orecchia-githubio/z_talk/iterative-methods-and-regularization/","publishdate":"0001-01-01T00:00:00Z","relpermalink":"/orecchia-githubio/z_talk/iterative-methods-and-regularization/","section":"z_talk","summary":"Tutorial talk at FOCS’13 Workshop on New Techniques for Flow and Cut Problems [PDF Slides]","tags":null,"title":"Iterative Methods and Regularization in the Design of Fast Algorithms","type":"z_talk"}]