The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Wolpert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:60-68 [Conf]
  2. Evgeny Dantsin, Alexander Wolpert
    Solving Constraint Satisfaction Problems with DNA Computing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:171-180 [Conf]
  3. Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich
    Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:1640-1644 [Conf]
  4. Evgeny Dantsin, Alexander Wolpert
    Derandomization of Schuler's Algorithm for SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  5. Evgeny Dantsin, Alexander Wolpert
    Derandomization of Schuler's Algorithm for SAT. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:80-88 [Conf]
  6. Evgeny Dantsin, Alexander Wolpert
    An Improved Upper Bound for SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:400-407 [Conf]
  7. Evgeny Dantsin, Alexander Wolpert
    MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:266-276 [Conf]
  8. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Algorithms for SAT Based on Search in Hamming Balls. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:141-151 [Conf]
  9. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Algorithms for SAT based on search in Hamming balls [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:072, pp:- [Journal]
  10. Evgeny Dantsin, Alexander Wolpert
    Derandomization of Schuler's Algorithm for SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:017, pp:- [Journal]
  11. Evgeny Dantsin, Alexander Wolpert
    An Improved Upper Bound for SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:030, pp:- [Journal]
  12. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:102, pp:- [Journal]
  13. Evgeny Dantsin, Alexander Wolpert
    A Robust Dna Computation Model That Captures Pspace. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:933-0 [Journal]
  14. Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang
    Population Variance under Interval Uncertainty: A New Algorithm. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2006, v:12, n:4, pp:273-280 [Journal]

  15. On Moderately Exponential Time for SAT. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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