Data structures for maintaining set partitions (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 83-96

  Bender, Michael A ^a   Sethia, Saurabh ^a   Skiena, Steven ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84956951430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (20)

1. E. Arkin, H. Meijer, J. Mitchell, D. Rappaport, and S. Skiena. Decision trees for geometric objects. Int. J. Computational Geometry and Applications, 8:343-363, 1998.
2. Gruia Calinescu. A data structure for maintaining a partition. manuscript, 2000.
3. Bernard Chazelle, H. Edelsbrunner, M. Grigni, Leonidas J. Guibas, J. Hershberger, Micha Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
4. R. Cole and R. Hariharan. Dynamic LCA queries on trees. In Proc. Tenth ACMSIAM Symp. Discrete Algorithms (SODA), pages 235-244, 1999.
5. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
6. P. Dietz, K. Mehlhorn, R. Raman, and C. Uhrig. Lower bounds for set intersection queries. In Proc. Fourth ACM-SIAM Symp. Discrete Algorithms (SODA), pages 194-201, 1993.
7. J. Feigenbaum and S. Kannan. Dynamic graph algorithms. Handbook of Discrete and Combinatorial Mathematics, 1995.
8. R. Freimer, J. Mitchell, and C. Piatko. On the complexity of shattering using arrangements. In CCCG: Canadian Conference in Computational Geometry, 1990.
9. L. Guibas and R. Sedgewick. A bichromatic framework for balanced trees. In Proc. 19th IEEE Symp. Foundations of Computer Science, pages 8-21, 1978.
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
11. M. Habib, C. Paul, and L. Viennot. A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata. In Proc. Fifteenth STACS, pages 25-38. Springer-Verlag LNCS, 1998.
12. J. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The theory of machines and computations, pages 189-196. Academic Press, New York, 1971.
13. J. Matoušek. More on cutting arrangements and spanning trees with low crossing number. Technical Report B-90-2, Fachbereich Mathematik, Freie Universität Berlin, Berlin, 1990.
14. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Computing, 16:973-989, 1987.
15. G. Sazaklis, E. Arkin, J. Mitchell, and S. Skiena. Probe trees for touching character recognition. In Proc. International Conference on Imaging Science, Systems and Technology, (CISST), pages 282-289, Las Vegas, NV, 1998.
16. G. Sazaklis, E. Arkin, J. S. B. Mitchell, and S. Skiena. Geometric decision trees for optical character recognition. In Proc. of 13th Annual ACM Symposium on Computational Geometry, pages 490-492, Nice, France, June 1997.
17. R. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22:215-225, 1975.
18. E. Ukkonen. Constructing suffix trees on-line in linear time. In Intern. Federation of Information Processing (IFIP '92), pages 484-492, 1992.
19. D. Yellin. Representing sets with constant time equality testing. In Proc. First ACM-SIAM Symp. Discrete Algorithms (SODA), pages 64-73, 1990.
20. D. Yellin. Algorithms for subset testing and finding maximal sets. In Proc. Third ACM-SIAM Symp. Discrete Algorithms (SODA), pages 386-392, 1992.