Name
Affiliation
Papers
MARTIN UGARTE
PUC Chile, Santiago, Chile
24
Collaborators
Citations 
PageRank 
31
32
8.77
Referers 
Referees 
References 
91
414
217
Search Limit
100414
Title
Citations
PageRank
Year
General dynamic Yannakakis: conjunctive queries with theta joins under updates00.342020
On the Expressiveness of Languages for Complex Event Recognition.00.342020
Efficient Enumeration Algorithms for Regular Document Spanners10.352020
Efficient Query Processing for Dynamically Changing Datasets00.342019
A Formal Framework for Complex Event Processing.00.342019
Conjunctive Queries with Theta Joins Under Updates.00.342019
Proof-of-Learning: A Blockchain Consensus Mechanism Based on Machine Learning Competitions40.482019
A Simple Data Structure For Optimal Two-Sided 2d Orthogonal Range Queries00.342019
Conjunctive Queries with Inequalities Under Updates.00.342018
Constant delay algorithms for regular document spanners.20.372018
On the Complexity of Query Answering under Access Limitations: A Computational Formalism.00.342018
On the Difference between Complex Event Processing and Dynamic Query Evaluation.00.342018
An Information-Theoretic Approach to Self-Organisation: Emergence of Complex Interdependencies in Coupled Dynamical Systems.10.352018
Conjunctive queries with inequalities under updates20.362018
Complex Event Recognition Languages: Tutorial.40.512017
Querying the Deep Web: Back to the Foundations.00.342017
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates.30.372017
A Second-Order Approach to Complex Event Recognition.00.342017
Foundations of Complex Event Processing.00.342017
Accessing the Deep Web with Keywords: A Foundational Approach.00.342017
Designing a Query Language for RDF: Marrying Open and Closed Worlds.40.402017
CONSTRUCT Queries in SPARQL.50.422015
A Preliminary Investigation into SPARQL Query Complexity and Federation in Bio2RDF.00.342015
Discovering XSD Keys from XML Data.60.412013