The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Alekhnovich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
    Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf]
  2. Michael Alekhnovich
    Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:439-448 [Conf]
  3. Michael Alekhnovich
    More on Average Case vs Approximation Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:298-307 [Conf]
  4. Michael Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:352-361 [Conf]
  5. Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
    Learnability and Automatizability. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:621-630 [Conf]
  6. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:43-53 [Conf]
  7. Michael Alekhnovich, Alexander A. Razborov
    Lower Bounds for Polynomial Calculus: Non-Binomial Case. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:190-199 [Conf]
  8. Michael Alekhnovich, Alexander A. Razborov
    Resolution is Not Automatizable Unless W[P] is Tractable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:210-219 [Conf]
  9. Michael Alekhnovich, Alexander A. Razborov
    Satisfiability, Branch-Width and Tseitin Tautologies. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:593-603 [Conf]
  10. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:84-96 [Conf]
  11. Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
    Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:176-184 [Conf]
  12. Michael Alekhnovich
    Lower bounds for k-DNF resolution on random 3-CNFs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:251-256 [Conf]
  13. Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis
    Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:294-303 [Conf]
  14. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space complexity in propositional calculus. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:358-367 [Conf]
  15. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
    An exponential separation between regular and general resolution. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:448-456 [Conf]
  16. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:23, pp:- [Journal]
  17. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
    An Exponential Separation between Regular and General Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:056, pp:- [Journal]
  18. Michael Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3CNFs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:016, pp:- [Journal]
  19. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:041, pp:- [Journal]
  20. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:40, pp:- [Journal]
  21. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:35, n:1-3, pp:51-72 [Journal]
  22. Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
    Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:1, pp:171-191 [Journal]
  23. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1184-1211 [Journal]
  24. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:67-88 [Journal]
  25. Michael Alekhnovich
    Mutilated chessboard problem is exponentially hard for resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:513-525 [Journal]
  26. Michael Alekhnovich
    Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2257-2265 [Journal]

Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002