Statistics
Publications
18
Citations
564
H-Index
15
Active since
1994
Max Kanovich is an author at University of Pennsylvania specializing in computing, computer science, and formal methods.
Publications per year
1994–2019
18
18
Horn programming in linear logic is NP-complete
Max Kanovich · 2003 · 73 citations
Inductive methods and contract-signing protocols
Rohit Chadha, Max Kanovich, Andre Scedrov · 2001 · 60 citations
The complexity of Horn fragments of Linear Logic
Max Kanovich · Annals of Pure and Applied Logic · 1994 · 48 citations
Linear logic as a logic of computations
Max Kanovich · Annals of Pure and Applied Logic · 1994 · 48 citations
1–5 of 18