K. Kalorkoti

11 papers A* 1Journal 10
YearRankTypeTitle / Venue / Authors
2018 J jnl
Solving Łukasiewicz
Theor. Comput. Sci.
K. Kalorkoti
2011 J jnl
Model checking in the modal μ-calculus and generic solutions.
J. Symb. Comput.
K. Kalorkoti
2002 J jnl
Predicting Zero Coefficients in Formal Power Series Computations.
J. Symb. Comput.
K. Kalorkoti
2001 J jnl
Counting and Gröbner Bases.
J. Symb. Comput.
K. Kalorkoti
2001 J jnl
Detecting Algebraic Curves in Bad Position.
J. Symb. Comput.
K. Kalorkoti
2001 J jnl
Priority queues with binary priorities.
Theor. Comput. Sci.
K. Kalorkoti, D. H. Tulley
1995 J jnl
On the Reuse of Additions in Matrix Multiplication.
SIAM J. Comput.
K. Kalorkoti
1993 J jnl
Inverting Polynomials and Formal Power Series.
SIAM J. Comput.
K. Kalorkoti
1988 J jnl
The Trace Invariant and Matrix Inversion.
Theor. Comput. Sci.
K. Kalorkoti
1985 J jnl
A Lower Bound for the Formula Size of Rational Functions.
SIAM J. Comput.
K. Kalorkoti
1982 A* conf
A Lower Bound for the Formula Size of Rational Functions.
ICALP
K. Kalorkoti
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski