Michael Kaminski

According to our database1, Michael Kaminski
  • authored at least 81 papers between 1981 and 2016.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
The Lambek Calculus Extended with Intuitionistic Propositional Logic.
Studia Logica, 2016

LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata.
J. Comput. Syst. Sci., 2016

2014
A note on the emptiness problem for alternating finite-memory automata.
Theor. Comput. Sci., 2014

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.
Studia Logica, 2014

Linear Conjunctive Grammars and One-turn Synchronized Alternating Pushdown Automata.
Int. J. Found. Comput. Sci., 2014

2013
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial.
IEEE Trans. Information Theory, 2013

Conjunctive grammars and alternating pushdown automata.
Acta Inf., 2013

2011
LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata.
Proceedings of the Computer Science - Theory and Applications, 2011

2010
CSL 2008 special issue.
ACM Trans. Comput. Log., 2010

Extending Free Pregroups with Lower Bounds.
Studia Logica, 2010

Finite-Memory Automata with Non-Deterministic Reassignment.
Int. J. Found. Comput. Sci., 2010

A Note on Two-pebble Automata Over Infinite Alphabets.
Fundam. Inform., 2010

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.
Proceedings of the Time for Verification, 2010

2009
Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata.
Proceedings of the Formal Grammar - 14th International Conference, 2009

The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata.
Proceedings of the Languages: From Formal to Natural, 2009

2008
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning.
Journal of Logic, Language and Information, 2008

Commutation-augmented pregroup grammars and push-down automata with cancellation.
Inf. Comput., 2008

Invariance Under Stuttering in a Temporal Logic without the "Until" Operator.
Fundam. Inform., 2008

First-Order Ground Non-Monotonic Modal Logic.
Fundam. Inform., 2008

Preface.
Ann. Math. Artif. Intell., 2008

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

Conjunctive Grammars and Alternating Pushdown Automata.
Proceedings of the Logic, 2008

A Non-Preferential Semantics of Non-Monotonic Modal Logic.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Tree Automata over Infinite Alphabets.
Proceedings of the Pillars of Computer Science, 2008

Extending finite-memory automata with non-deterministic reassignment (Extended abstract).
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.
Studia Logica, 2007

The Modal Logic of Cluster-Decomposable Kripke Interpretations.
Notre Dame Journal of Formal Logic, 2007

Pushdown automata with cancellation and commutation-augmented pregroups grammars.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Default theories over monadic languages.
Theor. Comput. Sci., 2006

Invariance under stuttering in a temporal logic of actions.
Theor. Comput. Sci., 2006

Regular Expressions for Languages over Infinite Alphabets.
Fundam. Inform., 2006

Polynomial multiplication over finite fields: from quadratic to straight-line complexity.
Computational Complexity, 2006

Preface.
Ann. Math. Artif. Intell., 2006

Complexity of Polynomial Multiplication over Finite Fields.
Proceedings of the Computer Science, 2006

2005
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields.
SIAM J. Comput., 2005

Default Theories Over Monadic Languages: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2005

A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.
Proceedings of the STACS 2005, 2005

Indistinguishability by Default.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004
Regular Expressions for Languages over Infinite Alphabets.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
An algebraic characterization of deterministic regular languages over infinite alphabets.
Theor. Comput. Sci., 2003

A Real-time Semantics of Temporal Logic of Actions.
J. Log. Comput., 2003

2002
Revisiting quantification in autoepistemic logic.
ACM Trans. Comput. Log., 2002

The Expressive Power of Temporal Logic of Actions.
J. Log. Comput., 2002

2000
First-order Non-monotonic Modal Logics.
Fundam. Inform., 2000

1999
Open Default Theories over Closed Domains.
Logic Journal of the IGPL, 1999

Similarity Preservation in Default Logic.
Ann. Math. Artif. Intell., 1999

Open Default Theories over Closed Domains.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

The Expressive Power of Temporal Logic of Actions (Extended Abstract).
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Extensions for Open Default Theories via the Domain Closure Assumption.
J. Log. Comput., 1998

Minimum Dominating Sets of Intervals on Lines.
Algorithmica, 1998

Context-Free Languages over Infinite Alphabets.
Acta Inf., 1998

1997
The elimination of de re formulas.
J. Philosophical Logic, 1997

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

1996
The Power of the "Always" Operator in First-Order Temporal Logic.
Theor. Comput. Sci., 1996

The Expressive Power of Second-Order Propositional Modal Logic.
Notre Dame Journal of Formal Logic, 1996

Extensions for Open Default Theories via the Domain Closure Assumption.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

1995
Semantical Analysis of Logic of Actions.
J. Log. Comput., 1995

A Comparative Study of Open Default Theories.
Artif. Intell., 1995

Minimum Dominating Sets of Intervals on Lines (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Finite-Memory Automata.
Theor. Comput. Sci., 1994

A Branching Time Logic with Past Operators.
J. Comput. Syst. Sci., 1994

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

1992
Finite Automata on Directed Graphs.
J. Comput. Syst. Sci., 1992

A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields.
J. Algorithms, 1992

1991
Nonmonotonic Default Modal Logics.
J. ACM, 1991

Embedding a default system into nonmonotonic logics.
Fundam. Inform., 1991

1990
Multiplication of Polynomials over Finite Fields.
SIAM J. Comput., 1990

Finite and Circular Path Models for Branching Time Logics.
J. Log. Comput., 1990

Nonmonotonic Default Modal Logics.
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

Finite-Memory Automata (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Multiplicative complexity of polynomial multiplication over finite fields.
J. ACM, 1989

A note on probabilistically verifying integer and polynomial products.
J. ACM, 1989

1988
Nonstandard connectives of intuitionistic propositional logic.
Notre Dame Journal of Formal Logic, 1988

Addition Requirements for Matrix and Transposed Matrix Products.
J. Algorithms, 1988

An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants.
J. Algorithms, 1988

1987
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor.
J. ACM, 1987

Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
A Lower Bound for Polynomial Multiplication.
Theor. Comput. Sci., 1985

A Classification of omega-Regular Languages.
Theor. Comput. Sci., 1985

1984
Mulltiplication of Polynomials over the Ring of Integers
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1981
Note on probabilistic algorithms in integer and polynomial arithmetic.
Proceedings of the SYMSAC 1981, 1981


  Loading...