The following pages link to Cristian Riveros (Q269344):
Displaying 26 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- Probabilistic automata of bounded ambiguity (Q2064517) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- The Cost of Traveling between Languages (Q3012923) (← links)
- (Q3304149) (← links)
- Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties (Q4601905) (← links)
- Bounded Repairability for Regular Tree Languages (Q5012563) (← links)
- #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes (Q5056438) (← links)
- A Formal Framework for Complex Event Processing (Q5091115) (← links)
- Probabilistic Automata of Bounded Ambiguity (Q5111632) (← links)
- (Q5144698) (← links)
- (Q5155668) (← links)
- (Q5216300) (← links)
- Quantitative Monadic Second-Order Logic (Q5271046) (← links)
- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (Q5351955) (← links)
- Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing (Q5874368) (← links)
- On the Expressiveness of Languages for Complex Event Recognition (Q5874369) (← links)
- (Q5874378) (← links)
- (Q6192488) (← links)
- Streaming enumeration on nested documents (Q6491033) (← links)
- Streaming enumeration on nested documents (Q6492725) (← links)
- Constant-delay enumeration for SLP-compressed documents (Q6615175) (← links)
- How do centrality measures choose the root of trees? (Q6615185) (← links)
