dblp.uni-trier.dewww.uni-trier.de

Michael Kaminski Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
62EEOrna 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
61EEYulia Dubov, Michael Kaminski: The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. Languages: From Formal to Natural 2009: 107-127
2008
60 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
59EEMichael Kaminski, Tony Tan: Tree Automata over Infinite Alphabets. Pillars of Computer Science 2008: 386-423
58EETamar Aizikowitz, Michael Kaminski: Conjunctive Grammars and Alternating Pushdown Automata. WoLLIC 2008: 44-55
57EEMichael Kaminski, Miroslaw Truszczynski: Preface. Ann. Math. Artif. Intell. 53(1-4): 1-3 (2008)
56EEMichael Kaminski: A non-preferential semantics of non-monotonic modal logic. Ann. Math. Artif. Intell. 53(1-4): 205-223 (2008)
55EEMichael Kaminski: Invariance Under Stuttering in a Temporal Logic without the "Until" Operator. Fundam. Inform. 82(1-2): 127-140 (2008)
54EEBenjamin Grimberg, Michael Kaminski: First-Order Ground Non-Monotonic Modal Logic. Fundam. Inform. 83(3): 253-276 (2008)
53EENissim Francez, Michael Kaminski: Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206(9-10): 1018-1032 (2008)
52EEAriel 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
51EENissim Francez, Michael Kaminski: Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Studia Logica 87(2-3): 295-321 (2007)
2006
50EEMichael Kaminski: Complexity of Polynomial Multiplication over Finite Fields. CSR 2006: 2
49EEMichael Kaminski: Preface. Ann. Math. Artif. Intell. 48(3-4): 107 (2006)
48EENader H. Bshouty, Michael Kaminski: Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Computational Complexity 15(3): 252-262 (2006)
47EEMichael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. Fundam. Inform. 69(3): 301-318 (2006)
46EEMichael Kaminski, Julia Rubin-Mosin: Default theories over monadic languages. Theor. Comput. Sci. 364(2): 241-253 (2006)
45EEMichael Kaminski: Invariance under stuttering in a temporal logic of actions. Theor. Comput. Sci. 368(1-2): 50-63 (2006)
2005
44EEMichael 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
42EEMichael Kaminski, Julia Mosin: Default Theories Over Monadic Languages: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 123: 139-149 (2005)
41EEMichael Kaminski: A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM J. Comput. 34(4): 960-992 (2005)
2004
40EEMichael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178
2003
39EEMichael Kaminski, Yael Yariv: A Real-time Semantics of Temporal Logic of Actions. J. Log. Comput. 13(6): 921-937 (2003)
38EENissim Francez, Michael Kaminski: An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306(1-3): 155-175 (2003)
2002
37EEMichael Kaminski, Guy Rey: Revisiting quantification in autoepistemic logic. ACM Trans. Comput. Log. 3(4): 542-561 (2002)
36EEArkadi 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
34EEArkadi Estrin, Michael Kaminski: The Expressive Power of Temporal Logic of Actions (Extended Abstract). CONCUR 1999: 274-287
33EEMichael 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)
31EEMichael Kaminski: Open Default Theories over Closed Domains. Logic Journal of the IGPL 7(5): 577-589 (1999)
1998
30EEEdward 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
27EEMichael Kaminski: A Note on the Stable Model Semantics for Logic Programs. (Research Note). Artif. Intell. 96(2): 467-479 (1997)
1996
26EEMichael 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)
24EEMichael 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
22EEMichael 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)
14EEMichael 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
9EEMichael Kaminski: A note on probabilistically verifying integer and polynomial products. J. ACM 36(1): 142-149 (1989)
8EEMichael 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
4EEMichael 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

Coauthor Index

1Tamar Aizikowitz [58]
2Amir Averbuch [17]
3Rachel Ben-Eliyahu-Zohary (Rachel Ben-Eliyahu) [32]
4Nader H. Bshouty [5] [6] [8] [10] [17] [48]
5Edward Y. C. Cheng [30]
6Siu-Wing Cheng [23] [29]
7Ariel Cohen [43] [52]
8Yulia Dubov [61]
9Arkadi Estrin [34] [36]
10Nissim Francez [13] [19] [32] [38] [51] [53]
11Benjamin Grimberg [54]
12Orna Grumberg [62]
13Shmuel Katz [62]
14David G. Kirkpatrick [6]
15Johann A. Makowsky (Janos Makowsky) [26] [28] [43] [52]
16Simone Martini [60]
17Julia Mosin [42]
18Shlomit S. Pinter [16]
19Guy Rey [35] [37]
20Julia Rubin-Mosin [46]
21Tony Tan [40] [47] [59]
22Michael L. Tiomkin [11] [12] [14] [21] [25] [26] [28]
23Miroslaw Truszczynski [57]
24Shuly Wintner [62]
25Chung Kei Wong [24]
26Yael Yariv [39]
27Shmuel Zaks [23] [29]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)