activity
20042023
most citedFault Tolerant Boolean Satisfiability

10 citations · 10 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DC2023

Blizzard: Adding True Persistence to Main Memory Data Structures

Pradeep Fernando, Daniel Zahka, Ada Gavrilovska +2

Persistent memory (PMEM) devices present an opportunity to retain the flexibility of main memory data structures and algorithms, but augment them with reliability and persistence.…

cs.DC2017

Cyclone: High Availability for Persistent Key Value Stores

Amitabha Roy, Subramanya R. Dulloor

Persistent key value stores are an important component of many distributed data serving solutions with innovations targeted at taking advantage of growing flash speeds. Unfortunate…

cs.NI2013

DSAT-MAC : Dynamic Slot Allocation based TDMA MAC protocol for Cognitive Radio Networks

Rajeev K. Shakya, Satyam Agarwal, Y. N. Singh +2

Cognitive Radio Networks (CRN) have enabled us to efficiently reuse the underutilized radio spectrum. The MAC protocol in CRN defines the spectrum usage by sharing the channels eff…

cs.DS2012

Memory Hierarchy Sensitive Graph Layout

Amitabha Roy

Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms th…

cs.AI2011★ 10 cited

Fault Tolerant Boolean Satisfiability

A. Roy

A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits…

cs.AR2006

Fast and Generalized Polynomial Time Memory Consistency Verification

Amitabha Roy, Stephan Zeisset, Charles J. Fleckenstein +1

The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist th…