Data Structures for Storing Small Sets in the Bitprobe Model

abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting Labelled Hypertrees", Algorithmica 54 (2), 2009, pp. 208-225. (Special Issue on ISAAC 2006) abstract appeared in Proc. 17th International Symposium on Algorithms and Computation (ISAAC), 2006, pp. 588-597. J. Radhakrishnan and S. Shannigrahi, "Streaming Algorithms for 2-coloring Uniform Hypergraphs" (in preparation). S. Shannigrahi, S. Goyal, N. Modani, S. Nagar, K. Dey and A. A. Nanavati, "Identifying Monetisable Communities in Large Networks" (in preparation). HONORS Recipient of the IBM Ph.D. Fellowship, 2009-2010. 

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Shannigrahi
• Keywords: 17th International Symposium, 24th Annual Symposium, Algorithms, Efficient Prufer-like Coding, ESA 2010