ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Distributed pursuit-evasion: some aspects of privacy and security in distributed computing
Full text PdfPdf (110 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing table of contents
Los Angeles, California, United States
Page: 403  
Year of Publication: 1994
ISBN:0-89791-654-9
Authors
P. Spirakis  Computer Technology Institute, PO BOX 1122, 26110 Patras, Greece
B. Tampakas  Computer Technology Institute, PO BOX 1122, 26110 Patras, Greece
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 7,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/197917.198191
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Franklin et al. 93
M. Franklin, Z. Galil and M. Yung, "Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems", FOGS 1993, 670-679.
Megiddo et al. 88
N. Megiddo , S. L. Hakimi , M. R. Garey , D. S. Johnson , C. H. Papadimitriou, The complexity of searching a graph, Journal of the ACM (JACM), v.35 n.1, p.18-44, Jan. 1988  [doi>10.1145/42267.42268]
 
Ostrovsky, Yung 91
R. Ostrovsky and M. Yung, "Robust Computation in the presence of mobile viruses", PODC 1991, $1-59.
Reif 79
John H. Reif, Universal games of incomplete information, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.288-308, April 30-May 02, 1979, Atlanta, Georgia, United States  [doi>10.1145/800135.804422]

CITED BY  3
Matthew Franklin , Zvi Galil , Moti Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Journal of the ACM (JACM), v.47 n.2, p.225-243, March 2000
Kostas P. Hatzis , George P. Pentaris , Paul G. Spirakis , Vasilis T. Tampakas , Richard B. Tan, Fundamental control algorithms in mobile networks, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, p.251-260, June 27-30, 1999, Saint Malo, France
Paul G. Spirakis , Christos D. Zaroliagis, Distributed algorithm engineering, Experimental algorithmics: from algorithm design to robust and efficient software, Springer-Verlag New York, Inc., New York, NY, 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems


General Terms:
Algorithms, Security

Collaborative Colleagues:
P. Spirakis: colleagues
B. Tampakas: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player