• META: Memory exploration tool for Android devices 

  Parikh, Nisarg; Gohil, Varun; Awasthi, Manu (2018-10-29)
• The parameterized complexity of happy colorings 

  Misra, Neeldhara; Reddy, I. Vinod (2018-07-16)
• Discovering topical interactions in text-based cascades using hidden Markov Hawkes processes 

  Bedathur, Srikanta; Bhattacharya, Indrajit; Choudhari, Jayesh; Dasgupta, Anirban (Cornell University Library, 2018-09)

  Social media conversations unfold based on complex interactions between users, topics and time. While recent models have been proposed to capture network strengths between users, users' topical preferences and temporal ...
• On NC algorithms for problems on bounded rank-width graphs 

  Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)

  In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
• Robust multiparty computation with faster verification time 

  Paul, Souradyuti; Shrivastava, Ananya (2018-07-11)
• Generic single edge fault tolerant exact distance Oracle 

  Gupta, Manoj; Singh, Aditi (09-07-2018)
• Parameterized algorithms for conflict-free colorings of graphs 

  Reddy, I. Vinod (Elsevier, 2018-05)

  In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
• Generic Single Edge Fault Tolerant Exact Distance Oracle 

  Gupta, Manoj; Singh, Aditi (Cornell University Library, 2018-05)

  Given an undirected unweighted graph G and a source set S of |S|=? sources, we want to build a data structure which can process the following query {\sc Q}(s,t,e): find the shortest distance from s to t avoiding an edge ...
• Fully dynamic maximal matching in O(log N) update time 

  Baswana, Surender; Gupta, Manoj; Sen, Sandeep (Society for Industrial and Applied Mathematics, 2018-01)

  We present an algorithm for maintaining a maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized O(log n) time for each edge update, where n is the ...
• Simple dynamic algorithms for Maximal Independent Set and other problems 

  Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2018-04)
• Complexity of manipulation with partial information in voting 

  Deya, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2018-03)

  The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of ...
• Color spanning objects: Algorithms and hardness results 

  Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Elsevier, 2018-03)

  In this paper, we study the Shortest Color Spanning - Intervals problem, and related generalizations, namely Smallest Color Spanning - Squares and Smallest Color Spanning - Circles. The generic setting is the following: ...
• A new approach to deanonymization of unreachable bitcoin nodes 

  Mastan, Indra Deep; Paul, Souradyuti (International Association for Cryptologic Research, 2018-03)

  Mounting deanonymization attacks on the unreachable Bitcoin nodes -- these nodes do not accept incoming connections -- residing behind the NAT is a challenging task. Such an attack was first given by Biryukov, Khovratovich ...
• On the parallel parameterized complexity of the graph isomorphism problem 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (2018-03-03)
• On structural parameterizations of firefighting 

  Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Springer, 2018-02-15)

  The Firefighting problem is defined as follows. At time Open image in new window , a fire breaks out at a vertex of a graph. At each time step Open image in new window , a firefighter permanently defends (protects) an ...
• On structural parameterizations of happy coloring, empire coloring and boxicity", 

  Choudhari, Jayesh; Reddy, I. Vinod (2018-03-03)
• Docker container scheduler for I/O intensive applications running on NVMe SSDs 

  Bhimani, Janki; Yang, Zhengyu; Mi, Ningfang; Yang, Jingpei; Xu, Qiumin; Awasthi, Manu; Pandurangan, Rajinikanth; Balakrishnan, Vijay (IEEE xplore digital library, 2018-02)

  By using fast back-end storage, performance benefits of a lightweight container platform can be leveraged with quick I/O response. Nevertheless, the performance of simultaneously executing multiple instances of same or ...
• An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs 

  Cormode, Graham; Dasgupta, Anirban; Goyal, Amit; Lee, Chi Hoon (American Physical Society, 2018-01)

  Many modern applications of AI such as web search, mobile browsing, image processing, and natural language processing rely on finding similar items from a large database of complex objects. Due to the very large scale of ...
• On the parallel parameterized complexity of the graph isomorphism problem 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2017-12)

  In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let H={H1,H2,?,Hl} be a finite set of graphs where |V(Hi)|?d for all i and for some ...
• On structural parameterizations of firefighting 

  Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)

  The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t?0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all ...

View more