The SCEAS System
| |||||||

## Search the dblp DataBase
Evgeny Dantsin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
**Complexity and Expressive Power of Logic Programming.**[Citation Graph (2, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:82-101 [Conf] - Evgeny Dantsin, Andrei Voronkov
**Expressive Power and Data Complexity of Query Languages for Trees and Lists.**[Citation Graph (1, 24)][DBLP] PODS, 2000, pp:157-165 [Conf] - 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
**Algorihtms for Probabilistic Inference.**[Citation Graph (0, 0)][DBLP] Conference on Computer Logic, 1988, pp:67-75 [Conf] - Evgeny Dantsin, Andrei Voronkov
**A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 1999, pp:180-196 [Conf] - Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
**Deterministic Algorithms for**[Citation Graph (0, 0)][DBLP]*k*-SAT Based on Covering Codes and Local Search. ICALP, 2000, pp:236-247 [Conf] - Evgeny Dantsin, Andrei Voronkov
**Complexity of Query Answering in Logic Databases with Complex Values.**[Citation Graph (0, 0)][DBLP] LFCS, 1997, pp:56-66 [Conf] - Evgeny Dantsin
**Probabilistic Logic Programs and their Semantics.**[Citation Graph (0, 0)][DBLP] RCLP, 1991, pp:152-164 [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, Michael Gavrilovich, Edward A. Hirsch, Boris Konev
**MAX SAT approximation beyond the limits of polynomial-time approximation.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:81-94 [Journal] - Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
**Complexity and expressive power of logic programming.**[Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 2001, v:33, n:3, pp:374-425 [Journal] - Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov
**Algorithms for SAT and Upper Bounds on Their Complexity**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:12, pp:- [Journal] - 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] - Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
**A deterministic (2-2/(k+1))**[Citation Graph (0, 0)][DBLP]^{n}algorithm for k-SAT based on local search. Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal] **On Moderately Exponential Time for SAT.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

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