Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(7)
Barnaby Martin
7
Iain A. Stewart
5
Stefan S. Dantchev
1
Tomas Feder (Tomás Feder)
1
Yonghong Xiang
1
Conferences
(6)
LICS
3
CIE
2
CP
1
CSL
1
ICPADS
1
Journals
(6)
SIAMCOMP
1
TOCL
1
ARSCOM
1
TCS
1
DM
1
Keywords
(29)
Embed
Subscribe
Academic
Authors
Florent R. Madelaine
Florent R. Madelaine,University of Auvergne,Algorithms & Theory,Software Engineering,Distributed & Parallel Computing
Edit
Florent R. Madelaine
University of Auvergne
Publications:
16
|
Citations:
42
Fields:
Algorithms & Theory
,
Software Engineering
,
Distributed & Parallel Computing
View FAQ about top research areas and Fields of study
Collaborated with
7 co-authors
from 2003 to 2012
|
Cited by
32 authors
Cumulative
Annual
Sort by:
Publications
(16)
BibTeX
|
RIS
|
RefWorks
Download
The Complexity of Positive First-Order Logic without Equality
Florent Madelaine
,
Barnaby Martin
Journal:
ACM Transactions on Computational Logic - TOCL
, pp. 1-17, 2012
A Tetrachotomy for Positive First-Order Logic without Equality
Florent Madelaine
,
Barnaby Martin
Conference:
Logic in Computer Science - LICS
, pp. 311-320, 2011
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges
Yonghong Xiang
,
Iain Stewart
,
Florent Madelaine
Conference:
International Conference on Parallel and Distributed Systems - ICPADS
, pp. 181-187, 2011
On the Containment of Forbidden Patterns Problems
Florent R. Madelaine
Conference:
Principles and Practice of Constraint Programming - CP
, pp. 345-359, 2010
The Complexity of Positive First-order Logic without Equality
(
Citations: 4
)
Florent R. Madelaine
,
Barnaby Martin
Conference:
Logic in Computer Science - LICS
, vol. abs/1003.0, pp. 429-438, 2009
Sort by:
Citations
(42 times by 32 publications)
A Tetrachotomy for Positive First-Order Logic without Equality
Florent Madelaine
,
Barnaby Martin
Conference:
Logic in Computer Science - LICS
, pp. 311-320, 2011
Feedback Message Passing for Inference in Gaussian Graphical Models
Ying Liu
,
Venkat Chandrasekaran
,
Animashree Anandkumar
,
Alan S. Willsky
Journal:
Computing Research Repository - CORR
, vol. abs/1105.1, 2011
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
(
Citations: 2
)
Barnaby Martin
,
Jos Martin
Conference:
Computer Science Logic - CSL
, pp. 426-438, 2010
The Dichotomy of List Homomorphisms for Digraphs
(
Citations: 2
)
Pavol Helland
,
Arash Rafiey
Journal:
Computing Research Repository - CORR
, vol. abs/1004.2, 2010
The Lattice Structure of Sets of Surjective Hyper-Operations
(
Citations: 1
)
Barnaby Martin
Conference:
Principles and Practice of Constraint Programming - CP
, pp. 368-382, 2010
Comments