Michael F. Schwartz
- 1 AIIman, E. Sendmail--An lnternet~ work mail router. In UNIX Program mer Manual, 4~2 BSD. 2C. Computer Science Division, EECS, Univ. of Caiifornia, Berkeley, 1985~]]Google Scholar
- 2 Callimahos, L., D. Traffic Analysis and the Zendian Problem. Aegean Park Press, Laguna Hills, Calif., !989.]]Google Scholar
- 3 CCITT/ISO, The DirectoTy, Part 1 Overview of Concepts, Models and Ser o vices. CCiTT/ISO, Gloucester, En~ gland, 1988. CCITT Draft Recommendation X.500/iSO DIS 9594-1~]]Google Scholar
- 4 Droms. R. E. Access to heterogeneous direr'tory services. In Proceeding~ q the Joint Conference of the tEEE Computer and Communications Societies (InfoCom). IEEE, New York, 1990.]]Google Scholar
- 5 Harrenstien, K., Stahl, M. and Feinter, E.. N!CName/Whois~ Req. For Com. 954, SRI International Menlo Park, Caiif:, 1985.]] Google ScholarDigital Library
- 6 Hoffman, R The man who loves o.,,tv numbers. AtL Mon. Mag. 260, 5 (Nov. 1987), 60-74~]]Google Scholar
- 7 Kable B. and Medlar, A.. An inf0f mation system for corporate users: Wide area infbrmation servers. Con-. neXio~k~'I'he Interop:erabilit.y Rep. 5, I I (Nov. 199I), 2-9.]]Google Scholar
- 8 Lottor, M. lnternet Growth (1981- 1991). Req. For Com. 1296, Network Information Systems Center. SRI International, Menlo Park~ Caiif.~. t992.]] Google ScholarDigital Library
- 9 Milgram, S. The sIna!l world pmblena. In The Individual in a Social worId, Addison Wesley, Reading, Mass., 1.977, pp. 281-295.]]Google Scholar
- 10 Mockapetris, E Domain Names~-. Concepts and Facilities. Req.. N~r Com..1034, USC Information Science Institute, I987.]] Google ScholarDigital Library
- 11 Peterson, L. L.. The Profile naming service. ACM Tram. Comput.. 3)st. 6, 4. (Nov. I988), 34.1-364.]] Google ScholarDigital Library
- 12 Postel, J. !nternet ProtocoI~DARPA Internet Program Protocol Specification. Req. For Com. 79I, USC infbrmarion Science Institute, 198 I.]]Google Scholar
- 13 Quarterman, J. Ti*e Matrix~Computer Network~ and Conf erencing Systems Worldwide.. Digital Press, Cambridge, Mass., 1:990,]] Google ScholarDigital Library
- 14 Salton, G. Another work at automatic: text-retrieval systems. Commun. ACM 29, 7 (July 1986), 648-656.]] Google ScholarDigital Library
- 15 Schroeder M. D., Birrelt, A. D. and Needham, R, M. Experience with Grapevine: The Growth of a distribuwd system.. ACM Trans. Comput~ Syst. 2, 1 (Feb. 1984), 3-23.]] Google ScholarDigital Library
- 16 Schwartz, M. E Internet resource discovery a.t the. University of Colorado. IEEE Comput. To be published.]] Google ScholarDigital Library
- 17 Schwartz, M, F., Hardy, D. R., Heinzman, W. K, and Hirschowitz, G. Supporting resource discovery among public Internet archives using a spectrum of information quality. In Proceedings ~" the 11th IEEE international Conference on. Distributing Com~ purer Systems. IEEE, New York, 199i, 82-89.]]Google Scholar
- 18 Schwartz, M. F. and Tsirigotis, R G~ Experience with a semantk-.atly cognizant Internet white, pages directory tools j. Internetworking: Res. Exp. 2, I (Mar. 199 I), 23-50.]]Google Scholar
- 19 Sedgewkk, R. Algorithm.. 2d ed. A.ddison Wesley, Reading, Mass., !988.]]Google Scholar
- 20 Spaftbrd, E. H. The lnternet worm: Crisis and. afterznath. Commun. ACM, 32, 6 (}une 1989), 678-687,]] Google ScholarDigital Library
- 21 Terry. D. B. Distributed name servers: Naming and caching in large distributed computing environments.. Ph.D., dissertation., Tech. Rep. UCB/ CSD 85/228, Computer Science Division, EECS, Univ, of California, Berkeley, 1985.]] Google ScholarDigital Library
- 22 Travers, J. and Milgram, S. An experimental study of the smatt world problem. Sociometry, .32, 4 (1969), 42:3- 443.]]Google Scholar
Index Terms
- Discovering shared interests using graph analysis
Recommendations
On the ensemble of optimal dominating and locating-dominating codes in a graph
Let G be a simple, undirected graph with vertex set V. For every v V , we denote by N ( v ) the set of neighbours of v, and let N v ] = N ( v ) { v } . A set C V is said to be a dominating code in G if the sets N v ] C , v V , are all nonempty. A set C ...
Making a C6-free graph C4-free and bipartite
We show that every C6-free graph G has a C4-free, bipartite subgraph with at least 3e(G)/8 edges. Our proof is probabilistic and uses a theorem of Fredi etal. (2006) on C6-free graphs.
On weak odd domination and graph-based quantum secret sharing
A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination with odd ...
Comments