The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Max I. Kanovich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Max I. Kanovich
    Efficient Program Synthesis: Semantics, Logic, Complexity. [Citation Graph (1, 0)][DBLP]
    TACS, 1991, pp:615-632 [Conf]
  2. Rohit Chadha, Max I. Kanovich, Andre Scedrov
    Inductive methods and contract-signing protocols. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2001, pp:176-185 [Conf]
  3. Max I. Kanovich, Zoya M. Shalyapina
    The Rumors System Of Russian Synthesis. [Citation Graph (0, 0)][DBLP]
    COLING, 1994, pp:177-179 [Conf]
  4. Max I. Kanovich
    The Expressive Power of Horn Monadic Linear Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:39-53 [Conf]
  5. Max I. Kanovich
    Bijections between Partitions by Two-Directional Rewriting Techniques. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:44-58 [Conf]
  6. Max I. Kanovich, Jacqueline Vauzeilles
    Coping Polynomially with Numerous but Identical Elements within Planning Problems. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:285-298 [Conf]
  7. Max I. Kanovich
    What is the Logic of Computational Tasks? [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:181-185 [Conf]
  8. Max I. Kanovich
    Computational and Concurrency Aspects of Linear Logic. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:336-341 [Conf]
  9. Max I. Kanovich
    Computational and Concurrency Models of Linear Logic. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:184-190 [Conf]
  10. Max I. Kanovich
    Horn Programming in Linear Logic Is NP-Complete [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:200-210 [Conf]
  11. Max I. Kanovich
    The Complexity of Neutrals in Linear Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:486-495 [Conf]
  12. Max I. Kanovich, Takayasu Ito
    Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:48-57 [Conf]
  13. Max I. Kanovich
    Petri Nets, Horn Programs, Linear Logic, and Vector Games. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:642-666 [Conf]
  14. Max I. Kanovich
    Simulating Guarded Programs in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Theory and Practice of Parallel Programming, 1994, pp:45-69 [Conf]
  15. Max I. Kanovich
    The Complexity of Horn Fragments of Linear Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:69, n:2-3, pp:195-241 [Journal]
  16. Max I. Kanovich
    Linear Logic as a Logic of Computations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:183-212 [Journal]
  17. Max I. Kanovich
    Petri Nets, Horn Programs, Linear Logic and Vector Games. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:107-135 [Journal]
  18. Max I. Kanovich
    Linear Logic Automata. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:147-188 [Journal]
  19. Max I. Kanovich
    Finding direct partition bijections by two-directional rewriting techniques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:151-166 [Journal]
  20. Max I. Kanovich
    The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:15, pp:1909-1935 [Journal]
  21. Max I. Kanovich
    Simulating Computations in Second Order Non-Commutative Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  22. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:6, n:, pp:- [Journal]
  23. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Specifying Real-Time Finite-State Systems in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:1, pp:- [Journal]
  24. Max I. Kanovich
    Efficient Program Synthesis in Computational Models. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1990, v:9, n:2&3, pp:159-177 [Journal]
  25. Max I. Kanovich, Jacqueline Vauzeilles
    The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:6, pp:689-716 [Journal]
  26. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:3, pp:525-549 [Journal]
  27. Max I. Kanovich
    A Note on Rewriting Proofs and Fibonacci Numbers. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:284-292 [Conf]
  28. Max I. Kanovich, Jacqueline Vauzeilles
    Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:84-119 [Journal]

  29. Policy Compliance in Collaborative Systems. [Citation Graph (, )][DBLP]


  30. Collaborative Planning With Privacy. [Citation Graph (, )][DBLP]


  31. Light Linear Logic with Controlled Weakening. [Citation Graph (, )][DBLP]


  32. Undecidability of Propositional Separation Logic and Its Neighbours. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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