The SCEAS System
Navigation Menu

Search the dblp DataBase


Alexander S. Kulikov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergey S. Fedin, Alexander S. Kulikov
    Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:248-259 [Conf]
  2. Arist Kojevnikov, Alexander S. Kulikov
    Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:11-21 [Conf]
  3. Alexander S. Kulikov
    Automated Generation of Simplification Rules for SAT and MAXSAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:430-436 [Conf]
  4. Arist Kojevnikov, Alexander S. Kulikov
    A new approach to proving upper bounds for MAX-2-SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:11-17 [Conf]
  5. Alexander S. Kulikov, Konstantin Kutzkov
    New Bounds for MAX-SAT by Clause Learning. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:194-204 [Conf]

  6. Circuit Complexity and Multiplicative Complexity of Boolean Functions. [Citation Graph (, )][DBLP]

  7. Finding Efficient Circuits Using SAT-Solvers. [Citation Graph (, )][DBLP]

  8. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]

  9. On covering graphs by complete bipartite subgraphs. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002