The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Kaminski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Kaminski, Nissim Francez
    Finite-Memory Automata (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:683-688 [Conf]
  2. Ariel Cohen, Michael Kaminski, Johann A. Makowsky
    Indistinguishability by Default. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:415-428 [Conf]
  3. Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
    Minimum Dominating Sets of Intervals on Lines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:520-529 [Conf]
  4. Michael Kaminski, Tony Tan
    Regular Expressions for Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:171-178 [Conf]
  5. Arkadi Estrin, Michael Kaminski
    The Expressive Power of Temporal Logic of Actions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:274-287 [Conf]
  6. Michael Kaminski
    Complexity of Polynomial Multiplication over Finite Fields. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:2- [Conf]
  7. Michael Kaminski
    Open Default Theories over Closed Domains. [Citation Graph (0, 0)][DBLP]
    ESCQARU, 1999, pp:201-207 [Conf]
  8. Michael Kaminski
    Mulltiplication of Polynomials over the Ring of Integers [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:251-254 [Conf]
  9. Michael Kaminski, Nader H. Bshouty
    Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:138-140 [Conf]
  10. Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
    Extensions for Open Default Theories via the Domain Closure Assumption. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:373-387 [Conf]
  11. Michael Kaminski
    A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:485-495 [Conf]
  12. Michael L. Tiomkin, Michael Kaminski
    Nonmonotonic Default Modal Logics. [Citation Graph (0, 0)][DBLP]
    TARK, 1990, pp:73-83 [Conf]
  13. Edward Y. C. Cheng, Michael Kaminski
    Context-Free Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:3, pp:245-267 [Journal]
  14. Michael Kaminski
    A Comparative Study of Open Default Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:77, n:2, pp:285-319 [Journal]
  15. Michael Kaminski
    A Note on the Stable Model Semantics for Logic Programs. (Research Note). [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:96, n:2, pp:467-479 [Journal]
  16. Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
    Minimum Dominating Sets of Intervals on Lines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:3, pp:294-308 [Journal]
  17. Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski
    Similarity Preservation in Default Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:25, n:1-2, pp:137-160 [Journal]
  18. Michael Kaminski
    Interpretations of Open Default Theories in Non-Monotonic Logics. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1993, v:9, n:3-4, pp:307-325 [Journal]
  19. Nader H. Bshouty, Michael Kaminski
    Polynomial multiplication over finite fields: from quadratic to straight-line complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:3, pp:252-262 [Journal]
  20. Michael Kaminski, Julia Mosin
    Default Theories Over Monadic Languages: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:139-149 [Journal]
  21. Michael Kaminski
    Embedding a default system into nonmonotonic logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:14, n:3, pp:345-353 [Journal]
  22. Michael Kaminski, Guy Rey
    First-order Non-monotonic Modal Logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:42, n:3-4, pp:303-333 [Journal]
  23. Michael Kaminski, Tony Tan
    Regular Expressions for Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:69, n:3, pp:301-318 [Journal]
  24. Michael Kaminski
    Open Default Theories over Closed Domains. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1999, v:7, n:5, pp:577-589 [Journal]
  25. Michael Kaminski
    A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:4, pp:968-984 [Journal]
  26. Michael Kaminski
    A note on probabilistically verifying integer and polynomial products. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:142-149 [Journal]
  27. Michael Kaminski, Nader H. Bshouty
    Multiplicative complexity of polynomial multiplication over finite fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:150-170 [Journal]
  28. Michael L. Tiomkin, Michael Kaminski
    Nonmonotonic Default Modal Logics. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:4, pp:963-984 [Journal]
  29. Amir Averbuch, Nader H. Bshouty, Michael Kaminski
    A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:4, pp:577-588 [Journal]
  30. Michael Kaminski
    An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:1, pp:137-147 [Journal]
  31. Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
    Addition Requirements for Matrix and Transposed Matrix Products. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:354-364 [Journal]
  32. Michael Kaminski, Shlomit S. Pinter
    Finite Automata on Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:3, pp:425-446 [Journal]
  33. Michael Kaminski
    A Branching Time Logic with Past Operators. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:223-246 [Journal]
  34. Arkadi Estrin, Michael Kaminski
    The Expressive Power of Temporal Logic of Actions. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:5, pp:839-859 [Journal]
  35. Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
    Extensions for Open Default Theories via the Domain Closure Assumption. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:2, pp:169-187 [Journal]
  36. Michael Kaminski, Michael L. Tiomkin
    Finite and Circular Path Models for Branching Time Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:1, pp:71-82 [Journal]
  37. Michael Kaminski, Yael Yariv
    A Real-time Semantics of Temporal Logic of Actions. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:6, pp:921-937 [Journal]
  38. Michael L. Tiomkin, Michael Kaminski
    Semantical Analysis of Logic of Actions. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:2, pp:203-212 [Journal]
  39. Michael Kaminski, Michael L. Tiomkin
    The Expressive Power of Second-Order Propositional Modal Logic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1996, v:37, n:1, pp:35-43 [Journal]
  40. Nader H. Bshouty, Michael Kaminski
    Multiplication of Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:452-456 [Journal]
  41. Michael Kaminski
    A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:960-992 [Journal]
  42. Nissim Francez, Michael Kaminski
    An algebraic characterization of deterministic regular languages over infinite alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:155-175 [Journal]
  43. Michael Kaminski
    A Classification of omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:217-229 [Journal]
  44. Michael Kaminski
    A Lower Bound for Polynomial Multiplication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:319-322 [Journal]
  45. Michael Kaminski, Nissim Francez
    Finite-Memory Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:329-363 [Journal]
  46. Michael Kaminski, Julia Rubin-Mosin
    Default theories over monadic languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:2, pp:241-253 [Journal]
  47. Michael Kaminski, Chung Kei Wong
    The Power of the "Always" Operator in First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:271-281 [Journal]
  48. Michael Kaminski
    Invariance under stuttering in a temporal logic of actions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:1-2, pp:50-63 [Journal]
  49. Michael Kaminski, Guy Rey
    Revisiting quantification in autoepistemic logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2002, v:3, n:4, pp:542-561 [Journal]
  50. Michael Kaminski
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:48, n:3-4, pp:107- [Journal]

  51. Tree Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]


  52. The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. [Citation Graph (, )][DBLP]


  53. Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. [Citation Graph (, )][DBLP]


  54. Conjunctive Grammars and Alternating Pushdown Automata. [Citation Graph (, )][DBLP]


  55. A non-preferential semantics of non-monotonic modal logic. [Citation Graph (, )][DBLP]


  56. Preface. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002