The SCEAS System
| |||||||

## Search the dblp DataBase
Shuichi Miyazaki:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki
**Local Search Algorithms for Partial MAXSAT.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1997, pp:263-268 [Conf] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
**Online Independent Sets.**[Citation Graph (0, 0)][DBLP] COCOON, 2000, pp:202-209 [Conf] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
**Randomized Approximation of the Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] COCOON, 2003, pp:339-350 [Conf] - Kazuo Iwama, Shuichi Miyazaki
**Approximation of coNP Sets by NP-complete Sets.**[Citation Graph (0, 0)][DBLP] COCOON, 1995, pp:11-20 [Conf] - Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi
**Database Queries as Combinatorial Optimization Problems.**[Citation Graph (0, 0)][DBLP] CODAS, 1996, pp:477-483 [Conf] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
**Improved Approximation of the Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:266-277 [Conf] - Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita
**Stable Marriage with Incomplete Lists and Ties.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:443-452 [Conf] - Kazuo Iwama, Shuichi Miyazaki
**SAT-Varible Complexity of Hard Combinatorial Problems.**[Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1994, pp:253-258 [Conf] - Kazuo Iwama, Shuichi Miyazaki
**Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:133-142 [Conf] - Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
**A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:902-914 [Conf] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
**Inapproximability Results on Stable Marriage Problems.**[Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:554-568 [Conf] - Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto
**A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:349-361 [Conf] - Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto
**Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.**[Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2000, pp:123-134 [Conf] - Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto
**Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.**[Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:2- [Journal] - Shuichi Miyazaki, Kazuo Iwama
**Approximation of coNP sets by NP-complete sets and its applications.**[Citation Graph (0, 0)][DBLP] Systems and Computers in Japan, 1999, v:30, n:7, pp:47-54 [Journal] - Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott
**Approximability results for stable marriage problems with ties.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:431-447 [Journal] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
**Online independent sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:289, n:2, pp:953-962 [Journal] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
**Randomized approximation of the stable marriage problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:325, n:3, pp:439-465 [Journal] - David Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
**Hard variants of stable marriage.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:261-279 [Journal] - Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe
**Cheat-Proof Serverless Network Games.**[Citation Graph (0, 0)][DBLP] Computers and Games, 2006, pp:234-243 [Conf] - Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi
**A 1.875: approximation algorithm for the stable marriage problem.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:288-297 [Conf] - Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
**Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.**[Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:164-175 [Conf] - Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe
**A tight bound on online buffer management for two-port shared-memory switches.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:358-364 [Conf] - Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
**Approximation Algorithms for the Sex-Equal Stable Marriage Problem.**[Citation Graph (0, 0)][DBLP] WADS, 2007, pp:201-213 [Conf] - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
**Improved approximation results for the stable marriage problem.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal] **A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.**[Citation Graph (, )][DBLP]**Improving the Competitive Ratio of the Online OVSF Code Assignment Problem.**[Citation Graph (, )][DBLP]**Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols.**[Citation Graph (, )][DBLP]**Design and Implementation of a Certified Mail Exchange System Using Simultaneous Secret Exchange.**[Citation Graph (, )][DBLP]**Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms.**[Citation Graph (, )][DBLP]**A (2-**[Citation Graph (, )][DBLP]*c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
Search in 0.008secs, 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 |