The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander Wolpert:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Evgeny Dantsin, Alexander Wolpert
**Solving Constraint Satisfaction Problems with DNA Computing.**[Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:171-180 [Conf] - 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] - Evgeny Dantsin, Alexander Wolpert
**Derandomization of Schuler's Algorithm for SAT.**[Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf] - Evgeny Dantsin, Alexander Wolpert
**Derandomization of Schuler's Algorithm for SAT.**[Citation Graph (0, 0)][DBLP] SAT (Selected Papers, 2004, pp:80-88 [Conf] - Evgeny Dantsin, Alexander Wolpert
**An Improved Upper Bound for SAT.**[Citation Graph (0, 0)][DBLP] SAT, 2005, pp:400-407 [Conf] - Evgeny Dantsin, Alexander Wolpert
**MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s**[Citation Graph (0, 0)][DBLP]^{2}) Time. SAT, 2006, pp:266-276 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] **On Moderately Exponential Time for SAT.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |