Alexander Wolpert

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

Coauthor Index

1	Evgeny Dantsin	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]
2	Edward A. Hirsch	[3] [5] [9] [16]
3	Vladik Kreinovich	[8] [12] [15]
4	Gang Xiang	[12]