Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(8)
Kazuo Iwama (岩間一雄)
9
Kazuhisa Makino (牧野和久)
7
Masaki Yamamoto (山本真基)
7
Kazuhisa Seto
3
Yuichi Yoshida
2
Conferences
(5)
ISAAC
1
SODA
1
WAE
1
APPROX
1
Theory and Applications of Satisfiability Testing
1
Journals
(5)
ECCC
4
DAM
3
TCS
2
IEICE
2
CORR
1
Keywords
(24)
Embed
Subscribe
Academic
Authors
Suguru Tamaki
Edit
Suguru Tamaki
Kyoto University
Publications: 18
|
Citations: 89
|
G-Index: 9
|
H-Index: 3
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Networks & Communications
View FAQ about top research area and research interests
Collaborated with
8 co-authors
from 2001 to 2011
; Cited by
87 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(18)
BibTeX
|
RIS
|
RefWorks
Download
An exact algorithm for the Boolean connectivity problem for k -CNF
Kazuhisa Makino
,
Suguru Tamaki
,
Masaki Yamamoto
Journal:
Theoretical Computer Science - TCS
, vol. 412, no. 35, pp. 4613-4618, 2011
Derandomizing HSSW Algorithm for 3SAT
Kazuhisa Makino
,
Suguru Tamaki
,
Masaki Yamamoto
Journal:
Computing Research Repository - CORR
, vol. abs/1102.3, 2011
Improved Randomized Algorithms for 3SAT
(
Citations: 2
)
Kazuo Iwama
,
Kazuhisa Seto
,
Tadashi Takai
,
Suguru Tamaki
Conference:
International Symposium on Algorithms and Computation - ISAAC
, pp. 73-84, 2010
On the Boolean connectivity problem for Horn relations
(
Citations: 1
)
Kazuhisa Makino
,
Suguru Tamaki
,
Masaki Yamamoto
Journal:
Discrete Applied Mathematics - DAM
, vol. 158, no. 18, pp. 2024-2030, 2010
A Query Efficient Nonadaptive Long Code Test with Perfect Completeness
(
Citations: 2
)
Suguru Tamaki
,
Yuichi Yoshida
Conference:
Approximation Algorithms for Combinatorial Optimization - APPROX
, pp. 738-751, 2010
Order by:
Citations
(89 times by 69 publications)
Derandomizing HSSW Algorithm for 3SAT
Kazuhisa Makino
,
Suguru Tamaki
,
Masaki Yamamoto
Journal:
Computing Research Repository - CORR
, vol. abs/1102.3, 2011
Improved Randomized Algorithms for 3SAT
(
Citations: 2
)
Kazuo Iwama
,
Kazuhisa Seto
,
Tadashi Takai
,
Suguru Tamaki
Conference:
International Symposium on Algorithms and Computation - ISAAC
, pp. 73-84, 2010
Using a Skewed Hamming Distance to Speed Up Deterministic Local Search
(
Citations: 1
)
Dominik Scheder
Journal:
Computing Research Repository - CORR
, vol. abs/1005.4, 2010
A Query Efficient Nonadaptive Long Code Test with Perfect Completeness
(
Citations: 2
)
Suguru Tamaki
,
Yuichi Yoshida
Conference:
Approximation Algorithms for Combinatorial Optimization - APPROX
, pp. 738-751, 2010
Parametric quantified SAT solving
(
Citations: 1
)
Thomas Sturm
,
Christoph Zengler
Conference:
International Symposium on Symbolic and Algebraic Computation - ISSAC
, pp. 77-84, 2010
Comments