Note on probabilistic algorithms in integer and polynomial arithmetic. - Michael Kaminski (SYMSACC, 1981)

אלגוריתמים לכפל פולינומים ומספרים שלמים (Algorithms for polynomial and integer multiplication.). - Michael Kaminski (1982)

Mulltiplication of Polynomials over the Ring of Integers - Michael Kaminski (FOCS, 1984)

A Classification of omega-Regular Languages. - Michael Kaminski (Theor. Comput. Sci., 1985)

A Lower Bound for Polynomial Multiplication. - Michael Kaminski (Theor. Comput. Sci., 1985)

Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) - Michael Kaminski; Nader H. Bshouty (FOCS, 1987)

A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. - Michael Kaminski (J. ACM, 1987)

An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. - Michael Kaminski (J. Algorithms, 1988)

Addition Requirements for Matrix and Transposed Matrix Products. - Michael Kaminski; David G. Kirkpatrick; Nader H. Bshouty (J. Algorithms, 1988)

Nonstandard connectives of intuitionistic propositional logic. - Michael Kaminski (Notre Dame J. Formal Log., 1988)

A note on probabilistically verifying integer and polynomial products. - Michael Kaminski (J. ACM, 1989)

Multiplicative complexity of polynomial multiplication over finite fields. - Michael Kaminski; Nader H. Bshouty (J. ACM, 1989)

Finite-Memory Automata (Extended Abstract) - Michael Kaminski; Nissim Francez (FOCS, 1990)

Finite and Circular Path Models for Branching Time Logics. - Michael Kaminski; Michael L. Tiomkin (J. Log. Comput., 1990)

Multiplication of Polynomials over Finite Fields. - Nader H. Bshouty; Michael Kaminski (SIAM J. Comput., 1990)

Embedding a default system into nonmonotonic logics. - Michael Kaminski (Fundam. Informaticae, 1991)

Nonmonotonic Default Modal Logics. - Michael L. Tiomkin; Michael Kaminski (J. ACM, 1991)

A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. - Amir Averbuch; Nader H. Bshouty; Michael Kaminski (J. Algorithms, 1992)

Finite Automata on Directed Graphs. - Michael Kaminski; Shlomit S. Pinter (J. Comput. Syst. Sci., 1992)

Interpretations of Open Default Theories in Non-Monotonic Logics. - Michael Kaminski (Ann. Math. Artif. Intell., 1993)

A Branching Time Logic with Past Operators. - Michael Kaminski (J. Comput. Syst. Sci., 1994)

Finite-Memory Automata. - Michael Kaminski; Nissim Francez (Theor. Comput. Sci., 1994)

Minimum Dominating Sets of Intervals on Lines (Extended Abstract). - Siu-Wing Cheng; Michael Kaminski; Shmuel Zaks (COCOON, 1995)

A Comparative Study of Open Default Theories. - Michael Kaminski (Artif. Intell., 1995)

Semantical Analysis of Logic of Actions. - Michael L. Tiomkin; Michael Kaminski (J. Log. Comput., 1995)

The Expressive Power of Second-Order Propositional Modal Logic. - Michael Kaminski; Michael L. Tiomkin (Notre Dame J. Formal Log., 1996)

The Power of the "Always" Operator in First-Order Temporal Logic. - Michael Kaminski; Chung Kei Wong (Theor. Comput. Sci., 1996)

A Note on the Stable Model Semantics for Logic Programs. (Research Note). - Michael Kaminski (Artif. Intell., 1997)

The elimination of de re formulas. - Michael Kaminski (J. Philos. Log., 1997)

Context-Free Languages over Infinite Alphabets. - Edward Y. C. Cheng; Michael Kaminski (Acta Informatica, 1998)

Minimum Dominating Sets of Intervals on Lines. - Siu-Wing Cheng; Michael Kaminski; Shmuel Zaks (Algorithmica, 1998)

Extensions for Open Default Theories via the Domain Closure Assumption. - Michael Kaminski; Johann A. Makowsky; Michael L. Tiomkin (J. Log. Comput., 1998)

The Expressive Power of Temporal Logic of Actions (Extended Abstract). - Arkadi Estrin; Michael Kaminski (CONCUR, 1999)

Similarity Preservation in Default Logic. - Rachel Ben-Eliyahu-Zohary; Nissim Francez; Michael Kaminski (Ann. Math. Artif. Intell., 1999)

Open Default Theories over Closed Domains. - Michael Kaminski (Log. J. IGPL, 1999)

First-order Non-monotonic Modal Logics. - Michael Kaminski; Guy Rey (Fundam. Informaticae, 2000)

The Expressive Power of Temporal Logic of Actions. - Arkadi Estrin; Michael Kaminski (J. Log. Comput., 2002)

Revisiting quantification in autoepistemic logic. - Michael Kaminski; Guy Rey (ACM Trans. Comput. Log., 2002)

A Real-time Semantics of Temporal Logic of Actions. - Michael Kaminski; Yael Yariv (J. Log. Comput., 2003)

An algebraic characterization of deterministic regular languages over infinite alphabets. - Nissim Francez; Michael Kaminski (Theor. Comput. Sci., 2003)

Default Theories Over Monadic Languages: (Extended Abstract). - Michael Kaminski; Julia Mosin (WoLLIC, 2004)

Indistinguishability by Default. - Ariel Cohen 004; Michael Kaminski; Johann A. Makowsky (We Will Show Them! (1), 2005)

A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. - Michael Kaminski (SIAM J. Comput., 2005)

Complexity of Polynomial Multiplication over Finite Fields. - Michael Kaminski (CSR, 2006)

Preface. - Michael Kaminski (Ann. Math. Artif. Intell., 2006)

Polynomial multiplication over finite fields: from quadratic to straight-line complexity. - Nader H. Bshouty; Michael Kaminski (Comput. Complex., 2006)

Regular Expressions for Languages over Infinite Alphabets. - Michael Kaminski; Tony Tan (Fundam. Informaticae, 2006)

Invariance under stuttering in a temporal logic of actions. - Michael Kaminski (Theor. Comput. Sci., 2006)

Default theories over monadic languages. - Michael Kaminski; Julia Rubin-Mosin (Theor. Comput. Sci., 2006)

Pushdown automata with cancellation and commutation-augmented pregroups grammars. - Nissim Francez; Michael Kaminski (LATA, 2007)

The Modal Logic of Cluster-Decomposable Kripke Interpretations. - Michael Kaminski; Michael L. Tiomkin (Notre Dame J. Formal Log., 2007)

Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. - Nissim Francez; Michael Kaminski (Stud Logica, 2007)

Extending finite-memory automata with non-deterministic reassignment (Extended abstract). - Michael Kaminski; Daniel Zeitlin (AFL, 2008)

Tree Automata over Infinite Alphabets. - Michael Kaminski; Tony Tan (Pillars of Computer Science, 2008)

A non-preferential semantics of non-monotonic modal logic. - Michael Kaminski (Ann. Math. Artif. Intell., 2008)

Preface. - Michael Kaminski; Miroslaw Truszczynski (Ann. Math. Artif. Intell., 2008)

First-Order Ground Non-Monotonic Modal Logic. - Benjamin Grimberg; Michael Kaminski (Fundam. Informaticae, 2008)

Invariance Under Stuttering in a Temporal Logic without the "Until" Operator. - Michael Kaminski (Fundam. Informaticae, 2008)

Commutation-augmented pregroup grammars and push-down automata with cancellation. - Nissim Francez; Michael Kaminski (Inf. Comput., 2008)

Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. - Ariel Cohen 004; Michael Kaminski; Johann A. Makowsky (J. Log. Lang. Inf., 2008)

The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. - Yulia Dubov; Michael Kaminski (Languages: From Formal to Natural, 2009)

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. - Daniel Genkin; Nissim Francez; Michael Kaminski (Essays in Memory of Amir Pnueli, 2010)

A Note on Two-pebble Automata Over Infinite Alphabets. - Michael Kaminski; Tony Tan (Fundam. Informaticae, 2010)

Finite-Memory Automata with Non-Deterministic Reassignment. - Michael Kaminski; Daniel Zeitlin (Int. J. Found. Comput. Sci., 2010)

Extending Free Pregroups with Lower Bounds. - Tamar Aizikowitz; Nissim Francez; Daniel Genkin; Michael Kaminski (Stud Logica, 2010)

CSL 2008 special issue. - Michael Kaminski; Simone Martini 001 (ACM Trans. Comput. Log., 2010)

LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. - Tamar Aizikowitz; Michael Kaminski (CSR, 2011)

Conjunctive grammars and alternating pushdown automata. - Tamar Aizikowitz; Michael Kaminski (Acta Informatica, 2013)

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. - Michael Kaminski; Chaoping Xing (IEEE Trans. Inf. Theory, 2013)

Linear Conjunctive Grammars and One-turn Synchronized Alternating Pushdown Automata. - Tamar Aizikowitz; Michael Kaminski (Int. J. Found. Comput. Sci., 2014)

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. - Michael Kaminski; Nissim Francez (Stud Logica, 2014)

A note on the emptiness problem for alternating finite-memory automata. - Daniel Genkin; Michael Kaminski; Liat Peterfreund (Theor. Comput. Sci., 2014)

LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata. - Tamar Aizikowitz; Michael Kaminski (J. Comput. Syst. Sci., 2016)

The Lambek Calculus Extended with Intuitionistic Propositional Logic. - Michael Kaminski; Nissim Francez (Stud Logica, 2016)

A Proof-Theoretic Semantics for Exclusion. - Nissim Francez; Michael Kaminski (Logica Universalis, 2017)

Closure Under Reversal of Languages over Infinite Alphabets. - Daniel Genkin; Michael Kaminski; Liat Peterfreund (CSR, 2018)

On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics. - Nissim Francez; Michael Kaminski (FLAP, 2019)

Structural Rules for Multi-valued Logics. - Nissim Francez; Michael Kaminski (Logica Universalis, 2019)

De Morgan Interpretation of the Lambek-Grishin Calculus. - Michael Kaminski; Nissim Francez (Rev. Symb. Log., 2020)

Sets of Linear Forms Which Are Hard to Compute. - Michael Kaminski; Igor E. Shparlinski (MFCS, 2021)

Calculi for Many-Valued Logics. - Michael Kaminski; Nissim Francez (Logica Universalis, 2021)

A Note on Calculi for Non-deterministic Many-valued Logics. - Michael Kaminski (Fundam. Informaticae, 2022)

Extending the Lambek Calculus with Classical Negation. - Michael Kaminski (Stud Logica, 2022)

On sets of linear forms of maximal complexity. - Michael Kaminski; Igor E. Shparlinski; Michel Waldschmidt (Comput. Complex., 2023)

Many-Valued Modal Logic. - Amir Karniel; Michael Kaminski (NCL, 2024)

On undecidability of the propositional logic of an associative binary modality. - Michael Kaminski (Arch. Math. Log., 2024)