Publications

Export 31 results:
Sort by: Author Title Type [ Year (Desc)]
2011
A. Narang, A. Srivastava, N. P. K. Katta, and R. K. Shyamasundar, “Affinity Driven Distributed Scheduling Algorithm for Parallel Computations”, in 12th International Conference on Distributed Computing and Networking (ICDCN 2011), 2011, p. 167-178.
S. Chien, P. Harsha, A. Sinclair, and S. Srinivasan, “Almost settling the hardness of noncommutative determinant”, in Proc. 43rd ACM Symp. on Theory of Computing (STOC), San Jose, California, USA, 2011, p. 499–508.
O. Dabeer and S. Chaudhuri, “Analysis of an Adaptive Sampler Based on Weber's Law”, IEEE Transactions on Signal Processing, vol. 59, p. 1868-1878, 2011.
C. - C. Huang, T. Kavitha, D. Michail, and M. Nasre, “Bounded Unpopularity Matchings”, Algorithmica, vol. 61, p. 738-757, 2011.
R. Vaze and R. W. Heath Jr., “On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel”, IEEE Transactions on Information Theory, vol. 57, p. 4219-4234, 2011.
S. T. Aditya, O. Dabeer, and B. K. Dey, “A Channel Coding Perspective of Collaborative Filtering”, IEEE Transactions on Information Theory, vol. 57, p. 2327-2341, 2011.
R. Jain, S. Juneja, and N. Shimkin, “The concert queueing game: to wait or to be late”, Discrete Event Dynamic Systems, vol. 21, p. 103-138, 2011.
D. R. Kini, S. N. Krishna, and P. K. Pandya, “On Construction of Safety Signal Automata for \$MITL[\: \mathcal\U\, \: \mathcal\S\]\$ Using Temporal Projections”, in 9th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2011), 2011, p. 225-239.
S. Agarwal, S. Joshi, and R. K. Shyamasundar, “Distributed Generalized Dynamic Barrier Synchronization”, in 12th International Conference on Distributed Computing and Networking (ICDCN 2011), 2011, p. 143-154.
S. Asmussen, J. H. Blanchet, S. Juneja, and L. Rojas-Nandayapa, “Efficient simulation of tail probabilities of sums of correlated lognormals”, Annals OR, vol. 189, p. 5-23, 2011.
P. K. Pandya and S. S. Shah, “On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing”, in 22nd International Conference on Concurrency Theory (CONCUR 2011), 2011, p. 60-75.
O. Fawzi, P. Hayden, and P. Sen, “From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking”, in Proc. 43rd ACM Symp. on Theory of Computing (STOC), 2011, p. 773-782.
V. M. Prabhakaran, R. Puri, and K. Ramchandran, “Hybrid Digital-Analog Codes for Source-Channel Broadcast of Gaussian Sources Over Gaussian Channels”, IEEE Transactions on Information Theory, vol. 57, p. 4573-4588, 2011.
V. M. Prabhakaran and P. Viswanath, “Interference Channels With Destination Cooperation”, IEEE Transactions on Information Theory, vol. 57, p. 187-209, 2011.
V. M. Prabhakaran and P. Viswanath, “Interference Channels With Source Cooperation”, IEEE Transactions on Information Theory, vol. 57, p. 156-186, 2011.
C. - C. Huang and T. Kavitha, “Near-Popular Matchings in the Roommates Problem”, in 19th Annual European Symposium Algorithms (ESA 2011) , 2011, p. 167-179.
T. Kavitha, K. Mehlhorn, and D. Michail, “New Approximation Algorithms for Minimum Cycle Bases of Graphs”, Algorithmica, vol. 59, p. 471-488, 2011.
A. Jimenez-Pacheco and O. Dabeer, “A novel conflict-free memory and processor architecture for DVB-T2 LDPC decoding”, in 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2011), 2011, p. 1-7.
A. Narang and R. K. Shyamasundar, “Performance driven distributed scheduling of parallel hybrid computations”, Theor. Comput. Sci., vol. 412, p. 4212-4225, 2011.
A. Narang, A. Srivastava, N. P. K. Katta, and R. K. Shyamasundar, “Performance driven multi-objective distributed scheduling for parallel computations”, Operating Systems Review, vol. 45, p. 14-27, 2011.
V. Bonifaci, K. Mehlhorn, and G. Varma, “Physarum Can Compute Shortest Paths”, CoRR, vol. abs/1106.0423, 2011.
C. - C. Huang and T. Kavitha, “Popular Matchings in the Stable Marriage Problem”, in 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, p. 666-677.
T. Kavitha and M. Nasre, “Popular matchings with variable item copies”, Theor. Comput. Sci., vol. 412, p. 1263-1274, 2011.
T. Kavitha, J. Mestre, and M. Nasre, “Popular mixed matchings”, Theor. Comput. Sci., vol. 412, p. 2679-2690, 2011.
N. Goel, N. N. V. Kumar, and R. K. Shyamasundar, “SLA Monitor: A System for Dynamic Monitoring of Adaptive Web Services”, in 9th IEEE European Conference on Web Services (ECOWS 2011), 2011, p. 109-116.
J. Radhakrishnan and S. Shannigrahi, “Streaming Algorithms for 2-Coloring Uniform Hypergraphs”, in Proc. of 12th International Symposium on Algorithms and Data Structures (WADS), 2011, p. 667-678.
R. Vaze, “Throughput-Delay-Reliability Tradeoff with ARQ in Wireless Ad Hoc Networks”, IEEE Transactions on Wireless Communications, vol. 10, p. 2142-2149, 2011.
R. Vaze, “Transmission Capacity of Spectrum Sharing Ad Hoc Networks with Multiple Antennas”, IEEE Transactions on Wireless Communications, vol. 10, p. 2334-2340, 2011.
R. Vaze, “Transmission capacity of spectrum sharing ad-hoc networks with multiple antennas”, in 9th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2011), 2011, p. 348-353.
R. Vaze, K. T. Truong, S. Weber, and R. H. W. Jr., “Two-Way Transmission Capacity of Wireless Ad-hoc Networks”, IEEE Transactions on Wireless Communications, vol. 10, p. 1966-1975, 2011.
2010
A. Babu, N. Limaye, and G. Varma, “Streaming Algorithms for Some Problems in Log-Space”, in Theory and Applications of Models of Computation, 2010, vol. 6108, p. 94-104.