Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
U. Sharma
Rudolf Mayer
Claudia Calabrese
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Xiaozhou Li
Radu Timofte
Kuanrui Yin
Home
/
Author
/
VIRGILE MOGBIL
Author Info
Open Visualization
Name
Affiliation
Papers
VIRGILE MOGBIL
LIPN --- UMR7030, CNRS --- Université Paris 13, France
14
Collaborators
Citations
PageRank
8
69
6.77
Referers
Referees
References
75
161
177
Search Limit
100
161
Publications (14 rows)
Collaborators (8 rows)
Referers (75 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
An Interpretation of CCS into Ludics.
0
0.34
2018
Proofs as executions
1
0.37
2012
Correctness of linear logic proof structures is NL-complete
6
0.57
2011
Rewriting systems for reachability in vector addition systems with pairs
0
0.34
2010
A polytime functional language from light linear logic
17
0.75
2010
Non-deterministic Boolean proof nets
3
0.44
2009
Correctness of Multiplicative Additive Proof Structures is NL-Complete
3
0.42
2008
Rewritings for Polarized Multiplicative and Exponential Proof Structures
3
0.41
2008
Correctness of multiplicative (and exponential) proof structures is NL-complete
3
0.42
2007
Uniform Circuits, & Boolean Proof Nets
2
0.43
2007
Modules and Logic Programming
0
0.34
2004
Soft lambda-calculus: a language for polynomial time computation
28
1.17
2003
Quadratic Correctness Criterion for Non-commutative Logic
2
0.39
2001
Encoding Hamiltonian circuits into multiplicative linear logic
1
0.39
2001
1