- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 73 |      | Tamar Aizikowitz, Michael Kaminski: LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. CSR 2011: 345-358 |
| 2010 | ||
| 72 | | Daniel Genkin, Nissim Francez, Michael Kaminski: Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. Essays in Memory of Amir Pnueli 2010: 144-166 |
| 71 | | Michael Kaminski, Simone Martini: CSL 2008 special issue. ACM Trans. Comput. Log. 11(4): (2010) |
| 70 | | Michael Kaminski, Tony Tan: A Note on Two-pebble Automata Over Infinite Alphabets. Fundam. Inform. 98(4): 379-390 (2010) |
| 69 | | Michael Kaminski, Daniel Zeitlin: Finite-Memory Automata with Non-Deterministic Reassignment. Int. J. Found. Comput. Sci. 21(5): 741-760 (2010) |
| 68 | | Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski: Extending Free Pregroups with Lower Bounds. Studia Logica 95(3): 417-441 (2010) |
| 2009 | ||
| 67 | | 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 Springer 2009 |
| 66 | | Tamar Aizikowitz, Michael Kaminski: Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata. FG 2009: 1-16 |
| 65 | | Yulia Dubov, Michael Kaminski: The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. Languages: From Formal to Natural 2009: 107-127 |
| 2008 | ||
| 64 |  | 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 Springer 2008 |
| 63 | | Michael Kaminski, Daniel Zeitlin: Extending finite-memory automata with non-deterministic reassignment (Extended abstract). AFL 2008: 195-207 |
| 62 | | Michael Kaminski: A Non-Preferential Semantics of Non-Monotonic Modal Logic. ISAIM 2008 |
| 61 | | Michael Kaminski, Tony Tan: Tree Automata over Infinite Alphabets. Pillars of Computer Science 2008: 386-423 |
| 60 | | Tamar Aizikowitz, Michael Kaminski: Conjunctive Grammars and Alternating Pushdown Automata. WoLLIC 2008: 44-55 |
| 59 | | Michael Kaminski, Miroslaw Truszczynski: Preface. Ann. Math. Artif. Intell. 53(1-4): 1-3 (2008) |
| 58 | | Michael Kaminski: A non-preferential semantics of non-monotonic modal logic. Ann. Math. Artif. Intell. 53(1-4): 205-223 (2008) |
| 57 | | Michael Kaminski: Invariance Under Stuttering in a Temporal Logic without the "Until" Operator. Fundam. Inform. 82(1-2): 127-140 (2008) |
| 56 | | Benjamin Grimberg, Michael Kaminski: First-Order Ground Non-Monotonic Modal Logic. Fundam. Inform. 83(3): 253-276 (2008) |
| 55 | | Nissim Francez, Michael Kaminski: Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206(9-10): 1018-1032 (2008) |
| 54 | | Ariel Cohen, Michael Kaminski, Johann A. Makowsky: Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. Journal of Logic, Language and Information 17(3): 285-306 (2008) |
| 2007 | ||
| 53 | | Nissim Francez, Michael Kaminski: Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA 2007: 7-26 |
| 52 | | Michael Kaminski, Michael L. Tiomkin: The Modal Logic of Cluster-Decomposable Kripke Interpretations. Notre Dame Journal of Formal Logic 48(4): 511-520 (2007) |
| 51 | | Nissim Francez, Michael Kaminski: Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Studia Logica 87(2-3): 295-321 (2007) |
| 2006 | ||
| 50 | | Michael Kaminski: Complexity of Polynomial Multiplication over Finite Fields. CSR 2006: 2 |
| 49 | | Michael Kaminski: Preface. Ann. Math. Artif. Intell. 48(3-4): 107 (2006) |
| 48 | | Nader H. Bshouty, Michael Kaminski: Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Computational Complexity 15(3): 252-262 (2006) |
| 47 | | Michael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. Fundam. Inform. 69(3): 301-318 (2006) |
| 46 | | Michael Kaminski, Julia Rubin-Mosin: Default theories over monadic languages. Theor. Comput. Sci. 364(2): 241-253 (2006) |
| 45 | | Michael Kaminski: Invariance under stuttering in a temporal logic of actions. Theor. Comput. Sci. 368(1-2): 50-63 (2006) |
| 2005 | ||
| 44 | | Michael Kaminski: A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. STACS 2005: 485-495 |
| 43 | | Ariel Cohen, Michael Kaminski, Johann A. Makowsky: Indistinguishability by Default. We Will Show Them! (1) 2005: 415-428 |
| 42 | | Michael Kaminski, Julia Mosin: Default Theories Over Monadic Languages: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 123: 139-149 (2005) |
| 41 | | Michael Kaminski: A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM J. Comput. 34(4): 960-992 (2005) |
| 2004 | ||
| 40 | | Michael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178 |
| 2003 | ||
| 39 | | Michael Kaminski, Yael Yariv: A Real-time Semantics of Temporal Logic of Actions. J. Log. Comput. 13(6): 921-937 (2003) |
| 38 | | Nissim Francez, Michael Kaminski: An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306(1-3): 155-175 (2003) |
| 2002 | ||
| 37 | | Michael Kaminski, Guy Rey: Revisiting quantification in autoepistemic logic. ACM Trans. Comput. Log. 3(4): 542-561 (2002) |
| 36 | | Arkadi Estrin, Michael Kaminski: The Expressive Power of Temporal Logic of Actions. J. Log. Comput. 12(5): 839-859 (2002) |
| 2000 | ||
| 35 | | Michael Kaminski, Guy Rey: First-order Non-monotonic Modal Logics. Fundam. Inform. 42(3-4): 303-333 (2000) |
| 1999 | ||
| 34 | | Arkadi Estrin, Michael Kaminski: The Expressive Power of Temporal Logic of Actions (Extended Abstract). CONCUR 1999: 274-287 |
| 33 | | Michael Kaminski: Open Default Theories over Closed Domains. ESCQARU 1999: 201-207 |
| 32 | | Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski: Similarity Preservation in Default Logic. Ann. Math. Artif. Intell. 25(1-2): 137-160 (1999) |
| 31 | | Michael Kaminski: Open Default Theories over Closed Domains. Logic Journal of the IGPL 7(5): 577-589 (1999) |
| 1998 | ||
| 30 | | Edward Y. C. Cheng, Michael Kaminski: Context-Free Languages over Infinite Alphabets. Acta Inf. 35(3): 245-267 (1998) |
| 29 | | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998) |
| 28 | | 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 | ||
| 27 | | Michael Kaminski: A Note on the Stable Model Semantics for Logic Programs. (Research Note). Artif. Intell. 96(2): 467-479 (1997) |
| 1996 | ||
| 26 | | Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin: Extensions for Open Default Theories via the Domain Closure Assumption. JELIA 1996: 373-387 |
| 25 | | Michael Kaminski, Michael L. Tiomkin: The Expressive Power of Second-Order Propositional Modal Logic. Notre Dame Journal of Formal Logic 37(1): 35-43 (1996) |
| 24 | | 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) |
| 1995 | ||
| 23 | | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529 |
| 22 | | Michael Kaminski: A Comparative Study of Open Default Theories. Artif. Intell. 77(2): 285-319 (1995) |
| 21 | | Michael L. Tiomkin, Michael Kaminski: Semantical Analysis of Logic of Actions. J. Log. Comput. 5(2): 203-212 (1995) |
| 1994 | ||
| 20 | | Michael Kaminski: A Branching Time Logic with Past Operators. J. Comput. Syst. Sci. 49(2): 223-246 (1994) |
| 19 | | Michael Kaminski, Nissim Francez: Finite-Memory Automata. Theor. Comput. Sci. 134(2): 329-363 (1994) |
| 1993 | ||
| 18 | | Michael Kaminski: Interpretations of Open Default Theories in Non-Monotonic Logics. Ann. Math. Artif. Intell. 9(3-4): 307-325 (1993) |
| 1992 | ||
| 17 | | 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) |
| 16 | | Michael Kaminski, Shlomit S. Pinter: Finite Automata on Directed Graphs. J. Comput. Syst. Sci. 44(3): 425-446 (1992) |
| 1991 | ||
| 15 | | Michael Kaminski: Embedding a default system into nonmonotonic logics. Fundam. Inform. 14(3): 345-353 (1991) |
| 14 | | Michael L. Tiomkin, Michael Kaminski: Nonmonotonic Default Modal Logics. J. ACM 38(4): 963-984 (1991) |
| 1990 | ||
| 13 | | Michael Kaminski, Nissim Francez: Finite-Memory Automata (Extended Abstract) FOCS 1990: 683-688 |
| 12 | | Michael L. Tiomkin, Michael Kaminski: Nonmonotonic Default Modal Logics. TARK 1990: 73-83 |
| 11 | | Michael Kaminski, Michael L. Tiomkin: Finite and Circular Path Models for Branching Time Logics. J. Log. Comput. 1(1): 71-82 (1990) |
| 10 | | Nader H. Bshouty, Michael Kaminski: Multiplication of Polynomials over Finite Fields. SIAM J. Comput. 19(3): 452-456 (1990) |
| 1989 | ||
| 9 | | Michael Kaminski: A note on probabilistically verifying integer and polynomial products. J. ACM 36(1): 142-149 (1989) |
| 8 | | Michael Kaminski, Nader H. Bshouty: Multiplicative complexity of polynomial multiplication over finite fields. J. ACM 36(1): 150-170 (1989) |
| 1988 | ||
| 7 | | Michael Kaminski: An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. J. Algorithms 9(1): 137-147 (1988) |
| 6 | | Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty: Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9(3): 354-364 (1988) |
| 1987 | ||
| 5 | | Michael Kaminski, Nader H. Bshouty: Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) FOCS 1987: 138-140 |
| 4 | | 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) |
| 1985 | ||
| 3 | | Michael Kaminski: A Classification of omega-Regular Languages. Theor. Comput. Sci. 36: 217-229 (1985) |
| 2 | | Michael Kaminski: A Lower Bound for Polynomial Multiplication. Theor. Comput. Sci. 40: 319-322 (1985) |
| 1984 | ||
| 1 | | Michael Kaminski: Mulltiplication of Polynomials over the Ring of Integers FOCS 1984: 251-254 |
| 1 | Tamar Aizikowitz | [60] [66] [68] [73] |
| 2 | Amir Averbuch | [17] |
| 3 | Rachel Ben-Eliyahu-Zohary (Rachel Ben-Eliyahu) | [32] |
| 4 | Nader H. Bshouty | [5] [6] [8] [10] [17] [48] |
| 5 | Edward Y. C. Cheng | [30] |
| 6 | Siu-Wing Cheng | [23] [29] |
| 7 | Ariel Cohen | [43] [54] |
| 8 | Yulia Dubov | [65] |
| 9 | Arkadi Estrin | [34] [36] |
| 10 | Nissim Francez | [13] [19] [32] [38] [51] [53] [55] [68] [72] |
| 11 | Daniel Genkin | [68] [72] |
| 12 | Benjamin Grimberg | [56] |
| 13 | Orna Grumberg | [67] |
| 14 | Shmuel Katz | [67] |
| 15 | David G. Kirkpatrick | [6] |
| 16 | Johann A. Makowsky (Janos Makowsky) | [26] [28] [43] [54] |
| 17 | Simone Martini | [64] [71] |
| 18 | Shlomit S. Pinter | [16] |
| 19 | Guy Rey | [35] [37] |
| 20 | Julia Rubin (Julia Rubin-Mosin, Julia Mosin) | [42] [46] |
| 21 | Tony Tan | [40] [47] [61] [70] |
| 22 | Michael L. Tiomkin | [11] [12] [14] [21] [25] [26] [28] [52] |
| 23 | Miroslaw Truszczynski | [59] |
| 24 | Shuly Wintner | [67] |
| 25 | Chung Kei Wong | [24] |
| 26 | Yael Yariv | [39] |
| 27 | Shmuel Zaks | [23] [29] |
| 28 | Daniel Zeitlin | [63] [69] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page