Online Vertex-Coloring Games in Random Graphs Revisited Reto Spöhel (joint work with Torsten Mütze and Thomas Rast; appeared at SODA ’11)
Some algorithmic background Biology 162 Computational Genetics Todd Vision Fall 2004 26 Aug 2004.
Polynomial-Time Algorithms for Designing Dual-Voltage Energy Efficient Circuits Master’s Thesis Defense Mridula Allani Advisor : Dr. Vishwani D. Agrawal.
1 Translational Polygon Covering using Intersection Graphs Prof. Karen Daniels Rajasekhar Inkulu 13 August, 2001.
Coloring random graphs online without creating monochromatic subgraphs Torsten Mütze, ETH Zürich Joint work with Thomas Rast (ETH Zürich) and Reto Spöhel.
1 Algorithm Design Patterns and Anti-Patterns Algorithm design patterns.Ex. n Greed.O(n log n) interval scheduling. n Divide-and-conquer. O(n log n) FFT.
Advanced Algorithms Piyush Kumar (Lecture 7: Reductions) Welcome to COT5405 Based on Kevin Wayne’s slides.
QuIDE was used during the Quantum Computation classes at DCS AGH
Chapter 7 Inefficiency and Intractability CS 345 Spring Quarter, 2014.
Extra. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
Lower Bounds for Property Testing
Polynomial-Time Algorithms for Designing Dual-Voltage Energy Efficient Circuits