| 2021 | MFCS | Sets of Linear Forms Which Are Hard to Compute. | Michael Kaminski, Igor E. Shparlinski |
| 2018 | CSR | Closure Under Reversal of Languages over Infinite Alphabets. | Daniel Genkin, Michael Kaminski, Liat Peterfreund |
| 2011 | CSR | Untitled record | Tamar Aizikowitz, Michael Kaminski |
| 2009 | FG | Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata. | Tamar Aizikowitz, Michael Kaminski |
| 2008 | ISAIM | A Non-Preferential Semantics of Non-Monotonic Modal Logic. | Michael Kaminski |
| 2008 | WoLLIC | Conjunctive Grammars and Alternating Pushdown Automata. | Tamar Aizikowitz, Michael Kaminski |
| 2007 | LATA | Pushdown automata with cancellation and commutation-augmented pregroups grammars. | Nissim Francez, Michael Kaminski |
| 2006 | CSR | Complexity of Polynomial Multiplication over Finite Fields. | Michael Kaminski |
| 2005 | STACS | A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. | Michael Kaminski |
| 2004 | COCOON | Regular Expressions for Languages over Infinite Alphabets. | Michael Kaminski, Tony Tan |
| 1999 | CONCUR | The Expressive Power of Temporal Logic of Actions (Extended Abstract). | Arkadi Estrin, Michael Kaminski |
| 1999 | ECSQARU | Open Default Theories over Closed Domains. | Michael Kaminski |
| 1996 | JELIA | Extensions for Open Default Theories via the Domain Closure Assumption. | Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin |
| 1995 | COCOON | Minimum Dominating Sets of Intervals on Lines (Extended Abstract). | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks |
| 1990 | FOCS | Finite-Memory Automata (Extended Abstract) | Michael Kaminski, Nissim Francez |
| 1990 | TARK | Nonmonotonic Default Modal Logics. | Michael L. Tiomkin, Michael Kaminski |
| 1987 | FOCS | Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) | Michael Kaminski, Nader H. Bshouty |
| 1984 | FOCS | Mulltiplication of Polynomials over the Ring of Integers | Michael Kaminski |
| 1981 | ISSAC | Note on probabilistic algorithms in integer and polynomial arithmetic. | Michael Kaminski |