The geobucket data structure for polynomials

Journal of Symbolic Computation

Volumn 25, Issue 3, 1998, Pages 285-293

  Yan, Thomas ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032016214     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0176     Document Type: Article

References (8)

1. Brown, M. R. (1978). Implementation and analysis of binomial queue algorithms. SIAM Journal of Computing 7, 298-319.
2. Buchberger, B. (1965). An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. PhD thesis, Universitat Innsbruck, Institut fur Mathematik, German.
3. Buchberger, B. (1985). Gröbner bases: An algorithmic method in polynomial ideal theory. In: Bose, N. K. (ed.), Multidimensional Systems Theory, chap. 6, pp. 184-232. Dordrecht: Reidel.
4. Hopgood, F. (1968). A solution to the table overflow problem for hash tables. Computer Bulletin 11(4), 297-300.
5. Hreinsdóttir, F. (1994). A case where choosing a product order makes the calculations of a Groebner basis much faster. J. Symbolic Comput. 18, 373-378.
6. Knuth, D. E. (1973). The Art of Computer Programming, volume I: Fundamental Algorithms, chap. 2 (2nd edn). Reading, MA: Addison-Wesley.
7. Vuillemin, J. (1978). A data structure for manipulating priority queues. Communications of the ACM 21(4), 309-315.
8. Yan, T. (1996). The geobucket data structure for polynomials. Tech. Rep. CUCS TR96-1607, Department of Computer Science, Cornell University. Available electronically at http ://cs-tr.cs.cornell.edu/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR96-1607.