default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Kaminski
Person information
- affiliation: Technion-IIT, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j67]Michael Kaminski
:
On undecidability of the propositional logic of an associative binary modality. Arch. Math. Log. 63(7-8): 837-857 (2024)- 2023
- [j66]Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
On sets of linear forms of maximal complexity. Comput. Complex. 32(1): 1 (2023) - 2022
- [j65]Michael Kaminski:
A Note on Calculi for Non-deterministic Many-valued Logics. Fundam. Informaticae 186(1-4): 143-153 (2022) - [j64]Michael Kaminski:
Extending the Lambek Calculus with Classical Negation. Stud Logica 110(2): 295-317 (2022) - 2021
- [j63]Michael Kaminski, Nissim Francez:
Calculi for Many-Valued Logics. Logica Universalis 15(2): 193-226 (2021) - [c25]Michael Kaminski, Igor E. Shparlinski:
Sets of Linear Forms Which Are Hard to Compute. MFCS 2021: 66:1-66:22 - [i2]Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
On sets of linear forms of maximal complexity. CoRR abs/2110.04657 (2021) - [i1]Michael Kaminski:
A note on calculi for non-deterministic many-valued logics. CoRR abs/2112.07377 (2021) - 2020
- [j62]Michael Kaminski, Nissim Francez:
De Morgan Interpretation of the Lambek-Grishin Calculus. Rev. Symb. Log. 13(4): 845-856 (2020)
2010 – 2019
- 2019
- [j61]Nissim Francez, Michael Kaminski:
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics. FLAP 6(2): 255-290 (2019) - [j60]Nissim Francez, Michael Kaminski:
Structural Rules for Multi-valued Logics. Logica Universalis 13(1): 65-75 (2019) - 2018
- [c24]Daniel Genkin, Michael Kaminski, Liat Peterfreund:
Closure Under Reversal of Languages over Infinite Alphabets. CSR 2018: 145-156 - 2017
- [j59]Nissim Francez, Michael Kaminski:
A Proof-Theoretic Semantics for Exclusion. Logica Universalis 11(4): 489-505 (2017) - 2016
- [j58]Tamar Aizikowitz, Michael Kaminski:
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata. J. Comput. Syst. Sci. 82(8): 1329-1359 (2016) - [j57]Michael Kaminski, Nissim Francez:
The Lambek Calculus Extended with Intuitionistic Propositional Logic. Stud Logica 104(5): 1051-1082 (2016) - 2014
- [j56]Tamar Aizikowitz, Michael Kaminski:
Linear Conjunctive Grammars and One-turn Synchronized Alternating Pushdown Automata. Int. J. Found. Comput. Sci. 25(6): 781- (2014) - [j55]Michael Kaminski, Nissim Francez:
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. Stud Logica 102(3): 479-497 (2014) - [j54]Daniel Genkin, Michael Kaminski, Liat Peterfreund:
A note on the emptiness problem for alternating finite-memory automata. Theor. Comput. Sci. 526: 97-107 (2014) - 2013
- [j53]Tamar Aizikowitz, Michael Kaminski:
Conjunctive grammars and alternating pushdown automata. Acta Informatica 50(3): 175-197 (2013) - [j52]Michael Kaminski, Chaoping Xing:
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE Trans. Inf. Theory 59(10): 6845-6850 (2013) - 2011
- [c23]Tamar Aizikowitz, Michael Kaminski:
LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. CSR 2011: 345-358 - 2010
- [j51]Michael Kaminski, Tony Tan:
A Note on Two-pebble Automata Over Infinite Alphabets. Fundam. Informaticae 98(4): 379-390 (2010) - [j50]Michael Kaminski, Daniel Zeitlin:
Finite-Memory Automata with Non-Deterministic Reassignment. Int. J. Found. Comput. Sci. 21(5): 741-760 (2010) - [j49]Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski:
Extending Free Pregroups with Lower Bounds. Stud Logica 95(3): 417-441 (2010) - [j48]Michael Kaminski, Simone Martini:
CSL 2008 special issue. ACM Trans. Comput. Log. 11(4): 21:1 (2010) - [c22]Daniel Genkin, Nissim Francez, Michael Kaminski:
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. Essays in Memory of Amir Pnueli 2010: 144-166
2000 – 2009
- 2009
- [c21]Yulia Dubov, Michael Kaminski:
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. Languages: From Formal to Natural 2009: 107-127 - [c20]Tamar Aizikowitz, Michael Kaminski:
Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata. FG 2009: 1-16 - [e2]Orna Grumberg, Michael Kaminski, Shmuel Katz, Shuly Wintner:
Languages: From Formal to Natural, Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 5533, Springer 2009, ISBN 978-3-642-01747-6 [contents] - 2008
- [j47]Michael Kaminski, Miroslaw Truszczynski:
Preface. Ann. Math. Artif. Intell. 53(1-4): 1-3 (2008) - [j46]Michael Kaminski:
A non-preferential semantics of non-monotonic modal logic. Ann. Math. Artif. Intell. 53(1-4): 205-223 (2008) - [j45]Michael Kaminski:
Invariance Under Stuttering in a Temporal Logic without the "Until" Operator. Fundam. Informaticae 82(1-2): 127-140 (2008) - [j44]Benjamin Grimberg, Michael Kaminski:
First-Order Ground Non-Monotonic Modal Logic. Fundam. Informaticae 83(3): 253-276 (2008) - [j43]Nissim Francez, Michael Kaminski:
Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206(9-10): 1018-1032 (2008) - [j42]Ariel Cohen, Michael Kaminski, Johann A. Makowsky:
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. J. Log. Lang. Inf. 17(3): 285-306 (2008) - [c19]Michael Kaminski, Daniel Zeitlin:
Extending finite-memory automata with non-deterministic reassignment (Extended abstract). AFL 2008: 195-207 - [c18]Michael Kaminski, Tony Tan:
Tree Automata over Infinite Alphabets. Pillars of Computer Science 2008: 386-423 - [c17]Michael Kaminski:
A Non-Preferential Semantics of Non-Monotonic Modal Logic. ISAIM 2008 - [c16]Tamar Aizikowitz, Michael Kaminski:
Conjunctive Grammars and Alternating Pushdown Automata. WoLLIC 2008: 44-55 - [e1]Michael Kaminski, Simone Martini:
Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings. Lecture Notes in Computer Science 5213, Springer 2008, ISBN 978-3-540-87530-7 [contents] - 2007
- [j41]Michael Kaminski, Michael L. Tiomkin:
The Modal Logic of Cluster-Decomposable Kripke Interpretations. Notre Dame J. Formal Log. 48(4): 511-520 (2007) - [j40]Nissim Francez, Michael Kaminski:
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Stud Logica 87(2-3): 295-321 (2007) - [c15]Nissim Francez, Michael Kaminski:
Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA 2007: 7-26 - 2006
- [j39]Michael Kaminski:
Preface. Ann. Math. Artif. Intell. 48(3-4): 107 (2006) - [j38]Nader H. Bshouty, Michael Kaminski:
Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Comput. Complex. 15(3): 252-262 (2006) - [j37]Michael Kaminski, Tony Tan:
Regular Expressions for Languages over Infinite Alphabets. Fundam. Informaticae 69(3): 301-318 (2006) - [j36]Michael Kaminski, Julia Rubin-Mosin:
Default theories over monadic languages. Theor. Comput. Sci. 364(2): 241-253 (2006) - [j35]Michael Kaminski:
Invariance under stuttering in a temporal logic of actions. Theor. Comput. Sci. 368(1-2): 50-63 (2006) - [c14]Michael Kaminski:
Complexity of Polynomial Multiplication over Finite Fields. CSR 2006: 2 - 2005
- [j34]Michael Kaminski:
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM J. Comput. 34(4): 960-992 (2005) - [c13]Ariel Cohen, Michael Kaminski, Johann A. Makowsky:
Indistinguishability by Default. We Will Show Them! (1) 2005: 415-428 - [c12]Michael Kaminski:
A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. STACS 2005: 485-495 - 2004
- [c11]Michael Kaminski, Tony Tan:
Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178 - [c10]Michael Kaminski, Julia Mosin:
Default Theories Over Monadic Languages: (Extended Abstract). WoLLIC 2004: 139-149 - 2003
- [j33]Michael Kaminski, Yael Yariv:
A Real-time Semantics of Temporal Logic of Actions. J. Log. Comput. 13(6): 921-937 (2003) - [j32]Nissim Francez, Michael Kaminski:
An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306(1-3): 155-175 (2003) - 2002
- [j31]Arkadi Estrin, Michael Kaminski:
The Expressive Power of Temporal Logic of Actions. J. Log. Comput. 12(5): 839-859 (2002) - [j30]Michael Kaminski, Guy Rey:
Revisiting quantification in autoepistemic logic. ACM Trans. Comput. Log. 3(4): 542-561 (2002) - 2000
- [j29]Michael Kaminski, Guy Rey:
First-order Non-monotonic Modal Logics. Fundam. Informaticae 42(3-4): 303-333 (2000)
1990 – 1999
- 1999
- [j28]Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski:
Similarity Preservation in Default Logic. Ann. Math. Artif. Intell. 25(1-2): 137-160 (1999) - [j27]Michael Kaminski:
Open Default Theories over Closed Domains. Log. J. IGPL 7(5): 577-589 (1999) - [c9]Arkadi Estrin, Michael Kaminski:
The Expressive Power of Temporal Logic of Actions (Extended Abstract). CONCUR 1999: 274-287 - [c8]Michael Kaminski:
Open Default Theories over Closed Domains. ESCQARU 1999: 201-207 - 1998
- [j26]Edward Y. C. Cheng, Michael Kaminski:
Context-Free Languages over Infinite Alphabets. Acta Informatica 35(3): 245-267 (1998) - [j25]Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998) - [j24]Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin:
Extensions for Open Default Theories via the Domain Closure Assumption. J. Log. Comput. 8(2): 169-187 (1998) - 1997
- [j23]Michael Kaminski:
A Note on the Stable Model Semantics for Logic Programs. (Research Note). Artif. Intell. 96(2): 467-479 (1997) - [j22]Michael Kaminski:
The elimination of de re formulas. J. Philos. Log. 26(4): 411-422 (1997) - 1996
- [j21]Michael Kaminski, Michael L. Tiomkin:
The Expressive Power of Second-Order Propositional Modal Logic. Notre Dame J. Formal Log. 37(1): 35-43 (1996) - [j20]Michael Kaminski, Chung Kei Wong:
The Power of the "Always" Operator in First-Order Temporal Logic. Theor. Comput. Sci. 160(1&2): 271-281 (1996) - [c7]Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin:
Extensions for Open Default Theories via the Domain Closure Assumption. JELIA 1996: 373-387 - 1995
- [j19]Michael Kaminski:
A Comparative Study of Open Default Theories. Artif. Intell. 77(2): 285-319 (1995) - [j18]Michael L. Tiomkin, Michael Kaminski:
Semantical Analysis of Logic of Actions. J. Log. Comput. 5(2): 203-212 (1995) - [c6]Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529 - 1994
- [j17]Michael Kaminski:
A Branching Time Logic with Past Operators. J. Comput. Syst. Sci. 49(2): 223-246 (1994) - [j16]Michael Kaminski, Nissim Francez:
Finite-Memory Automata. Theor. Comput. Sci. 134(2): 329-363 (1994) - 1993
- [j15]Michael Kaminski:
Interpretations of Open Default Theories in Non-Monotonic Logics. Ann. Math. Artif. Intell. 9(3-4): 307-325 (1993) - 1992
- [j14]Amir Averbuch, Nader H. Bshouty, Michael Kaminski:
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. J. Algorithms 13(4): 577-588 (1992) - [j13]Michael Kaminski, Shlomit S. Pinter:
Finite Automata on Directed Graphs. J. Comput. Syst. Sci. 44(3): 425-446 (1992) - 1991
- [j12]Michael Kaminski:
Embedding a default system into nonmonotonic logics. Fundam. Informaticae 14(3): 345-353 (1991) - [j11]Michael L. Tiomkin, Michael Kaminski:
Nonmonotonic Default Modal Logics. J. ACM 38(4): 963-984 (1991) - 1990
- [j10]Michael Kaminski, Michael L. Tiomkin:
Finite and Circular Path Models for Branching Time Logics. J. Log. Comput. 1(1): 71-82 (1990) - [j9]Nader H. Bshouty, Michael Kaminski:
Multiplication of Polynomials over Finite Fields. SIAM J. Comput. 19(3): 452-456 (1990) - [c5]Michael Kaminski, Nissim Francez:
Finite-Memory Automata (Extended Abstract). FOCS 1990: 683-688 - [c4]Michael L. Tiomkin, Michael Kaminski:
Nonmonotonic Default Modal Logics. TARK 1990: 73-83
1980 – 1989
- 1989
- [j8]Michael Kaminski:
A note on probabilistically verifying integer and polynomial products. J. ACM 36(1): 142-149 (1989) - [j7]Michael Kaminski, Nader H. Bshouty:
Multiplicative complexity of polynomial multiplication over finite fields. J. ACM 36(1): 150-170 (1989) - 1988
- [j6]Michael Kaminski:
An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. J. Algorithms 9(1): 137-147 (1988) - [j5]Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty:
Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9(3): 354-364 (1988) - [j4]Michael Kaminski:
Nonstandard connectives of intuitionistic propositional logic. Notre Dame J. Formal Log. 29(3): 309-331 (1988) - 1987
- [j3]Michael Kaminski:
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. J. ACM 34(4): 968-984 (1987) - [c3]Michael Kaminski, Nader H. Bshouty:
Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract). FOCS 1987: 138-140 - 1985
- [j2]Michael Kaminski:
A Classification of omega-Regular Languages. Theor. Comput. Sci. 36: 217-229 (1985) - [j1]Michael Kaminski:
A Lower Bound for Polynomial Multiplication. Theor. Comput. Sci. 40: 319-322 (1985) - 1984
- [c2]Michael Kaminski:
Mulltiplication of Polynomials over the Ring of Integers. FOCS 1984: 251-254 - 1982
- [b1]Michael Kaminski:
אלגוריתמים לכפל פולינומים ומספרים שלמים (Algorithms for polynomial and integer multiplication.). Hebrew University of Jerusalem, Israel, 1982 - 1981
- [c1]Michael Kaminski:
Note on probabilistic algorithms in integer and polynomial arithmetic. SYMSACC 1981: 117-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
