![]() |
| * | 2009 | |
|---|---|---|
| 6 | EE | Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev: Finding Efficient Circuits Using SAT-Solvers. SAT 2009: 32-44 |
| 2007 | ||
| 5 | EE | Alexander S. Kulikov, Konstantin Kutzkov: New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 |
| 2006 | ||
| 4 | EE | Arist Kojevnikov, Alexander S. Kulikov: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. SAT 2006: 11-21 |
| 3 | EE | Arist Kojevnikov, Alexander S. Kulikov: A new approach to proving upper bounds for MAX-2-SAT. SODA 2006: 11-17 |
| 2005 | ||
| 2 | EE | Alexander S. Kulikov: Automated Generation of Simplification Rules for SAT and MAXSAT. SAT 2005: 430-436 |
| 2004 | ||
| 1 | EE | Sergey S. Fedin, Alexander S. Kulikov: Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. IWPEC 2004: 248-259 |
| 1 | Sergey S. Fedin | [1] |
| 2 | Arist Kojevnikov | [3] [4] [6] |
| 3 | Konstantin Kutzkov | [5] |
| 4 | Grigory Yaroslavtsev | [6] |