3 citations · 14 across the 14 of their papers we have counts for
16 papers
Consensus on an Unknown Torus with Dense Byzantine Faults
Joseph Oglio, Kendric Hood, Gokarna Sharma +1
We present a solution to consensus on a torus with Byzantine faults. Any solution to classic consensus that is tolerant to Byzantine faults requires node-disjoint paths.…
Deep Recurrent Q-learning for Energy-constrained Coverage with a Mobile Robot
Aaron Zellner, Ayan Dutta, Iliya Kulbaka +1
In this paper, we study the problem of coverage of an environment with an energy-constrained robot in the presence of multiple charging stations. As the robot's on-board power supp…
Collisionless Pattern Discovery in Robot Swarms Using Deep Reinforcement Learning
Nelson Sharma, Aswini Ghosh, Rajiv Misra +2
We present a deep reinforcement learning-based framework for automatically discovering patterns available in any given initial configuration of fat robot swarms. In particular, we…
Blockchain in Dynamic Networks
Rachel Bricker, Mikhail Nesterenko, Gokarna Sharma
We consider blockchain in dynamic networks. We define the Blockchain Decision Problem. It requires miners that maintain the blockchain to confirm whether a particular block is acce…
Near-Optimal Dispersion on Arbitrary Anonymous Graphs
Ajay D. Kshemkalyani, Gokarna Sharma
Given an undirected, anonymous, port-labeled graph of memory-less nodes, edges, and degree , we consider the problem of dispersing robots (or tokens) positione…
Partitionable Asynchronous Cryptocurrency Blockchain
Kendric Hood, Joseph Oglio, Mikhail Nesterenko +1
We consider operation of blockchain-based cryptocurrency in case of partitioning. We define the Partitionable Blockchain Consensus Problem. The problem may have an interesting solu…
Byzantine Geoconsensus
Joseph Oglio, Kendric Hood, Gokarna Sharma +1
We define and investigate the consensus problem for a set of processes embedded on the -dimensional plane, , which we call the {\em geoconsensus} problem. The proce…
Dispersion of Mobile Robots in the Global Communication Model
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a configuration…
Blockguard: Adaptive Blockchain Security
Shishir Rai, Kendric Hood, Mikhail Nesterenko +1
We consider the problem of varying the security of blockchain transactions according to their importance. This adaptive security is achieved by using variable size consensus commit…
A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint
Ayan Dutta, Gokarna Sharma
In this paper, we study the problem of coverage planning by a mobile robot with a limited energy budget. The objective of the robot is to cover every point in the environment while…
Weighted Reservoir Sampling from Distributed Streams
Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura +1
We consider message-efficient continuous random sampling from a distributed stream, where the probability of inclusion of an item in the sample is proportional to a weight associat…
Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The mobile robot dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a c…
Distributed Queuing in Dynamic Networks
Gokarna Sharma, Costas Busch
We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from ro…
A Competitive Analysis for Balanced Transactional Memory Workloads
Gokarna Sharma, Costas Busch
We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a cons…
A Streaming Approximation Algorithm for Klee's Measure Problem
Gokarna Sharma, Costas Busch, Srikanta Tirthapura
The efficient estimation of frequency moments of a data stream in one-pass using limited space and time per item is one of the most fundamental problem in data stream processing. A…
Window-Based Greedy Contention Management for Transactional Memory
Gokarna Sharma, Brett Estrade, Costas Busch
We consider greedy contention managers for transactional memory for M x N execution windows of transactions with M threads and N transactions per thread. Assuming that each transac…