( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Approximation of the Stable Marriage Problem.

, , , и . ESA, том 2832 из Lecture Notes in Computer Science, стр. 266-277. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Shintaro Miyazaki

Shuichi Hasegawa

Stephan Shuichi Haupt

 

Другие публикации лиц с тем же именем

A tight bound on online buffer management for two-port shared-memory switches., , и . SPAA, стр. 358-364. ACM, (2007)Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multi-core SoC., , , , , , и . ASP-DAC, стр. 410-415. IEEE, (2015)SAT-Varible Complexity of Hard Combinatorial Problems., и . IFIP Congress (1), том A-51 из IFIP Transactions, стр. 253-258. North-Holland, (1994)Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols., , , и . SAINT, стр. 293-296. IEEE Computer Society, (2008)Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists., , и . ISAAC, том 149 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A 1.875: approximation algorithm for the stable marriage problem., , и . SODA, стр. 288-297. SIAM, (2007)A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties., , и . ESA (2), том 6347 из Lecture Notes in Computer Science, стр. 135-146. Springer, (2010)Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle., и . ISAAC, том 1741 из Lecture Notes in Computer Science, стр. 133-142. Springer, (1999)The Hospitals/Residents Problem with Quota Lower Bounds., , и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 180-191. Springer, (2011)Total Stability in Stable Matching Games., , и . SWAT, том 53 из LIPIcs, стр. 23:1-23:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)