default search action
Jelle Hellings
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]Jelle Hellings:
Explaining results of path queries on graphs: Single-path results for context-free path queries. Inf. Syst. 128: 102475 (2025) - 2024
- [c21]Dakai Kang, Sajjad Rahnama, Jelle Hellings, Mohammad Sadoghi:
SpotLess: Concurrent Rotational Consensus Made Practical Through Rapid View Synchronization. ICDE 2024: 1916-1929 - 2023
- [j13]Jelle Hellings, Daniel P. Hughes, Joshua Primero, Mohammad Sadoghi:
[Problem] Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing. J. Syst. Res. 3(1) (2023) - [j12]Jelle Hellings, Mohammad Sadoghi:
[Solution] Byzantine Cluster-Sending in Expected Constant Cost and Constant Time. J. Syst. Res. 3(1) (2023) - [j11]Jelle Hellings, Mohammad Sadoghi:
ByShard: sharding in a Byzantine environment. VLDB J. 32(6): 1343-1367 (2023) - [c20]Jelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. LICS 2023: 1-13 - [i12]Dakai Kang
, Sajjad Rahnama, Jelle Hellings, Mohammad Sadoghi
Practical View-Change-Less Protocol through Rapid View Synchronization. CoRR abs/2302.02118 (2023) - 2022
- [j10]Jelle Hellings, Yuqing Wu, Marc Gyssens
The power of Tarski's relation algebra on trees. J. Log. Algebraic Methods Program. 126: 100748 (2022) - [c19]Jelle Hellings, Mohammad Sadoghi:
The Fault-Tolerant Cluster-Sending Problem. FoIKS 2022: 168-186 - [c18]Jelle Hellings, Yuqing Wu, Dirk Van Gucht, Marc Gyssens:
Optimizing Multiset Relational Algebra Queries Using Weak-Equivalent Rewrite Rules. FoIKS 2022: 187-205 - [i11]Jelle Hellings, Suyash Gupta, Sajjad Rahnama, Mohammad Sadoghi
On the Correctness of Speculative Consensus. CoRR abs/2204.03552 (2022) - 2021
- [b2]Suyash Gupta
Fault-Tolerant Distributed Transactions on Blockchain. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2021, ISBN 978-3-031-00749-1, pp. 1-268 - [j9]Jelle Hellings, Catherine L. Pilachowski, Dirk Van Gucht, Marc Gyssens
From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization. Comput. J. 64(5): 789-811 (2021) - [j8]Jelle Hellings, Mohammad Sadoghi
ByShard: Sharding in a Byzantine Environment. Proc. VLDB Endow. 14(11): 2230-2243 (2021) - [c17]Suyash Gupta
Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation. EDBT 2021: 301-312 - [c16]Suyash Gupta
RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing. ICDE 2021: 1392-1403 - [i10]Jelle Hellings, Mohammad Sadoghi:
Byzantine Cluster-Sending in Expected Constant Communication. CoRR abs/2108.08541 (2021) - 2020
- [j7]Jelle Hellings, Marc Gyssens
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89: 101467 (2020) - [j6]Suyash Gupta, Sajjad Rahnama, Jelle Hellings, Mohammad Sadoghi
ResilientDB: Global Scale Resilient Blockchain Fabric. Proc. VLDB Endow. 13(6): 868-883 (2020) - [j5]Sajjad Rahnama, Suyash Gupta, Thamir Qadah, Jelle Hellings, Mohammad Sadoghi
Scalable, Resilient and Configurable Permissioned Blockchain Fabric. Proc. VLDB Endow. 13(12): 2893-2896 (2020) - [j4]Suyash Gupta, Jelle Hellings, Sajjad Rahnama, Mohammad Sadoghi
Building High Throughput Permissioned Blockchain Fabrics: Challenges and Opportunities. Proc. VLDB Endow. 13(12): 3441-3444 (2020) - [c15]Suyash Gupta
Blockchain consensus unraveled: virtues and limitations. DEBS 2020: 218-221 - [c14]Jelle Hellings, Mohammad Sadoghi
Coordination-Free Byzantine Replication with Minimal Communication Costs. ICDT 2020: 17:1-17:20 - [c13]Jelle Hellings, Yuqing Wu:
Stab-Forests: Dynamic Data Structures for Efficient Temporal Query Processing. TIME 2020: 18:1-18:19 - [c12]Jelle Hellings:
Explaining Results of Path Queries on Graphs - Single-Path Results for Context-Free Path Queries. SFDI/LSGDA@VLDB 2020: 84-98 - [i9]Suyash Gupta, Sajjad Rahnama, Jelle Hellings, Mohammad Sadoghi:
ResilientDB: Global Scale Resilient Blockchain Fabric. CoRR abs/2002.00160 (2020) - [i8]Jelle Hellings, Daniel P. Hughes, Joshua Primero, Mohammad Sadoghi:
Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing. CoRR abs/2008.04450 (2020)
2010 – 2019
- 2019
- [j3]Jelle Hellings, Marc Gyssens
First-order definable counting-only queries. Ann. Math. Artif. Intell. 87(1-2): 109-136 (2019) - [j2]Marc Gyssens
Calculi for symmetric queries. J. Comput. Syst. Sci. 105: 54-86 (2019) - [c11]Suyash Gupta, Jelle Hellings, Sajjad Rahnama, Mohammad Sadoghi
An In-Depth Look of BFT Consensus in Blockchain: Challenges and Opportunities. Middleware Tutorials 2019: 6-10 - [c10]Suyash Gupta
Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization. DISC 2019: 44:1-44:3 - [c9]Jelle Hellings, Mohammad Sadoghi
Brief Announcement: The Fault-Tolerant Cluster-Sending Problem. DISC 2019: 45:1-45:3 - [i7]Jelle Hellings, Mohammad Sadoghi:
The fault-tolerant cluster-sending problem. CoRR abs/1908.01455 (2019) - [i6]Suyash Gupta, Jelle Hellings, Mohammad Sadoghi:
Revisiting consensus protocols through wait-free parallelization. CoRR abs/1908.01458 (2019) - [i5]Suyash Gupta, Jelle Hellings, Mohammad Sadoghi:
Scaling Blockchain Databases through Parallel Resilient Consensus Paradigm. CoRR abs/1911.00837 (2019) - [i4]Suyash Gupta, Jelle Hellings, Sajjad Rahnama, Mohammad Sadoghi:
Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation. CoRR abs/1911.00838 (2019) - 2018
- [b1]Jelle Hellings:
On Tarski's Relation Algebra: Querying trees and chains, and the semi-join algebra. Hasselt University, Belgium, 2018 - [c8]Jelle Hellings, Marc Gyssens
First-Order Definable Counting-Only Queries. FoIKS 2018: 225-243 - [c7]Jelle Hellings, Yuqing Wu, Marc Gyssens
The Power of Tarski's Relation Algebra on Trees. FoIKS 2018: 244-264 - [i3]Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher:
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. CoRR abs/1803.01390 (2018) - 2017
- [c6]Jelle Hellings, Catherine L. Pilachowski, Dirk Van Gucht, Marc Gyssens
From relation algebra to semi-join algebra: an approach for graph query optimization. DBPL 2017: 5:1-5:10 - 2016
- [j1]Jelle Hellings, Marc Gyssens
Implication and axiomatization of functional and constant constraints. Ann. Math. Artif. Intell. 76(3-4): 251-279 (2016) - 2015
- [c5]Jelle Hellings, Marc Gyssens
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL 2015: 59-68 - [i2]Jelle Hellings:
Path Results for Context-free Grammar Queries on Graphs. CoRR abs/1502.02242 (2015) - 2014
- [c4]Jelle Hellings, Marc Gyssens
Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model. FoIKS 2014: 250-269 - [c3]Jelle Hellings:
Conjunctive Context-Free Path Queries. ICDT 2014: 119-130 - 2013
- [c2]Jelle Hellings, Bart Kuijpers
Walk logic as a framework for path query languages on graph databases. ICDT 2013: 117-128 - 2012
- [c1]Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort:
Efficient external-memory bisimulation on DAGs. SIGMOD Conference 2012: 553-564 - 2011
- [i1]Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort:
I/O efficient bisimulation partitioning on very large directed acyclic graphs. CoRR abs/1112.0857 (2011)
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-12-10 20:50 CET 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: