Cristian Riveros

According to our database1, Cristian Riveros authored at least 26 papers between 2008 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

A Formal Framework for Complex Event Processing.
Proceedings of the 22nd International Conference on Database Theory, 2019

2018
Pumping Lemmas for Weighted Automata.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Constant Delay Algorithms for Regular Document Spanners.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017
Descriptive Complexity for counting complexity classes.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Probabilistic Automata of Bounded Ambiguity.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Bounded Repairability for Regular Tree Languages.
ACM Trans. Database Syst., 2016

A framework for annotating CSV-like data.
PVLDB, 2016

Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Querying Wikidata: Comparing SPARQL, Relational and Graph Databases.
Proceedings of the Semantic Web - ISWC 2016, 2016

2015
Which XML Schemas are Streaming Bounded Repairable?
Theory Comput. Syst., 2015

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
The per-character cost of repairing word languages.
Theor. Comput. Sci., 2014

2013
Bounded repairability of word languages.
J. Comput. Syst. Sci., 2013

The language of plain SO-tgds: Composition, inversion and structural properties.
J. Comput. Syst. Sci., 2013

Quantitative Monadic Second-Order Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Which DTDs are streaming bounded repairable?
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012
Query language-based inverses of schema mappings: semantics, computation, and closure properties.
VLDB J., 2012

Bounded repairability for regular tree languages.
Proceedings of the 15th International Conference on Database Theory, 2012

2011
Regular Repair of Specifications.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

The Cost of Traveling between Languages.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Foundations of schema mapping management.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009
Composition and inversion of schema mappings.
SIGMOD Record, 2009

Inverting Schema Mappings: Bridging the Gap between Theory and Practice.
PVLDB, 2009

2008
The recovery of a schema mapping: bringing exchanged data back.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008


  Loading...