Discrete Algorithms Seminar
نویسندگان
چکیده
1. “An Optimal Online Algorithm for Packet Scheduling with Agreeable Deadlines,” Fei Li, Jay Sethuraman, Clifford Stein, SODA 2005: 801–802, (Fall 2007). 2. “Improved Recommendation systems,” Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark Tuttle, SODA 2005: 1174–1183, (Fall 2007). 3. “Overhang,” Mike Paterson and Uri Zwick, SODA 2006: 231–240, (Spring 2009). 4. “On the Tandem Duplication-Random Loss Model of Genome Rearrangement,” Kamalika Chaudhuri, Kevin Chen, Radu Mihaescu, Satish Rao, SODA 2006: 564–570, (Fall 2008). 5. “Knapsack Auctions,” Gagan Aggarwal, Jason D. Hartline, SODA 2006: 1083–1092, (Fall 2010). 6. “Better Online Buffer Management,” Fei Li, Jay Sethuraman, Clifford Stein, SODA 2007: 199– 208, (Fall 2007). 7. “Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items,” Julien Robert, Nicolas Schabanel, SODA 2007: 238–247, (Spring 2007). 8. “Optimization Problems in Multiple-Interval Graphs,” Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz, SODA 2007: 268–277, (Fall 2012). 9. “A 1.875-Approximation Algorithm for the Stable Marriage Problem,” Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi, SODA 2007: 288–297, (Spring 2007). 10. “Aggregation of Partial Rankings, p-Ratings, and Top-m Lists,” Nir Ailon, SODA 2007: 415– 424, (Spring 2007). 11. “Digraph Measures: Kelly Decompositions, Games, and Orderings,” Paul Hunter, Stephan Kreutzer, SODA 2007: 637–644, (Fall 2007). 12. “Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment,” C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, SODA 2007: 645–654, (Fall 2007). 13. “Whole Genome Duplications, MultiBreak Rearrangements, and the Genome Halving Problem,” Max A. Alekseyev, Pavel A. Pevzne, SODA 2007: 665–679, (Spring 2007). 14. “A Network Formation Game for Bipartite Exchange Economies,” Eyal Even-Dar, Michael J. Kearns, Siddharth Suri, SODA 2007: 697–706, (Spring 2007). 15. “Cheap Labor Can Be Expensive,” Ning Chen, Anna R. Karlin, SODA 2007: 707–715, (Fall 2007). 16. “Speed Scaling for Weighted Flow Time,” Nikhil Bansal, Kirk Pruhs, Clifford Stein, SODA 2007: 805–813, (Spring 2007). 17. “A Lower Bound for Scheduling Mechanisms,” George Christodoulou, Elias Koutsoupias, Angelina Vidali, SODA 2007: 1163–1170, (Spring 2007).
منابع مشابه
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms
The Dagstuhl Seminar on “Design and Analysis of Randomized and Approximation Algorithms” (Seminar 11241) was held at Schloss Dagstuhl between June 13–17, 2011. There were 26 regular talks and several informal and open problem session contributions presented during this seminar. Abstracts of the presentations have been put together in this seminar proceedings document together with some links to...
متن کاملPacking and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)
From 27.02.2011 to 4.03.2011, the Dagstuhl Seminar 11091 “Packing and Scheduling Algorithms for Information and Communication Services” was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstrac...
متن کاملEpidemic Algorithms and Processes: From Theory to Applications
This report documents the program and the outcomes of Dagstuhl Seminar 13042 “Epidemic Algorithms and Processes: From Theory to Applications”, which took place from January 20 to 25, 2013 at Schloss Dagstuhl – Leibniz Center for Informatics. Several research topics were covered by the seminar participants, including scientists working in Theoretical Computer Science, as well as researchers from...
متن کاملProbabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)
This report documents the program and the outcomes of Dagstuhl Seminar 17141 “Probabilistic Methods in the Design and Analysis of Algorithms”. Probabilistic methods play a central role in theoretical computer science. They are a powerful and widely applied tool used, for example, for designing efficient randomized algorithms and for establishing various lower bounds in complexity theory. They a...
متن کاملGraph Modification Problems
This report documents the program and the outcomes of Dagstuhl Seminar 14071 “Graph Modification Problems”. The seminar was held from February 9 to February 14, 2014. This report contains abstracts for presentations about the recent developments on algorithms and structural results for graph modification problems, as well as related areas. Furthermore, the report contains a summary of open prob...
متن کاملProbabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007
This report documents the program and the outcomes of Dagstuhl Seminar 17141 “Probabilistic Methods in the Design and Analysis of Algorithms”. Probabilistic methods play a central role in theoretical computer science. They are a powerful and widely applied tool used, for example, for designing efficient randomized algorithms and for establishing various lower bounds in complexity theory. They a...
متن کامل