
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Seiichiro Tani, "Compression of View on Anonymous Networks—Folded View—," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 2, pp. 255262, February, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.142, author = {Seiichiro Tani}, title = {Compression of View on Anonymous Networks—Folded View—}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {2}, issn = {10459219}, year = {2012}, pages = {255262}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.142}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Compression of View on Anonymous Networks—Folded View— IS  2 SN  10459219 SP255 EP262 EPD  255262 A1  Seiichiro Tani, PY  2012 KW  Analysis of algorithms and problem complexity KW  distributed networks. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] M. Yamashita and T. Kameda, "Computing on an Anonymous Network," Proc. Seventh Ann. ACM Symp. Principles of Distributed Computing (PODC '88), pp. 117130, 1988.
[2] M. Yamashita and T. Kameda, "Computing on Anonymous Networks: Part I—Characterizing the Solvable Cases," IEEE Trans. Parallel Distributed Systems, vol. 7, no. 1, pp. 6989, Jan. 1996.
[3] M. Yamashita and T. Kameda, "Computing on Anonymous Networks: Part II—Decision and Membership Problems," IEEE Trans. Parallel Distributed Systems, vol. 7, no. 1, pp. 9096, Jan. 1996.
[4] D. Angluin, "Local and Global Properties in Networks of Processors (Extended Abstract)," Proc. 12th Ann. ACM Symp. Theory of Computing (STOC '80), pp. 8293, 1980.
[5] E. Kranakis, D. Krizanc, and J. van den Berg, "Computing Boolean Functions on Anonymous Networks," Information and Computation, vol. 114, no. 2, pp. 214236, 1994.
[6] N. Norris, "Universal Covers of Graphs: Isomoriphism to Depth n1 Implies Isomoriphism to All Depths," Discrete Applied Math., vol. 56, no. 1, pp. 6174, 1995.
[7] P. Boldi, S. Shammah, S. Vigna, B. Codenotti, P. Gemmell, and J. Simon, "Symmetry Breaking in Anonymous Networks: Characterizations," Proc. Fourth Israel Symp. Theory of Computing and Systems (ISTCS), pp. 1626, 1996.
[8] P. Boldi and S. Vigna, "Fibrations of Graphs," Discrete Math., vol. 243, pp. 2166, 2002.
[9] Y. Afek and Y. Matias, "Elections in Anonymous Networks," Information and Computation, vol. 113, no. 2, pp. 312330, 1994.
[10] M. Yamashita and T. Kameda, "Leader Election Problem on Networks in which Processor Identity Numbers are not Distinct," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp. 878887, Sept. 1999.
[11] S. Das, P. Flocchini, A. Nayak, and N. Santoro, "Effective Elections for Anonymous Mobile Agents," Proc. 17th Int'l Symp. Algorithms and Computation (ISAAC '06), pp. 732743, 2006.
[12] Y.M. Jérémie Chalopin, "An Efficient Message Passing Election Algorithm Based on Mazurkiewicz's Algorithm," Fundamenta Informaticae, vol. 80, pp. 221246, 2007.
[13] S. Tani, H. Kobayashi, and K. Matsumoto, "Exact Quantum Algorithms for the Leader Election Problem," Proc. 22nd Symp. Theoretical Aspects of Computer Science, pp. 581592, 2005.
[14] H. Kobayashi, K. Matsumoto, and S. Tani, "Brief Announcement: Exactly Electing a Unique Leader is not Harder than Computing Symmetric Functions on Anonymous Quantum Networks," Proc. 28th Ann. ACM Symp. Principles of Distributed Computing (PODC '09), pp. 334335, 2009.
[15] K.R. Abrahamson, A. Adler, L. Higham, and D.G. Kirkpatrick, "Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings," vol. 41, no. 2, pp. 277310, 1994.
[16] E. Kranakis and D. Krizanc, "Distributed Computing on Anonymous Hypercube Networks," J. Algorithms, vol. 23, no. 1, pp. 3250, 1997.
[17] P. Boldi and S. Vigna, "Computing Anonymously with Arbitrary Knowledge," Proc. 18th Ann. ACM Symp. Principles of Distributed Computing, pp. 181188, 1999.
[18] N.A. Lynch, Distributed Algorithms. Morgan Kaufman Publishers, 1996.