default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Costa Florêncio
Person information
- affiliation: University of Amsterdam, Informatics Institute
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck:
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. J. Univers. Comput. Sci. 21(7): 891-911 (2015)- 2014
- [j5]Christophe Costa Florêncio, Sicco Verwer:
Regular inference as vertex coloring. Theor. Comput. Sci. 558: 18-34 (2014) - [c17]Spyros Martzoukos, Christof Monz, Christophe Costa Florêncio:
Maximizing Component Quality in Bilingual Word-Aligned Segmentations. EACL 2014: 30-38 - 2013
- [c16]Spyros Martzoukos, Christophe Costa Florêncio, Christof Monz:
Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation. MOL 2013: 93-101 - 2012
- [j4]Christophe Costa Florêncio, Henning Fernau
:
On families of categorial grammars of bounded value, their learnability and related complexity questions. Theor. Comput. Sci. 452: 21-38 (2012) - [c15]Christophe Costa Florêncio, Sicco Verwer:
Regular Inference as Vertex Coloring. ALT 2012: 81-95 - [c14]Christophe Costa Florêncio:
Learning Tree Adjoining Grammars from Structures and Strings. ICGI 2012: 129-132 - 2011
- [j3]Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok:
Preface. Fundam. Informaticae 113(2) (2011) - [j2]Alexander Clark, Christophe Costa Florêncio, Chris Watkins:
Languages as hyperplanes: grammatical inference with string kernels. Mach. Learn. 82(3): 351-373 (2011) - 2010
- [c13]Christophe Costa Florêncio, Henning Fernau:
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. ICGI 2010: 280-283 - [c12]Christophe Costa Florêncio, Henning Fernau:
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA 2010: 202-213
2000 – 2009
- 2009
- [j1]Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok:
StReBio'09: statistical relational learning and mining in bioinformatics. SIGKDD Explor. 11(2): 88-89 (2009) - [e1]Christophe Costa Florêncio, Fabrizio Costa, Jan Ramon, Joost N. Kok:
Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009. ACM 2009, ISBN 978-1-60558-667-0 [contents] - 2008
- [c11]Christophe Costa Florêncio:
Learning Node Label Controlled Graph Grammars (Extended Abstract). ICGI 2008: 286-288 - 2007
- [c10]Christophe Costa Florêncio:
Tree Planar Languages. ICDM Workshops 2007: 405-410 - 2006
- [c9]Alexander Clark, Christophe Costa Florêncio, Chris Watkins:
Languages as Hyperplanes: Grammatical Inference with String Kernels. ECML 2006: 90-101 - [c8]Alexander Clark, Christophe Costa Florêncio, Chris Watkins, Mariette Sérayet:
Planar Languages and Learnability. ICGI 2006: 148-160 - 2003
- [c7]Christophe Costa Florêncio:
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable. EACL 2003: 75-82 - 2002
- [c6]Christophe Costa Florêncio:
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. ICGI 2002: 49-62 - [c5]Christophe Costa Florêncio:
A Note on the Complexity of Associative-Commutative Lambek Calculus. TAG+ 2002: 159-162 - 2001
- [c4]Christophe Costa Florêncio:
Conservative vs Set-driven Learning Functions for the Classes k-valued. CLIN 2001: 38-46 - [c3]Christophe Costa Florêncio:
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard. LACL 2001: 125-138 - 2000
- [c2]Christophe Costa Florêncio:
On the Complexity of Consistent Identification of Some Classes of Structure Languages. ICGI 2000: 89-102
1990 – 1999
- 1999
- [c1]Christophe Costa Florêncio:
Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard. CLIN 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
