| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Evgeny Dantsin 8 Evgeny Dantsin, Edward A. Hirsch , Sergei Ivanov , Maxim Vsemirnov : Algorithms for SAT and Upper Bounds on Their Complexity. Electronic Colloquium on Computational Complexity (ECCC) (012): (2001) 7 Evgeny Dantsin, Andreas Goerdt , Edward A. Hirsch , Uwe Schöning : Deterministic Algorithms for k -SAT Based on Covering Codes and Local Search. ICALP 2000 : 236-247 6 Evgeny Dantsin, Andrei Voronkov : Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS 2000 : 157-165 5 Evgeny Dantsin, Andrei Voronkov : A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. FoSSaCS 1999 : 180-196 4 Evgeny Dantsin, Thomas Eiter , Georg Gottlob , Andrei Voronkov : Complexity and Expressive Power of Logic Programming. IEEE Conference on Computational Complexity 1997 : 82-101 3 Evgeny Dantsin, Andrei Voronkov : Complexity of Query Answering in Logic Databases with Complex Values. LFCS 1997 : 56-66 2 Evgeny Dantsin: Probabilistic Logic Programs and their Semantics. RCLP 1991 : 152-164 1 Evgeny Dantsin: Algorihtms for Probabilistic Inference. Conference on Computer Logic 1988 : 67-75 DiSC'01 Copyright ©2002 ACM Inc. |
