Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Virgile Mogbil" ( http://dblp.L3S.de/Authors/Virgile_Mogbil )

  Author page on DBLP  Author page in RDF  Community of Virgile Mogbil in ASPL-2

Publication years (Num. hits)
2001-2011 (13)
Publication types (Num. hits)
article(5) inproceedings(8)
Venues (Conferences, Journals, ...)
CoRR(2) CSL(2) Theor. Comput. Sci.(2) Electr. Notes Theor. Comput. S...(1) ESOP(1) FOPARA(1) FoSSaCS(1) LFCS(1) LICS(1) RP(1)
Authors
Virgile Mogbil(13) Paulin Jacobé de Naurois(4) Patrick Baillot(3) Christophe Fouqueré(2) Marco Gaboardi(1) Thomas Krantz(1) Vincent Rahli(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords
Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Paulin Jacobé de Naurois, Virgile Mogbil Correctness of linear logic proof structures is NL-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paulin Jacobé de Naurois, Virgile Mogbil Rewriting Systems for Reachability in Vector Addition Systems with Pairs. Search on Bibsonomy RP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Patrick Baillot, Marco Gaboardi, Virgile Mogbil A PolyTime Functional Language from Light Linear Logic. Search on Bibsonomy ESOP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Virgile Mogbil Non-deterministic Boolean Proof Nets. Search on Bibsonomy FOPARA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christophe Fouqueré, Virgile Mogbil Rewritings for Polarized Multiplicative and Exponential Proof Structures. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Paulin Jacobé de Naurois, Virgile Mogbil Correctness of Multiplicative Additive Proof Structures is NL-Complete. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Correctness Criterion, Multiplicative Additive Linear Logic, NL-completness, Computational Complexity, proof-nets
1Virgile Mogbil, Vincent Rahli Uniform Circuits, & Boolean Proof Nets. Search on Bibsonomy LFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Paulin Jacobé de Naurois, Virgile Mogbil Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christophe Fouqueré, Virgile Mogbil Modules and Logic Programming Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Patrick Baillot, Virgile Mogbil Soft lambda-Calculus: A Language for Polynomial Time Computation. Search on Bibsonomy FoSSaCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Patrick Baillot, Virgile Mogbil Soft lambda-calculus: a language for polynomial time computation Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Thomas Krantz, Virgile Mogbil Encoding Hamiltonian circuits into multiplicative linear logic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Virgile Mogbil Quadratic Correctness Criterion for Non-commutative Logic. Search on Bibsonomy CSL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.