Mutual search

Journal of the ACM

Volumn 46, Issue 4, 1999, Pages 517-536

  Buhrman, Harry ^a,b,c,d,e   Franklin, Matthew ^a,b,c,d,e   Garay, Juan A ^a,b,c,d,e   Hoepman, Jaap Henk ^a,b,c,d,e   Tromp, John ^a,b,c,d,e   Vitányi, Paul ^a,b,c,d,e  

^a CWI   (Netherlands)

^b PALO ALTO RESEARCH CENTER   (United States)

^c LUCENT TECHNOLOGIES   (United States)

^d UNIVERSITY OF TWENTE   (Netherlands)

^e UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Coalition forming; Computational complexity; Computer networks; Datastructures; Discrete algorithms; Distributed computation; Mutual search

Indexed keywords

COALITION FORMING; DISCRETE ALGORITHMS; DISTRIBUTED COMPUTATION; MUTUAL SEARCH (MS);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; QUERY LANGUAGES; RANDOM PROCESSES;

ONLINE SEARCHING;

EID: 0012521344     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/320211.320232     Document Type: Article

References (20)

1. AWERBUCH, B., AND PELEG, D. 1989. On-line tracking of mobile users. Tech. Memo TM-410. MIT, Lab. for Computer Science, Cambridge, Mass.
2. AWERBUCH, B., AND PELEG, D. 1990. Sparse partitions. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 503-513.
3. AXELROD, R., AND HAMILTON, W. 1988. The evolution of cooperation. Science 211 (Mar.), 1390-1396.
4. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 1-10.
5. BILLARD, E., AND PASQUALE, J. 1995. Probabilistic coalition formation in distributed knowledge environments. IEEE Trans. Syst., Man, and Cybern 25, 2 (Feb.), 277-286.
6. CHOR, B., GOLDWASSER, S., MICALI, S., AND AWERBUCH, B. 1985. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, Calif., pp. 383-395.
7. GALLAGER, R., HUMBLET, P., AND SPIRA, P. 1983. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Prog. Lang. Syst. 5, 1 (Jan.), 66-77.
8. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty processor. J. ACM. 32, 2 (Apr.), 374-382.
9. HAKIMI, S. L. 1971. Steiner's problem in graphs and its implications. Networks 1, 113-133.
10. HUBERMAN, B., AND HOGG, T. 1988. The behavior of computational ecologies. In The Ecology of Computation, B. Huberman, ed. North Holland, Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 77-115.
11. KNUTH, D. E. 1998. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Addison-Wesley, Reading, Mass.
12. KOOPMAN, B. O. 1956a. The theory of search, Part I. Oper. Res. 4, 324-346.
13. KOOPMAN, B. O. 1956b. The theory of search, Part II. Oper. Res. 4, 503-531.
14. KOOPMAN, B. O. 1957. The theory of search, Part III. Oper. Res. 5, 613-626.
15. KRANAKIS, E., AND VITANYI, P. M. B. 1992. A note on weighted distributed match-making. Math. Syst. Theory 25, 123-140.
16. LAMPORT, L., SHOSTAK, R., AND PEASE, M. 1982. The Byzantine generals problem. ACM Trans. Prog. Lang. Systems, 4, 3 (July), 382-401.
17. MAEKAWA, M. 1985. A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3, 2 (May), 145-159.
18. MAYNARD-SMITH, J. 1982. Evolution and the Theory of Games. Cambridge University Press, Cambridge, Mass.
19. MULLENDER, S. J., AND VITANYI, P. M. B. 1988. Distributed match-making. Algorithmica 3, 367-391.
20. ZHU, Q., AND OOMMEN, J. 1997. Optimal search with unknown target distributions. In Proceedings of the XVII International Conference of the Chilean Computer Science Society. IEEE Computer Society Press, Los Alamitos, Calif., pp. 268-277.