Secure and Selective Dissemination of XML Documents

ACM Transactions on Information and System Security

Volumn 5, Issue 3, 2002, Pages 290-331

  Bertino, Elisa ^a   Ferrari, Elena ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

Access control; Secure distribution; Security; XML

Indexed keywords

EID: 85001786260     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/545186.545190     Document Type: Article

References (42)

1. Abramowitz, M., and Stegun, I. 1972. Handbook of Mathematical Functions. Dover Publications, Inc., New York.
2. Amble, O., and Knuth, D. E. 1974. Ordered hash tables. Comput. J. 17, 2, 135-142.
3. Berndt, B. C. 1989. Ramanujan's Notebooks, Part II. Springer-Verlag, New York.
4. Brent, R. 1973. Reducing the retrieval time of scatter storage techniques. Commun. ACM 16, 2, 105-109.
5. Broder, A. 1985. Two counting problems solved via string encodings. In Combinatorial Algorithms on Words. A. Apostolico and Z. Galil, Eds. Vol. 12 of NATO Advance Science Institute Series. Series F: Computer and System Sciences. Springer-Verlag, New York. 229-240.
6. Carlsson, S., Munro, J., and Poblete, P. 1987. On linear probing hashing. Unpublished Manuscript.
7. CELIS, P. 1986. Robin Hood hashing. Ph.D. dissertation, Computer Science Department, University of Waterloo. Tech. Rep. CS-86-14.
8. Celis, P., Larson, P.-A., and Munro, J. 1985. Robin Hood hashing. In Proceedings of the 26th IEEE Sympusium on the Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 281-288.
9. Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H. R. 1979. Extendible hashing-a fast access method for dynamic files. ACM Trans. Datab. Syst. 4, 3, 315-344.
10. Flajolet, P., Gourdon, X., and Dumas, P. 1995a. Mellin transforms and asymptotics: Harmonic sums. Theoret. Comput. Sci. 144, 1-2, 3-58.
11. Flajolet, p., Grabner, p., Kirschenhofer, p., and Prodinger, H. 1995b. On Ramanujan's function. J. Comput. Appl. Math. 58, 1, 103-116.
12. Flajolet, P., and Odlyzko, A. M. 1990a. Random mapping statistics. In Advances in Cryptology. Proceedings of EUROCRYPT 89 (Houtalen, Belgium, Apr.), J.-J. Quisquater and J. Vandewalle, Eds. Lecture Notes in Computer Science Vol. 434. Springer-Verlag, New York, 329-354.
13. Flajolet, P., and Odlyzko, A. M. 1990b. Singularity analysis of generating functions. SIAM J. Disc. Math. 3, 2, 216-240.
14. Flajolet, P., Poblete, P., and Viola, A. 1998. On the analysis of linear probing hashing. Algorithmica 22, 4, 490-515.
15. Flajolet, P., and Sedgewick, R. 2005. Analytic combinatorics. Book in preparation. A preprint can be found in http://pauillac.inria.fr/algo/flajolet/Publications/books.html.
16. Gönnet, G., and Munro, J. 1979. Efficient ordering of hash tables. SIAM. J. Comput. 8, 3, 463-478.
17. Gönnet, G., and Munro, J. 1984. The analysis of linear probing sort by the use of a new mathematical transform. J. Algorithms 5, 451-470.
18. Gonnet, G. H., and Baeza-Yates, R. 1991. Handbook of Algorithms and Data Structures: in Pascal and C, Second Ed. Addison-Wesley, Reading, MA.
19. Goulden, I. P., and Jackson, D. M. 1983. Combinatorial Enumeration. Wiley, New York.
20. Graham, R. L., Knuth, D. E., and Patashnik, O. 1989. Concrete Mathematics. Addison-Wesley, Reading, MA.
21. Jacquet, P., and Regnier, M. 1986. Trie partitioning process: Limiting distributions. In CAAP'86, P. Franchi-Zanetacchi, Ed. In Proceedings of the 11th Colloquium on Trees in Algebra and Programming (Nice, France, Mar.). Lecture Notes in Computer Science Vol. 214. Springer-Verlag, New York, 196-210.
22. Janson, S. 2005. Individual displacements for linear probing hashing with different insertion policies. ACM Trans. Algorithms 1, 2 (Oct.), 177-213.
23. Knuth, D. E. 1963. Notes on “open” addressing. Unpublished memorandum. (Memo dated July 22, 1963 With annotation “My first analysis of an algorithm, originally done during Summer 1962 in Madison”.
24. Knuth, D. E. 1985. Analysis of optimum caching. J. Algorithms 6, 181-199.
25. Knuth, D. E. 1997. The Art of Computer Programming. Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, MA.
26. Knuth, D. E. 1998a. The Art of Computer Programming. Vol. 3: Sorting andSearching. Addison-Wesley, Reading, MA.
27. Knuth, D. E. 1998b. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, MA.
28. Knuth, D. E. 1998c. Linear probing and graphs. Algorithmica 22, 4, 561-568.
29. Knuth, D. E., and Rao, G. S. 1975. Activity in an interleaved memory. IEEE Trans. Comput. C-24, 943-944.
30. Knuth, D. E., and Schönhage, A. 1978. The expected linearity of a simple equivalence algorithm. Theoret. Comput. Sci. 6, 281-315.
31. Könheim, A. G., and Weiss, B. 1966. An occupancy discipline and applications. SIAM J. Appl. Math. 6, 14, 1266-1274.
32. Larson, P.-A. 1983. Analysis of uniform hashing. JACM 30, 4, 805-819.
33. Moon, J. W. 1970. Counting labelled trees. In Canadian Mathematical Monographs. Vol. 1. Canadian Mathematical Congress.
34. Odlyzko, A. M. 1995. Asymptotic enumeration methods. In Handbook of Combinatorics, M. G. R. Graham and L. Lovasz, Eds. Vol. II. Elsevier, Amsterdam, the Netherlands, 1063-1229.
35. Peterson, W. W. 1957. Addressing for random-access storage. IBM J. Res. Devel. 1, 2, 130-146.
36. Poblete, P. 1986. Approximating functions by their Poisson transform. Inf. Proc. Lett. 23, 127-130.
37. Poblete, P., and Munro, J. 1989. Last-come-first-served hashing. J. Algorithms 10, 228-248.
38. Poblete, P., Viola, A., and Munro, J. 1997. The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. Rand. Struct. Algorithms 10, 2, 221-255.
39. Sedgewick, R. 1997. Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, Third ed. Addison-Wesley, Reading, MA.
40. Sedgewick, R., and Flajolet, P. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA.
41. Viola, A. 1995. Analysis of hashing algorithms and a new mathematical transform. Ph.D. thesis, Computer Science Department, University of Waterloo. Tech. Rep. CS-95-50.
42. Wilf, H. S. 1994. generatingfunctionology. Academic Press, Orlando, FL.