Vineet Gopal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static sorted length-n lists L1, L2,. .. , L k and a query value q, the iterated predecessor problem is to find the largest element in each list which is less than q. Our solution to this problem, called " range coalescing " , requires(More)
1 Introduction This report explores the design of Context, a concurrent text editor for a peer-to-peer network of users. Context is fault-tolerant and operational even with failed nodes and unstable networks, making this design ideal for collaborative work within groups. Our system allows users to simultaneously edit local copies of documents before(More)
  • 1