2002 |
9 | EE | K. Kalorkoti:
Predicting Zero Coefficients in Formal Power Series Computations.
J. Symb. Comput. 33(3): 307-320 (2002) |
2001 |
8 | | K. Kalorkoti:
Counting and Gröbner Bases.
J. Symb. Comput. 31(3): 307-313 (2001) |
7 | | K. Kalorkoti:
Detecting Algebraic Curves in Bad Position.
J. Symb. Comput. 31(6): 671-690 (2001) |
6 | EE | K. Kalorkoti,
D. H. Tulley:
Priority queues with binary priorities.
Theor. Comput. Sci. 262(1): 133-144 (2001) |
1995 |
5 | | K. Kalorkoti:
On the Reuse of Additions in Matrix Multiplication.
SIAM J. Comput. 24(6): 1305-1312 (1995) |
1993 |
4 | | K. Kalorkoti:
Inverting Polynomials and Formal Power Series.
SIAM J. Comput. 22(3): 552-559 (1993) |
1988 |
3 | | K. Kalorkoti:
The Trace Invariant and Matrix Inversion.
Theor. Comput. Sci. 59: 277-286 (1988) |
1985 |
2 | | K. Kalorkoti:
A Lower Bound for the Formula Size of Rational Functions.
SIAM J. Comput. 14(3): 678-687 (1985) |
1982 |
1 | | K. Kalorkoti:
A Lower Bound for the Formula Size of Rational Functions.
ICALP 1982: 330-338 |