selected scholarly activity
-
books
-
chapters
- Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules. Lecture Notes in Computer Science. 187-205. 2022
- The Fault-Tolerant Cluster-Sending Problem. Lecture Notes in Computer Science. 168-186. 2022
- Explaining Results of Path Queries on Graphs. Communications in Computer and Information Science. 84-98. 2020
-
conferences
- SpotLess: Concurrent Rotational Consensus Made Practical Through Rapid View Synchronization. Proceedings - International Conference on Data Engineering. 1916-1929. 2024
- Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. Proceedings - Symposium on Logic in Computer Science. 2023
- ByShard. Proceedings of the VLDB Endowment. 2230-2243. 2021
- RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing. Proceedings - International Conference on Data Engineering. 1392-1403. 2021
- Proof-of-execution: Reaching consensus through fault-tolerant speculation. Advances in Database Technology - EDBT. 301-312. 2021
- Stab-forests: Dynamic data structures for efficient temporal query processing. Leibniz International Proceedings in Informatics. 2020
- Blockchain consensus unraveled. Proceedings of the 14th ACM International Conference on Distributed and Event-based Systems. 218-221. 2020
- Coordination-free byzantine replication with minimal communication costs. Leibniz International Proceedings in Informatics. 2020
- ResilientDB. Proceedings of the VLDB Endowment. 868-883. 2020
- Explaining Results of Path Queries on Graphs. Communications in Computer and Information Science. 84-98. 2020
- An In-Depth Look of BFT Consensus in Blockchain. Proceedings of the 20th International Middleware Conference Tutorials. 6-10. 2019
- Brief announcement: Revisiting consensus protocols through wait-free parallelization. Leibniz International Proceedings in Informatics. 2019
- Brief announcement: The fault-tolerant cluster-sending problem. Leibniz International Proceedings in Informatics. 2019
- First-Order Definable Counting-Only Queries. Lecture Notes in Computer Science. 225-243. 2018
- The Power of Tarski’s Relation Algebra on Trees. Lecture Notes in Computer Science. 244-264. 2018
- From relation algebra to semi-join algebra. Proceedings of The 16th International Symposium on Database Programming Languages. 1-10. 2017
- Relative expressive power of downward fragments of navigational query languages on trees and chains. Proceedings of the 15th Symposium on Database Programming Languages. 59-68. 2015
- Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model. Lecture Notes in Computer Science. 250-269. 2014
- Walk logic as a framework for path query languages on graph databases. Proceedings of the 16th International Conference on Database Theory. 117-128. 2013
- Efficient external-memory bisimulation on DAGs. Proceedings of the ACM SIGMOD International Conference on Management of Data. 553-564. 2012
-
journal articles
- Explaining results of path queries on graphs: Single-path results for context-free path queries. Information Systems. 128:102475. 2025
- ByShard: sharding in a Byzantine environment. The VLDB journal. 32:1343-1367. 2023
- The power of Tarski's relation algebra on trees. Journal of Logical and Algebraic Methods in Programming. 126:100748-100748. 2022
- From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization. Computer Journal. 64:789-811. 2021
- Fault-Tolerant Distributed Transactions on Blockchain. Synthesis Lectures on Data Management. 16:1-268. 2021
- Building high throughput permissioned blockchain fabrics. Proceedings of the VLDB Endowment. 13:3441-3444. 2020
- Scalable, resilient, and configurable permissioned blockchain fabric. Proceedings of the VLDB Endowment. 13:2893-2896. 2020
- Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Information Systems. 89:101467-101467. 2020
- Calculi for symmetric queries. Journal of Computer and System Sciences. 105:54-86. 2019
- First-order definable counting-only queries. Annals of Mathematics and Artificial Intelligence. 87:109-136. 2019
- Implication and axiomatization of functional and constant constraints. Annals of Mathematics and Artificial Intelligence. 76:251-279. 2016
- [Problem] Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing. Journal of Systems Research. 3.
- [Solution] Byzantine Cluster-Sending in Expected Constant Cost and Constant Time. Journal of Systems Research. 3.
-
preprints
- SpotLess: Concurrent Rotational Consensus Made Practical through Rapid View Synchronization 2023
- On the Correctness of Speculative Consensus 2022
- Byzantine Cluster-Sending in Expected Constant Communication 2021
- Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing 2020
- ResilientDB: Global Scale Resilient Blockchain Fabric 2020
- Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation 2019
- RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing 2019
- Revisiting consensus protocols through wait-free parallelization 2019
- The fault-tolerant cluster-sending problem 2019
- Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees 2018