The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Suguru Tamaki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kazuo Iwama, Suguru Tamaki
    Improved upper bounds for 3-SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:328- [Conf]
  2. Kazuo Iwama, Suguru Tamaki
    Exploiting Partial Knowledge of Satisfying Assignments. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:118-128 [Conf]
  3. Kazuo Iwama, Suguru Tamaki
    Improved Upper Bounds for 3-SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:053, pp:- [Journal]
  4. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    On the Boolean Connectivity Problem for Horn Relations. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:187-200 [Conf]
  5. Kazuo Iwama, Suguru Tamaki
    Exploiting partial knowledge of satisfying assignments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1596-1603 [Journal]

  6. A Query Efficient Non-adaptive Long Code Test with Perfect Completeness. [Citation Graph (, )][DBLP]


  7. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. [Citation Graph (, )][DBLP]


  8. The Complexity of the Hajos Calculus for Planar Graphs. [Citation Graph (, )][DBLP]


  9. A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. [Citation Graph (, )][DBLP]


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