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