research
∙
01/19/2023
Improved Tradeoffs for Leader Election
We consider leader election in clique networks, where n nodes are connec...
share
research
∙
10/06/2022
What Can We Compute in a Single Round of the Congested Clique?
We study the computational power of one-round distributed algorithms in ...
research
∙
04/25/2022
Byzantine-Resilient Counting in Networks
We present two distributed algorithms for the Byzantine counting problem...
research
∙
05/19/2021
Can We Break Symmetry with o(m) Communication?
We study the communication cost (or message complexity) of fundamental d...
research
∙
05/05/2021
The Complexity of Symmetry Breaking in Massive Graphs
The goal of this paper is to understand the complexity of symmetry break...
research
∙
03/12/2021
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
We give lower bounds on the communication complexity of graph problems i...
research
∙
02/18/2021
Network Size Estimation in Small-World Networks under Byzantine Faults
We study the fundamental problem of counting the number of nodes in a sp...
research
∙
01/08/2021
Adaptive Accessible AR/VR Systems
Augmented, virtual and mixed reality technologies offer new ways of inte...
research
∙
01/05/2021
Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding
We introduce a set of algorithms (Het-node2vec) that extend the original...
research
∙
11/24/2020
General Purpose Atomic Crosschain Transactions
The General Purpose Atomic Crosschain Transaction protocol allows compos...
research
∙
05/19/2020
Performance Overhead of Atomic Crosschain Transactions
Atomic Crosschain Transaction technology allows composable programming a...
research
∙
05/19/2020
Layer 2 Atomic Cross-Blockchain Function Calls
The Layer 2 Atomic Cross-Blockchain Function Calls protocol allows compo...
research
∙
04/18/2020
Consensus for Crosschain Communications
Crosschain communications allows information to be communicated between ...
research
∙
03/22/2020
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners
We introduce a new measure for quantifying the amount of information tha...
research
∙
02/28/2020
Atomic Crosschain Transactions White Paper
Atomic Crosschain Transaction technology allows composable programming a...
research
∙
12/05/2019
Merlin: Enabling Machine Learning-Ready HPC Ensembles
With the growing complexity of computational and experimental facilities...
research
∙
11/19/2019
Application Level Authentication for Ethereum Private Blockchain Atomic Crosschain Transactions
Atomic Crosschain Transaction technology allows composable programming a...
research
∙
10/05/2019
Parallelizing Training of Deep Generative Models on Massive Scientific Datasets
Training deep neural networks on large scientific data is a challenging ...
research
∙
06/11/2019
The merits of using Ethereum MainNet as a Coordination Blockchain for Ethereum Private Sidechains
A Coordination Blockchain is a blockchain with the task of coordinating ...
research
∙
05/25/2019
Invoice Financing of Supply Chains with Blockchain technology and Artificial Intelligence
Supply chains lend themselves to blockchain technology, but certain chal...
research
∙
04/26/2019
Atomic Crosschain Transactions for Ethereum Private Sidechains
Public blockchains such as Ethereum and Bitcoin do not give enterprises ...
research
∙
03/10/2019
Sidechains and interoperability
There appears to be an insatiable desire for spawning new bespoke blockc...
research
∙
03/07/2019
Anonymous State Pinning for Private Blockchains
Public blockchains such as Ethereum and Bitcoin provide transparency and...
research
∙
02/24/2019
Latency, Capacity, and Distributed MST
Consider the problem of building a minimum-weight spanning tree for a gi...
research
∙
01/02/2019
Leader Election in Well-Connected Graphs
In this paper, we look at the problem of randomized leader election in s...
research
∙
10/05/2018
Fault-Tolerant Consensus with an Abstract MAC Layer
In this paper, we study fault-tolerant distributed consensus in wireless...
research
∙
09/28/2018
On the Hardness of the Strongly Dependent Decision Problem
We present necessary and sufficient conditions for solving the strongly ...
research
∙
09/02/2018
The Complexity of Leader Election: A Chasm at Diameter Two
This paper focuses on studying the message complexity of implicit leader...
research
∙
07/06/2018
Decentralised Random Number Generation
Decentralised random number generation algorithms suffer from the Last A...
research
∙
06/26/2018
Requirements for Ethereum Private Sidechains
The Enterprise Ethereum Client Specification by the Enterprise Ethereum ...
research
∙
06/15/2018
Design Patterns which Facilitate Message Digest Collision Attacks on Blockchains
Message digest algorithms are one of the underlying building blocks of b...
research
∙
05/02/2018
Breaking the (√(n)) Barrier: Fast Consensus under a Late Adversary
We study the consensus problem in a synchronous distributed system of n ...
research
∙
07/11/2015