Probability and computation

Shuji Kijima

doi:10.1109/ICNC.2011.67

Probability and computation

Shuji Kijima

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

What is the property that a randomized algorithm really requires for randomness? This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.

Original language	English
Title of host publication	Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
Pages	345-346
Number of pages	2
DOIs	https://doi.org/10.1109/ICNC.2011.67
Publication status	Published - 2011
Event	2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, Japan Duration: Nov 30 2011 → Dec 2 2011

Other

Other	2nd International Conference on Networking and Computing, ICNC 2011
Country	Japan
City	Osaka
Period	11/30/11 → 12/2/11

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications

Cite this

Kijima, S. (2011). Probability and computation. In Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011 (pp. 345-346). [6131861] https://doi.org/10.1109/ICNC.2011.67

Probability and computation. / Kijima, Shuji.

Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 345-346 6131861.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kijima, S 2011, Probability and computation. in Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011., 6131861, pp. 345-346, 2nd International Conference on Networking and Computing, ICNC 2011, Osaka, Japan, 11/30/11. https://doi.org/10.1109/ICNC.2011.67

Kijima S. Probability and computation. In Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 345-346. 6131861 https://doi.org/10.1109/ICNC.2011.67

Kijima, Shuji. / Probability and computation. Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. pp. 345-346

@inproceedings{b41de0794830412abbce04714047ecf7,

title = "Probability and computation",

abstract = "What is the property that a randomized algorithm really requires for randomness? This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.",

author = "Shuji Kijima",

year = "2011",

doi = "10.1109/ICNC.2011.67",

language = "English",

isbn = "9780769545691",

pages = "345--346",

booktitle = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",

}

TY - GEN

T1 - Probability and computation

AU - Kijima, Shuji

PY - 2011

Y1 - 2011

N2 - What is the property that a randomized algorithm really requires for randomness? This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.

AB - What is the property that a randomized algorithm really requires for randomness? This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.

UR - http://www.scopus.com/inward/record.url?scp=84856841521&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856841521&partnerID=8YFLogxK

U2 - 10.1109/ICNC.2011.67

DO - 10.1109/ICNC.2011.67

M3 - Conference contribution

AN - SCOPUS:84856841521

SN - 9780769545691

SP - 345

EP - 346

BT - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

ER -

Access to Document

10.1109/ICNC.2011.67