Cite This Item

Copy Citation

MLA
Norris, Nancy. “Classifying Anonymous Networks: When Can Two Networks Compute The Same Set Of Vector-Valued Functions?” Structure, Information and Communication Complexity, IIS 1, edited by Paola Flocchini et al., McGill-Queen's University Press, 1995, pp. 83–98, www.jstor.org/stable/j.ctt9qf3pc.8. Accessed 6 June 2020.
APA
Norris, N. (1995). Classifying Anonymous Networks: When Can Two Networks Compute The Same Set Of Vector-Valued Functions? In Flocchini P., Mans B., & Santoro N. (Eds.), Structure, Information and Communication Complexity, IIS 1 (pp. 83-98). McGill-Queen's University Press. Retrieved June 6, 2020, from www.jstor.org/stable/j.ctt9qf3pc.8
CHICAGO
Norris, Nancy. "Classifying Anonymous Networks: When Can Two Networks Compute The Same Set Of Vector-Valued Functions?" In Structure, Information and Communication Complexity, IIS 1, edited by Flocchini Paola, Mans Bernard, and Santoro Nicola, 83-98. McGill-Queen's University Press, 1995. Accessed June 6, 2020. www.jstor.org/stable/j.ctt9qf3pc.8.

Export Citation

Export a RIS file (For EndNote, ProCite, Reference Manager, Zotero, Mendeley…)
Export a Text file (For BibTex)
Note: Always review your references and make any necessary corrections before using. Pay attention to names, capitalization, and dates.