Items where Subject is "Computer Science & Automation"

Buchsbaum, Adam L and Sundar, Rajamani and Tarjan, Robert E (1995) Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. In: SIAM Journal on Computing, 24 (6). pp. 1190-1206.

Prasad, UR and Rajan, N (1987) Aircraft pursuit-evasion problems with variable speeds. In: Computers & Mathematics with Applications, 13 (1-3). pp. 111-121.

A

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2007) Network flow-control using asynchronous stochastic approximation. In: 46th IEEE Conference on Decision and Control, DEC 12-14, 2007, New Orleans, LA.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2007) Parametrized actor-critic algorithms for finite-horizon MDPs. In: American Control Conference 2007, JUL 09-13, 2007, New York,.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2007) Solving MDPs using two-timescale simulated annealing with multiplicative weights. In: American Control Conference 2007, JUL 09-13, 2007, New York, NY.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2016) MULTI-ARMED BANDITS BASED ON A VARIANT OF SIMULATED ANNEALING. In: INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 47 (2). pp. 195-212.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2007) Reinforcement Learning Based Algorithms for Average Cost Markov Decision Processes. In: Discrete Event Dynamic Systems - Theory and Applications, 17 (1). pp. 23-52.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2006) SPSA algorithms with measurement reuse. In: 2006 Winter Simulation Conference,, Dec 03-06, 2006, Monterey, CA,, pp. 319-327.

Abdulla, Mohammed Shahid and Bhatnagar, Shalabh (2005) Solution of MDPS using simulation-based value iteration. In: 2nd International Conference on Artificial Intelligence Applications and Innovations, SEP 07-09, 2005, Beijing.

Abraham, David J and Irving, Robert W and Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Popular Matchings. In: SIAM Journal on Computing, 37 (4). pp. 1030-1045.

Abraham, David J and Telikepalli, Kavitha (2006) Dynamic Matching Markets and Voting Paths. In: Algorithm Theory-SWAT 2006. 10th Scandinavian Workshop on Algorithm Theory. Proceedings, 6-8 July 2006, Riga, Latvia, pp. 65-76.

Abraham, I and Asharov, G and Patil, S and Patra, A (2022) Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7 - 10 November 2022, Chicago, pp. 384-414.

Abraham, I and Asharov, G and Patil, S and Patra, A (2024) Perfect Asynchronous MPC with Linear Communication Overhead. In: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024, 26 May 2024through 30 May 2024, Zurich, Switzerland, pp. 280-309.

Acharya, A and Bondhugula, U and Cohen, A (2020) Effective Loop Fusion in Polyhedral Compilation Using Fusion Conflict Graphs. In: ACM Transactions on Architecture and Code Optimization, 17 (4).

Acharya, Aravind and Bondhugula, Uday (2015) PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality. In: ACM SIGPLAN NOTICES, 50 (8). pp. 54-64.

Acharya, Aravind and Bondhugula, Uday (2015) PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality. In: ASSOC COMPUTING MACHINERY, 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA . pp. 54-64.

Acharya, Aravind and Bondhugula, Uday and Cohen, Albert (2018) Polyhedral Auto-transformation with No Integer Linear Programming. In: ACM SIGPLAN NOTICES, 53 (4). pp. 529-542.

Acharya, Jayadev and Bhattacharyya, Arnab and Daskalakis, Constantinos and Kandasamy, Saravanan (2018) Learning and Testing Causal Models with Interventions. In: 32nd Conference on Neural Information Processing Systems (NIPS), December 2 - 8, 2018, Montreal, Canada.

Acharya, Jayadev and Bhattacharyya, Arnah and Kamath, Pritish (2017) Improved Bounds for Universal One-bit Compressive Sensing. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 2353-2357.

Acharya, P and Bhore, S and Gupta, A and Khan, A and Mondal, B and Wiese, A (2024) Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 8 July 2024through 12 July 2024, Tallinn.

Adabala, Neeharika and Manohar, Swami (2000) Modeling and rendering of gaseous phenomena using particle maps. In: The Journal of Visualization and Computer Animation, 11 (5). pp. 279-293.

Adhikari, NCD and Guha, B and Alka, A and Das, U (2022) PiXelNet: A DL-Based method for Diagnosing Lung Cancer using the Histopathological images. In: 5th Asia Conference on Machine Learning and Computing, ACMLC 2022, 28 - 30 December 2022, Hybrid, Bangkok, pp. 68-76.

Adhikary, Jyoti Ranjan and Murty, Narasimha M (2012) Feature selection for unsupervised learning. In: ICONIP 2012 19th International Conference, November 12-15, 2012, Doha, Qatar.

Adiga, A and Hurt, B and Kaur, G and Lewis, B and Marathe, M and Porebski, P and Venkatramanan, S and Dukkipati, A and Gracious, T and Gupta, S and Rathod, N and Sundaresan, R and Yasodharan, S and Bhimala, KR and Mudkavi, V and Patra, GK and Athreya, S (2023) A Multi-Team Multi-Model Collaborative Covid-19 Forecasting Hub for India. In: 2023 Winter Simulation Conference, 10 December 2023 through 13 December 2023, San Antonio, pp. 994-1005.

Adiga, Abhijin (2009) Cubicity of threshold graphs. In: Discrete Mathematics, 309 (8). 2535 -2537.

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2012) Polynomial time and parameterized approximation algorithms for boxicity. In: Proceedings of 7th International Symposium, IPEC 2012, September 12-14, 2012, Ljubljana, Slovenia, pp. 135-146.

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2011) A constant factor approximation algorithm for boxicity of circular arc graphs. In: WADS'11 Proceedings of the 12th International Conference on Algorithms and Data Structures, 2011, Heidelberg.

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2014) A constant factor approximation algorithm for boxicity of circular arc graphs. In: DISCRETE APPLIED MATHEMATICS, 178 . pp. 1-18.

Adiga, Abhijin and Babu, Jasine and Chandran, Sunil L (2018) Sublinear approximation algorithms for boxicity and related problems. In: DISCRETE APPLIED MATHEMATICS, 236 . pp. 7-22.

Adiga, Abhijin and Bhowmick, Diptendu and Chandran, Sunil L (2010) Boxicity and Poset Dimension. In: 16th Annual International Computing and Combinatorics Conference, JUL 19-21, 2010 , Nha Trang, VIETNAM, pp. 3-12.

Adiga, Abhijin and Bhowmick, Diptendu and Chandran, Sunil L (2010) The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. In: Discrete Applied Mathematics, 158 (16). pp. 1719-1726.

Adiga, Abhijin and Bhowmick, Diptendu and Chandran, Sunil L (2011) Boxicity and Poset Dimension. In: SIAM Journal on Discrete Mathematics, 25 (4). pp. 1687-1698.

Adiga, Abhijin and Chandran, Sunil and Sivadasan, NaveenL (2014) LOWER BOUNDS FOR BOXICITY. In: COMBINATORICA, 34 (6). pp. 631-655.

Adiga, Abhijin and Chandran, Sunil L (2010) Cubicity of Interval Graphs and the Claw Number. In: Journal of Graph Theory, 65 (4). pp. 323-333.

Adiga, Abhijin and Chandran, Sunil L (2014) REPRESENTING A CUBIC GRAPH AS THE INTERSECTION GRAPH OF AXIS-PARALLEL BOXES IN THREE DIMENSIONS. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 28 (3). pp. 1515-1539.

Adiga, Abhijin and Chandran, Sunil L (2012) Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. In: 12 Proceedings of the 2012 symposuim on Computational Geometry, June 17-20, 2012, Chapel Hill, NC, USA.

Adiga, Abhijin and Chandran, Sunil L and Mathew, Rogers (2011) Cubicity, degeneracy, and crossing number. In: Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011, 01.12.2011.

Adiga, BS and Shankar, P (1986) Fast Public Key Cryptosystem Based On Matrix Rings. In: Electronics Letters, 22 (22). pp. 1182-1183.

Adiga, BS and Shankar, P (1983) Simple Coding Scheme For Modular Arithmetic. In: Electronics Letters, 19 (17). pp. 703-705.

Aflalo, Jonathan and Ben-Tal, Aharon and Bhattacharyya, Chiranjib and Nath, Jagarlapudi Saketha and Raman, Sankaran (2011) Variable Sparsity Kernel Learning. In: Journal of Machine Learning Research, 12 . pp. 565-592.

Afraz, Mohammed and Saha, Diptikalyan and Kanade, Aditya (2015) P3: Partitioned Path Profiling. In: 10th Joint Meeting of the European Software Engineering Conference (ESEC) / ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), AUG 30-SEP 04, 2015 , Bergamo, ITALY , pp. 485-495.

Agarwal, S and Sprick, B (2005) Specification of access control and certification policies for semantic web services. In: E-commerce and Web Technologies, Proceedings Lecture Notes in Computer Science, 3590 . pp. 348-357.

Agarwal, P and Lakshmi, J (2019) Cost aware resource sizing and scaling of microservices. In: 4th International Conference on Cloud Computing and Internet of Things, CCIOT 2019, 20 September 2019, Tokyo, pp. 66-74.

Agarwal, Pankaj K and Arge, Lars and Govindarajan, Sathish and Yang, Jun and Yi, Ke (2013) Efficient external memory structures for range-aggregate queries. In: COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 46 (3). pp. 358-370.

Agarwal, Shivani (2011) Infinite push: a new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list. In: SDM 2011, Proceedings of the Eleventh SIAM International Conference on Data Mining, April 28-30, 2011, Mesa, Arizona.

Agarwal, Shivani (2014) Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses. In: JOURNAL OF MACHINE LEARNING RESEARCH, 15 . pp. 1653-1674.

Agarwal, T and Chattopadhyay, A and Natarajan, V (2021) Topological Feature Search in Time-Varying Multifield Data. In: 8th Workshop on Topological Methods in Data Analysis and Visualization, TopoInVis, 17 June - 19 June 2019, Nyköping, pp. 197-217.

Aggarwal, A and Vinayak, V and Bag, S and Bhattacharyya, C and Waghmare, UV and Maiti, PK (2021) Predicting the DNA Conductance Using a Deep Feedforward Neural Network Model. In: Journal of Chemical Information and Modeling, 61 . pp. 106-114.

Aggarwal, D and Kanukurthi, B and Obbattu, SLB and Obremski, M and Sekar, S (2022) Rate one-third non-malleable codes. In: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 20 - 24 June 2022, Rome, pp. 1364-1377.

Aggarwal, K and Bondhugula, U (2019) Optimizing the linear fascicle evaluation algorithm for many-core systems. In: 33rd ACM International Conference on Supercomputing, ICS 2019, 26 June 2019, Phoenix, pp. 425-437.

Aggarwal, M and Murty, MN (2020) Node Representations. [Book Chapter]

Aggarwal, M and Murty, MN (2020) Region and relations based multi attention network for graph classification. In: 25th International Conference on Pattern Recognition, 10-15 jan 2021, Virtual, pp. 8101-8108.

Aggarwal, Saurabh and Kuri, Joy and Saha, Chandan (2014) Give-and-take based peer-to-peer content distribution networks. In: SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 39 (4). pp. 843-858.

Agrawal, VK and Patnaik, LM and Goel, PS (1989) Specification-driven approach for protocol design of distributed computing systems. In: Journal of Microcomputer Applications, 12 (2). pp. 107-126.

Agrawal, Akanksha and Govindarajan, Sathish and Misra, Neeldhara (2014) Vertex Cover Gets Faster and Harder on Low Degree Graphs. In: 20th International Conference on Computing and Combinatorics (COCOON), AUG 04-06, 2014, Atlanta, GA, pp. 179-190.

Agrawal, DP and Patnaik, Lalit M (1993) Special Issue on Performance of Supercomputers : Guest Editors′ Introduction. In: Journal of Parallel and Distributed Computing, 19 (3). pp. 143-146.

Agrawal, Manindra and Saha, Chandan and Saptharishi, Ramprasad and Saxena, Nitin (2016) JACOBIAN HITS CIRCUITS: HITTING SETS, LOWER BOUNDS FOR DEPTH-D OCCUR-k FORMULAS AND DEPTH-3 TRANSCENDENCE DEGREE-k CIRCUITS. In: SIAM JOURNAL ON COMPUTING, 45 (4, SI). pp. 1533-1562.

Agrawal, Monu and Gupta, Neha and Shreelekshmi, R and Murty, Narasimha M (2005) Efficient pattern synthesis for nearest neighbour classifier. In: Pattern Recognition, 38 (11). pp. 2200-2203.

Agrawal, Shipra and Krishnan, Vijay and Haritsa, Jayant R (2004) On Addressing Efficiency Concerns in Privacy-Preserving Mining. In: 4th International Conference on Database Systems for Advanced Applications: DASFAA '04 (Lecture Notes in Computer Science), March 17-19, 2003, Jeju Island, Korea, Vol.2973, 113-124.

Agrawal, VK and Patnaik, LM and Goel, PS (1985) Towards formal specification of a distributed computing system. In: International Journal of Computer & Information Sciences, 14 (5). pp. 277-306.

Ahlawat, S and Vaghani, D and Tudu, J and Singh, V (2018) On securing scan design from scan-based side-channel attacks. In: 26th IEEE Asian Test Symposium, ATS 2017, 27 - 30 November 2017, Taipei, pp. 54-59.

Ahlawat, Satyadev and Tudu, Jaynarayan and Matrosova, Anzhela and Singh, Virendra (2016) A High Performance Scan Flip-Flop Design for Serial and Mixed Mode Scan Test. In: 22nd IEEE International Symposium on On-Line Testing and Robust System Design (IOLTS), JUL 04-06, 2016, Catalunya, SPAIN, pp. 233-238.

Ahlawat, Satyadev and Tudu, Jaynarayan and Matrosova, Anzhela and Singh, Virendra (2015) A New Scan Flip Flop Design to Eliminate Performance Penalty of Scan. In: 24th IEEE Asian Test Symposium, NOV 22-25, 2015, Mumbai, INDIA, pp. 25-30.

Ahlawat, Satyadev and Tudu, Jaynarayan T (2016) On minimization of test power through modified scan flip-flop. In: 20th International Symposium on VLSI Design and Test, VDAT 2016, 24-27 May 2016, Guwahati, India, pp. 1-6.

Ahlawat, Satyadev and Vaghani, Darshit and Tudu, Jaynarayan and Suhag, Ashok (2017) A Cost Effective Technique for Diagnosis of Scan Chain Faults. In: 21st International Symposium on VLSI Design and Test (VDAT), JUN 29-JUL 02, 2017, Indian Inst Technol Roorkee, Roorkee, INDIA, pp. 191-204.

Ahmad, J and Mohammad, CW and Sadiq, M (2022) Generation of One-Time Password for the Authentication of Software Requirements Using Secure Hash Algorithms. In: 9th International Conference on Recent Trends in Computing, 4-5 Jun 2021, Ghaziabad, pp. 627-640.

Ahmad, J and Mohammad, CW and Sadiq, M (2021) Identification of security requirements from the selected set of requirements under fuzzy environment. In: 2021 IEEE International Conference on Computing, Communication, and Intelligent Systems, ICCCIS 2021, 19-20 Feb 2020, Greater Noida, pp. 58-63.

Ahmed, Sk Miraj and Das, Niladri Ranjan and Chaudhury, Kunal Narayan (2019) Least-squares registration of point sets over SE(d) using closed-form projections. In: COMPUTER VISION AND IMAGE UNDERSTANDING, 183 . pp. 20-32.

Aithala, V and Sachan, A and Sen, S and Payal, H and Bhattacharya, C (2024) Decision time: illuminating performance in India�s district courts. In: Data and Policy, 6 (e32).

Ajay, A and Chander, S and Gupta, M (2019) Analysis of DC Characteristics of AlGaN/GaN HEMTs: Simulation. In: 4th International Conference on Devices, Circuits and Systems, ICDCS 2018, 16 - 17 March 2018, Coimbatore, pp. 8-11.

Ajimakin, AD and Devi, VS (2021) Estimation of von mises-fisher distribution algorithm, with application to support vector classification. In: 2021 Genetic and Evolutionary Computation Conference, GECCO 2021, 10-14 Jul 2021, pp. 199-200.

Ajimakin, AD and Devi, VS (2024) Quantum Acceleration of Black-Box Pseudo-Boolean Optimization Algorithms. In: IEEE Transactions on Evolutionary Computation .

Ajjanagadde, Venkatramana G and Patnaik, LM (1988) Design and performance evaluation of a systolic architecture for hidden-surface removal. In: Computers & Graphics, 12 (1). pp. 71-74.

Ajmera, S and Jain, H and Sundaresan, M and Sridharan, D (2020) Decoding task-specific cognitive states with slow, directed functional networks in the human brain. In: eNeuro, 7 (4). pp. 1-23.

Ajmera, S and Rajagopal, S and Ur Rehman, R and Sridharan, D (2019) Infra-slow brain dynamics as a marker for cognitive function and decline. In: 33rd Annual Conference on Neural Information Processing Systems, NeurIPS 2019, 8-14 December 2019, Vancouver; Canada.

Ajwani, Deepak and Elbassioni, Khaled and Govindarajan, Sathish and Ray, Saurabh (2012) Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors. In: Discrete & Computational Geometry, 48 (1). pp. 39-52.

Akhand, Bhupesh and Devi, Susheela V (2013) Multi Label Classification of Discrete Data. In: IEEE International Conference on Fuzzy Systems (FUZZ), JUL 07-10, 2013, Hyderabad, INDIA.

Alam, Mansoor and Sarma, VVS (1975) Optimal maintenance and replacement via a semi-Markov decision model. In: International Journal of Systems Science, 6 (9). 809 -818.

Alam, M and Sarma, VVS (2007) Optimal maintenance policy of a machine subject to failure. In: 1973 IEEE Conference on Decision and Control including the 12th Symposium on Adaptive Processes, Dec. 1973.

Albers, S and Khan, A and Ladewig, L (2020) Best fit bin packing with random order revisited. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague; Czech Republic.

Albers, S and Khan, A and Ladewig, L (2021) Improved Online Algorithms for Knapsack and GAP in the Random Order Model. In: Algorithmica .

Alicherry, Mansoor and Gopinath, K (2001) Predictable Management of System Resources for Linux. In: FREENIX Trac:2001 USENIX Annual Technical Conference, 25-30 June 2001, Boston, Massachusetts, USA, pp. 273-283.

Allender, Eric and Jiao, Jia and Mahajan, Meena and Vinay, V (1998) Non-commutative arithmetic circuits: depth reduction and size lower bounds. In: Theoretical Computer Science, 209 (1-2). pp. 47-86.

Alon, B and Nissenbaum, O and Omri, E and Paskin-Cherniavsky, A and Patra, A (2022) On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7 - 10 November 2022, Chicago, pp. 532-561.

Alon, Noga and Basavaraju, Manu and Chandran, Sunil L and Mathew, Rogers and Rajendraprasad, Deepak (2015) SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (1). pp. 59-64.

Alon, Noga and Basavaraju, Manu and Chandran, Sunil L and Mathew, Rogers and Rajendraprasad, Deepak (2018) Separation dimension and sparsity. In: JOURNAL OF GRAPH THEORY, 89 (1). pp. 14-25.

Altman, E and Reiffers, A and Menasché, DS and Datar, M and Dhamal, S and Touati, C (2019) Mining competition in a multi-cryptocurrency ecosystem at the network edge: A congestion game approach. In: 36th IFIP Performance Conference 2018, 5 - 7 December 2018, Toulouse, pp. 114-117.

Altman, Eitan and Hanawal, Manjesh Kumar and Sundaresan, Rajesh (2014) Regulation of Off-Network Pricing in a Nonneutral Network. In: ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 14 (2-3, S). pp. 45-65.

Alwen, Joel and Hirt, Martin and Maurer, Ueli and Patra, Arpita and Raykov, Pavel (2015) Anonymous Authentication with Shared Secrets. In: 3rd International Conference on Cryptology and Information Security in Latin America, SEP 17-19, 2014, Florianopolis, BRAZIL, pp. 219-236.

Amir, Amihood and Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) Overlap Matching. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 279-288.

Amir, Amihood and Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2003) Overlap matching. In: Information and Computation, 181 (1). pp. 57-74.

Amireddy, P and Garg, A and Kayal, N and Saha, C and Thankey, B (2023) Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.

Anand, Sai R and Madhavan, Veni CE (2000) An online, transferable E-cash payment system. In: Progress in Cryptology - INDOCRYPT 2000. First International Conference in Cryptology in India. Proceedings, 10-13 Dec. 2000, Calcutta, India, pp. 93-103.

Anand, Sunil Kumar and Srikant, YN (2005) Genetic Algorithm based Automatic Data Partitioning Scheme for HPF. In: 14th IEEE International Symposium on High Performance Distributed Computing, HPDC-14, 24-27 July 2005, Research Triangle Park, North Carolina, USA, pp. 289-290.

Ananth, Prabhanjan and Dukkipati, Ambedkar (2012) Algebraic characterization of rainbow connectivity. In: Proceedings of the CASC 2012 14th International Workshop, September 3-6, 2012, Maribor, Slovenia.

Ananth, Prabhanjan and Nasre, Meghana and Sarpatwar, Kanthi K (2011) Rainbow connectivity: hardness and tractability. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) , 01-Dec, 2011, Dagstuhl, Germany.

Ananth, Prabhanjan Vijendra and Dukkipati, Ambedkar (2011) Border basis detection is NP-complete. In: ISSAC '11 Proceedings of the 36th international symposium on Symbolic and algebraic computation, 2011, New York, NY, USA.

Ananthanarayana, VS and Murty, Narasimha M and Subramanian, DK (2001) Efficient clustering of large data sets. In: Pattern Recognition, 34 (12). pp. 2561-2563.

Ananthanarayana, VS and Murty, Narasimha M and Subramanian, DK (2003) Tree structure for efficient data mining using rough sets. In: Pattern Recognition Letters, 24 (6). pp. 851-862.

Ananthanarayana, VS and Subramanian, DK and Murty, MN (2003) Association rule mining activity : A general formalism. In: International Conference on Computer, Communication and Control Technologies (CCCT 03)/9th International Conference on Information Systems Analysis and Synthesis (ISAS03), JUL 31-AUG 02, 2003, Orlando, FLORIDA.

Ananthanarayana, VS and Subramanian, DK and Murty, Narasimha M (2000) Scalable, Distributed and Dynamic Mining of Association Rules. In: 7th International Conference of High Performance Computing - HiPC 2000, December 2000, Bangalore, India, pp. 559-566.

Ananthanarayanan, VS and Murty, MN and Subramanian, DK (2001) An incremental data mining algorithm for compact realization of prototypes. In: Pattern Recognition, 34 (11). pp. 2249-2251.

Ananthanarayanan, VS and Murty, Narasimha M and Subramanian, DK (2001) Multi-dimensional semantic clustering of large databases for association rule mining. In: Pattern Recognition, 34 (4). pp. 939-941.

Anbumani, K and Patnaik, L and Sarma, I (1981) Self-tuning minimum-variance control of nonlinear systems of the Hammerstein model. In: Ieee Transactions On Automatic Control, 26 (4). 959 -961.

Ande, A and Subhash, V and Natarajan, V (2023) tachyon: Efficient Shared Memory Parallel Computation of Extremum Graphs. In: Computer Graphics Forum .

Ankit, K and Shrivathsa, MS and Kolathaya, S and Ghose, D (2024) Reach abilty Analysis of UAVs through Cluttered Environments. In: AIAA SciTech Forum and Exposition, 2024, 8 January 2024through 12 January 2024, Orlando, Florida..

Ansari, JS (1974) Instability of Combustion. In: AIAA Journal, 12 (4). pp. 561-562.

Ansari, H and Vijayvergia, A and Kumar, K (2019) DCR-HMM: Depression detection based on Content Rating using Hidden Markov Model. In: 2018 Conference on Information and Communication Technology, CICT 2018, 26 - 28 October 2018, Jabalpur.

Ansari, TK and Kumar, R and Singh, S and Ganapathy, S and Devi, S (2017) Unsupervised HMM posteriograms for language independent acoustic modeling in zero resource conditions. In: 2017 IEEE Automatic Speech Recognition and Understanding Workshop, ASRU 2017, 16 - 20 December 2017, Okinawa, pp. 762-768.

Antony, D and Chandran, LS and Gayen, A and Gosavi, S and Jacob, S (2024) Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. In: 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, 18 March 2024through 22 March 2024, Puerto Varas, pp. 97-113.

Antony, D and Das, A and Gosavi, S and Jacob, D and Kulamarva, S (2024) Spanning caterpillar in biconvex bipartite graphs. In: Discrete Applied Mathematics, 356 . pp. 32-36.

Antony, D and Pal, S and Sandeep, RB (2025) Algorithms for subgraph complementation to some classes of graphs. In: Information Processing Letters, 188 .

Antony, M and Kakileti, ST and Shah, R and Sahoo, S and Bhattacharyya, C and Manjunath, G (2023) Challenges of AI driven diagnosis of chest X-rays transmitted through smart phones: a case study in COVID-19. In: Scientific Reports, 13 (1).

Anupindi, RS and Kotni, S and Basu, A (2022) memwalkd: Accelerating Key-value stores using Page Table Walkers. In: 29th Annual IEEE International Conference on High Performance Computing, Data, and Analytics, HiPC 2022, 18-21 December 2022, Bangalore, pp. 69-74.

Aparanji, Ullas and Kumar, Viraj (2016) Improving Classroom Discussions of Programming Assignments via Language Choice. In: IEEE 8th International Conference on Technology for Education (T4E), DEC 02-04, 2016, Indian Inst Technol Bombay, Mumbai, INDIA, pp. 42-45.

Applebaum, B and Ishai, Y and Karni, O and Patra, A (2022) Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. In: 42nd Annual International Cryptology Conference, CRYPTO 2022, 15 August 2022 - 18 August 2022, Barbara, pp. 453-482.

Applebaum, B and Kachlon, E and Patra, A (2022) Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security: (Extended Abstract). In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7 - 10 November 2022, Chicago, pp. 103-120.

Applebaum, B and Kachlon, E and Patra, A (2022) Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority: (Extended Abstract). In: 42nd Annual International Cryptology Conference, CRYPTO 2022, 15 - 18 August 2022, Santa Barbara, pp. 33-56.

Applebaum, B and Kachlon, E and Patra, A (2020) The resiliency of MPC with low interaction: The benefit of making errors (extended abstract). In: 18th International Conference on Theory of Cryptography, TCCC 2020, 16 November 2020 through 19 November 2020, Durham; United States, pp. 562-594.

Aranha, DF and Bennedsen, EM and Campanelli, M and Ganesh, C and Orlandi, C and Takahashi, A (2022) ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. In: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2022, 8 March 2022 through 11 March 2022, Virtual, Online, pp. 584-614.

Arava, R and Bagchi, D and Suresh, P and Narahari, Y and Subrahmanya, SV (2010) Optimal allocation of carbon credits to emitting agents in a carbon economy. In: 2010 IEEE Conference on Automation Science and Engineering (CASE) , 21-24 Aug. 2010, Toronto, ON.

Arava, Radhika and Narahari, Y and Bagchi, Deepak and Suresh, P and Subrahmanya, SV (2010) Mechanism design problems in carbon economics. In: Journal of the Indian Institute of Science, 90 (3). pp. 381-411.

Arif, M and Mohammad, CW and Sadiq, M (2020) Software requirements modeling: A systematic literature review. In: 2020 IEEE International Conference on Computing, Power and Communication Technologies, GUCON 2020, 2-4 October 2020, Greater Noida; India, pp. 194-200.

Arjun, S and Murthy, LRD and Biswas, P (2021) Interactive Sensor Dashboard for Smart Manufacturing. In: 3rd International Conference on Industry 4.0 and Smart Manufacturing, ISM 2021, 21 November 2021, pp. 49-61.

Arora, H and Komondoor, R and Ramalingam, G (2019) Checking observational purity of procedures. In: 22nd International Conference on Fundamental Approaches to Software Engineering, FASE 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, 6 April 2019 - 11 April 2019, Prague, pp. 228-243.

Arpith, K and Gopinath, K (2020) Need for a deeper cross-layer optimization for dense NAND SSD to improve read performance of big data applications: A case for melded pages. In: HotStorage 2020 - 12th USENIX Workshop on Hot Topics in Storage and File Systems, co-located with USENIX ATC 2020, 13-14 July 2020, Virtual, Online.

Arun, R and Suresh, V and Madhavan, CE Veni (2009) Clustering in Concept Association Networks. In: 3rd International Conference on Pattern Recognition and Machine Intelligence, DEC 16-20, 2009, IIT Delhi, pp. 86-91.

Arun, B and Chandru, V and Ganguly, AD and Manohar, S (2000) Molecular Dynamics Visualization with XML and VRML. In: Computer Graphics International, 2000, 19-24 June, Geneva,Switzerland, pp. 335-341.

Arun, R and Suresh, Vommina and Madhavan, Veni CE and Murty, Narasimha M (2010) On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations. In: 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, JUN 21-24, 2010, Hyderabad, pp. 391-402.

Arunachaleswaran, ER and Barman, S and Kumar, R and Rathi, N (2019) Fair and Efficient Cake Division with Connected Pieces. In: 15th Conference on Web and Internet Economics, WINE 2019, 10 - 12 December 2019, New York City, pp. 57-70.

Arvind, Murching M and Srikant, YN (1989) Incremental attribute evaluation through recursive procedures. In: Computer Languages, 14 (4). pp. 225-237.

Arya, Sunil and Cheng, Siu-Wing and Mount, David M and Ramesh, H (2000) Efficient Expected-Case Algorithms for Planar Point Location. In: 7th Scandinavian Workshop on Algorithm Theory- SWAT 2000, July 2000, Bergen, Norway, pp. 353-366.

Arya, Sunil and Ramesh, H (1998) A 2.5-factor approximation algorithm for the k-MST problem. In: Information Processing Letters, 65 (3). pp. 117-118.

Ashajayanthi, AV and Rajaram, S and Viswanadham, N (1979) A Parallel Processor for Real-Time Speech Signal Processing. In: IEEE International Conference on Acoustics, Speech, and Signal Processing. ICASSP'79, April, Vol.4, 868 -871.

Asharaf, S and Murthy, Narasimha M (2003) An adaptive rough fuzzy single pass algorithm for clustering large data sets. In: Pattern Recognition, 36 (12). pp. 3015-3018.

Asharaf, S and Murty, M Narasimha and Shevade, SK (2007) Cluster based training for scaling non-linear support vector machines. In: International Conference on Computing - Theory and Applications, MAR 05-07, 2007, Kolkata.

Asharaf, S and Murty, Narasimha M (2004) A rough fuzzy approach to web usage categorization. In: Fuzzy Sets and Systems, 148 (1). pp. 119-129.

Asharaf, S and Murty, Narasimha M and Shevade, SK (2006) Cluster based core vector machine. In: 6th IEEE International Conference on Data Mining,, Dec 18-22, 2006, Hong Kong, pp. 1038-1042.

Asharaf, S and Murty, Narasimha M and Shevade, SK (2006) Rough set based incremental clustering of interval data. In: Pattern Recognition Letters, 27 (6). pp. 515-519.

Asharaf, S and Narasimha Murty, M and Shevade, SK (2007) Multiclass Core Vector Machine. In: International Conference on Machine Learning (ICML-07), 2007, June 2007, New York, NY.

Asharaf, S and Shevade, SK and Murty, Narasimha M (2005) Rough support vector clustering. In: Pattern Recognition, 38 (10). pp. 1779-1783.

Asharaf, S and Shevade, SK and Murty, Narasimha M (2006) Scalable Rough Support Vector Clustering. CSA/ISL/ASH 0001.

Asharaf, S and Shevade, SK and Murty, Narasimha M (2006) Scalable non-linear Support Vector Machine using hierarchical clustering. In: 18th International Conference on Pattern Recognition (ICPR 2006), AUG 20-24, 2006, Hong Kong, pp. 908-911.

Ashok, Pradeesha and Azmi, Umair and Govindarajan, Sathish (2014) Small strong epsilon nets. In: COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 47 (9). pp. 899-909.

Ashok, Pradeesha and Basu Roy, Aniket and Govindarajan, Sathish (2019) Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. In: Journal of Combinatorial Optimization, 39 (2). pp. 618-635. ISSN 0302-9743

Ashok, Pradeesha and Govindarajan, Sathish (2015) On strong centerpoints. In: INFORMATION PROCESSING LETTERS, 115 (3). pp. 431-434.

Ashok, Pradeesha and Kolay, Sudeshna and Misra, Neeldhara and Saurabh, Saket (2015) Unique Covering Problems with Geometric Sets. In: 21st International Computing and Combinatorics Conference (COCOON) , AUG 04-06, 2015, Beijing, PEOPLES R CHINA, pp. 548-558.

Ashwin, B and Narahari, Y and Biswas, SK (2008) Cost Sharing Mechanisms for Business Clusters with Strategic Firms. In: IEEE International Conference on Automation Science and Engineering, AUG 23-26, 2008, Arlington.

Athaiya, S and Komondoor, R and Kumar, KN (2021) Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains. In: 30th European Symposium on Programming, ESOP 2021, 27 March - 1 April 2021, Luxembourg, pp. 30-58.

Athaiya, Snigdha (2017) Inferring page models for web application analysis. In: 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2017, 10 - 14 July 2017, Santa Barbara, pp. 412-415.

Athaiya, Snigdha and Komondoor, Raghavan (2017) Testing and analysis of web applications using page models. In: 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2017, 10 - 14 July 2017, Santa Barbara, pp. 181-191.

Athithan, Biswajit Paul G and Murty, MN (2009) Speeding up AdaBoost Classifier with Random Projection. In: 7th International Conference on Advances in Pattern Recognition, FEB 04-06, 2009, Indian Statist Inst, Kolkata, INDIA,.

Atkins, FM and Friedman, MM and Rao, PVS and Metcalfe, DD (1985) Interactions between Mast Cells, Fibroblasts and Connective Tissue Components. In: International Archives Of Allergy And Applied Immunology, 77 (1-2). pp. 96-102.

Avrachenkov, K and Patil, K and Thoppe, G (2020) Change Rate Estimation and Optimal Freshness in Web Page Crawling. In: 13th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2020, 18-20 May 2020, Tsukuba; Japan, pp. 3-10.

Avrachenkov, K and Patil, K and Thoppe, G (2022) Online algorithms for estimating change rates of web pages. In: Performance Evaluation, 153 .

Ayyadevara, N and Dabas, R and Khan, A and Sreenivas, KVN (2022) Near-Optimal Algorithms for Stochastic Online Bin Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Ayyagari, RS and Dukkipati, A (2023) Risk-Averse Combinatorial Semi-Bandits. In: IEEE International Symposium on Information Theory - Proceedings, 25 - 30 June 2023, Taipei, Taiwan, pp. 1472-1477.

Azeez, Najath Abdul and Dey, Anubrata and Mathew, K and Mathew, Jaison and Gopakumar, K (2012) A nearly constant switching frequency current hysteresis controller with generalized parabolic boundaries using 12-sided polygonal voltage space vectors for IM drives. In: 2012 XXth International Conference on Electrical Machines (ICEM), 2-5 Sept. 2012, Marseille.

B

Babalad, S and Shevade, S and Thazhuthaveetil, MJ and Govindarajan, R (2024) Tile Size and Loop Order Selection using Machine Learning for Multi-/Many-Core Architectures. In: 38th ACM International Conference on Supercomputing, ICS 2024, 4 June 2024through 7 June 2024, Kyoto, Japan, pp. 388-399.

Babaria, Rashmin and Saketha Nath, J and Krishnan, S and Sivaramakrishnan, KR and Bhattacharyya, Chiranjib and Murty, MN (2007) Focussed Crawling with large scale Ordinal Regression Solvers. In: ICML '07 Proceedings of the 24th international conference on Machine learning , New York, NY.

Babichenko, Y and Barman, S (2017) Algorithmic aspects of private Bayesian persuasion. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, 9 - 11 January 2017, Berkeley.

Babu, GP and Murty, MN (1994) Controlled offspring generation in evolutionary programming. In: Third Annual Conference on Evolutionary Programming, 24-26 Feb. 1994, San Diego, CA, USA, pp. 253-260.

Babu, GP and Murty, MN (1994) Simulated annealing for selecting optimal initial seeds in the K-means algorithm. In: Indian Journal of Pure and Applied Mathematics, 25 (1-2). pp. 85-94.

Babu, KR and Sarma, IG and Swamy, KN (1995) Sliding mode estimation scheme for missile homing guidance. In: Automatic Control in Aerospace (Aerospace Control '94). A Postprint Volume from the IFAC Symposium, 12-16 Sept. 1994, Palo Alto, CA, USA, pp. 405-410.

Babu, Ravindra K and Sarma, IG and Swamy, KN (1994) Switched Bias Proportional Navigation for Homing Guidance Against Highly Maneuvering Targets. In: Journal of Guidance, Control, and Dynamics, 17 (6). pp. 1357-1363.

Babu, GP and Murty, MN (1994) Connectionist approach for global optimization. In: 1994 IEEE International Conference on Neural Networks (ICNN 94) - 1st IEEE World Congress on Computational Intelligence, JUN 26-29, 1994, ORLANDO, FL.

Babu, GP and Murty, MN and Ram, BR (1996) Clan-based evolutionary approach for solving control problems. In: Computers & Mathematics with Applications, 31 (6). pp. 41-60.

Babu, J and Chandran, LS and Francis, M and Prabhakaran, V and Rajendraprasad, D and Warrier, JN (2019) On graphs with minimal eternal vertex cover number. In: 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, 14 - 16 February 2019, Kharagpur, pp. 263-273.

Babu, Jasine and Basavaraju, Manu and Chandran, L Sunil and Francis, Mathew C (2019) On induced colourful paths in triangle-free graphs. In: DISCRETE APPLIED MATHEMATICS, 255 . pp. 109-116.

Babu, Jasine and Basavaraju, Manu and Chandran, Sunil L and Rajendraprasad, Deepak (2014) 2-Connecting outerplanar graphs without blowing up the pathwidth. In: 19th Annual International Computing and Combinatorics Conference (COCOON, JUN, 2013, Hanhzhou, PEOPLES R CHINA, pp. 119-134.

Babu, Jasine and Biniaz, Ahmad and Maheshwari, Anil and Smid, Michiel (2014) Fixed-orientation equilateral triangle matching of point sets. In: THEORETICAL COMPUTER SCIENCE, 555 . pp. 55-70.

Babu, Jasine and Chandran, Sunil L and Rajendraprasad, Deepak (2015) Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. In: EUROPEAN JOURNAL OF COMBINATORICS, 48 (SI). pp. 110-126.

Babu, Jasine and Chandran, Sunil L and Vaidyanathan, Krishna (2015) Rainbow matchings in strongly edge-colored graphs. In: DISCRETE MATHEMATICS, 338 (7). pp. 1191-1196.

Babu, Phanendra G (1995) Clustering in non-stationary environments using a clan-based evolutionary approach. In: Biological Cybernetics, 73 (4). pp. 367-374.

Babu, Phanendra G and Murty, Narasimha M (1994) Clustering with evolution strategies. In: Pattern Recognition, 27 (2). pp. 321-329.

Babu, Phanendra G and Murty, Narasimha M (1995) Optimal thresholding using multi-state stochastic connectionist approach. In: Pattern Recognition Letters, 16 (1). pp. 11-18.

Babu, Phanendra G and Murty, Narasimha M (1993) A Probabilistic Neural Network for Designing Good Codes. In: 1993 International Joint Conference on Neural Networks (IJCNN '93-Nagoya), 25-29 October, Japan, Vol.2, 1590 -1593.

Babu, Phanendra G and Murty, Narasimha M (1993) A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm. In: Pattern Recognition Letters, 14 (10). pp. 763-769.

Babu, Phanendra G and Murty, Narasimha M and Keerthi, Sathiya S (2000) A Stochastic Connectionist Approach for Global Optimization with Application to Pattern Clustering. In: IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics, 30 (1). pp. 10-24.

Babu, Ravindra T and Murty, Narasimha M (2001) Comparison of genetic algorithm based prototype selection schemes. In: Pattern Recognition, 34 (2). pp. 523-525.

Babu, Ravindra T and Murty, Narasimha M and Agrawal, VK (2004) Adaptive Boosting with Leader Based Learners for Classification of Large Handwritten Data. In: Fourth International Conference on Hybrid Intelligent Systems, 2004, 5-8 December, Kitakyushu,Japan, 326 -331.

Babu, Ravindra T and Murty, Narasimha M and Agrawal, VK (2004) Hybrid Learning Scheme for Data Mining Applications. In: Fourth International Conference on Hybrid Intelligent Systems, 2004, 5-8 December, Kitakyushu,Japan, 266 -271.

Babu, TR and Murty, MN and Agrawal, VK (2005) Hybrid learning scheme for data mining applications. In: Hybrid learning scheme for data mining applications, DEC 05-08, 2004, Kitakyushu.

Babu Sam, D and Venkatesh Babu, R (2018) Top-down feedback for crowd counting convolutional neural network. In: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, 2 - 7 February 2018, New Orleans, pp. 7323-7330.

Babua, Ravindra T and Murty, Narasimha M and Agrawal, VK (2007) Classification of run-length encoded binary data. In: Pattern Recognition, 40 (1). 321 -323.

Badrinath, Rama and Venkatasubramaniyan, Suresh and Veni Madhavan, CE (2011) Improving query focused summarization using look-ahead strategy. In: ECIR 2011, 33rd European Conference on IR Research, April 18-21, 2011, Dublin, Ireland.

Bajpai, R and Hazarika, D and Singh, K and Gorantla, S and Cambria, E and Zimmermann, R (2023) Aspect-Sentiment Embeddings for Company Profiling and Employee Opinion Mining. In: 19th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2018, 18-24 March 2018, Hanoi, pp. 142-160.

Balaji, R and Manokar, V and Manokar, NV and Patnaik, LM (2018) Data analysis for decomposition and classification of diseased fmri brain images for inter-racial disease types of alzheimer�s vs tumors using sofm and enhancement by lvq neural networks and comparisons with ga and svms. In: Journal of Advanced Research in Dynamical and Control Systems, 10 (12 Spe). pp. 1130-1136.

Balaji, S and Patnaik, LM and Jenkins, Lawrence and Goel, PS (1992) S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms. In: Journal of Parallel and Distributed Computing, 15 (3). pp. 225-237.

Balakrishnan, Rohini and Bahuleyan, Jimmy and Nandi, Diptarup and Jain, Manjari (2014) Modelling the effects of chorus species composition and caller density on acoustic masking interference in multispecies choruses of crickets and katydids. In: ECOLOGICAL INFORMATICS, 21 (SI). pp. 50-58.

Balamurugan, P (2013) Large-Scale Elastic Net Regularized Linear Classification SVMs and Logistic Regression. In: IEEE 13th International Conference on Data Mining (ICDM), DEC 07-10, 2013, Dallas, TX, pp. 949-954.

Balamurugan, P and Shevade, Shirish and Babu, Ravindra T (2012) Efficient Algorithms for Linear Summed Error Structural SVMs. In: IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)/International Joint Conference on Neural Networks (IJCNN)/IEEE Congress on Evolutionary Computation (IEEE-CEC)/IEEE World Congress on Computational Intelligence (IEEE-WCCI) , JUN 10-15, 2012 , Brisbane, AUSTRALIA.

Balamurugan, P and Shevade, Shirish and Babu, Ravindra T (2014) Scalable sequential alternating proximal methods for sparse structural SVMs and CRFs. In: KNOWLEDGE AND INFORMATION SYSTEMS, 38 (3). pp. 599-621.

Balamurugan, P and Shevade, Shirish and Babu, Ravindra T (2012) Sequential alternating proximal method for scalable sparse structural SVMs. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), 10-13 Dec. 2012, Brussels, BELGIUM, pp. 61-70.

Balamurugan, P and Shevade, Shirish and Sundararajan, S (2015) A Simple Label Switching Algorithm for Semisupervised Structural SVMs. In: NEURAL COMPUTATION, 27 (10). pp. 2183-2206.

Balamurugan, P and Shevade, Shirish and Sundararajan, S and Keerthi, Sathiya S (2011) A sequential dual method for structural SVMs. In: 2011 SIAM International Conference on Data Mining (SDM), April 28-30,2011, Mesa, Arizona, USA.

Balasubramanian, Madhusudhanan and Zabic, Stanislav and Bowd, Christopher and Thompson, Hilary W and Wolenski, Peter and Iyengar, Sitharama S and Karki, Bijaya B and Zangwill, Linda M (2009) A Framework for Detecting Glaucomatous Progression in the Optic Nerve Head of an Eye Using Proper Orthogonal Decomposition. In: IEEE Transactions on Information Technology in Biomedicine, 13 (5). pp. 781-793.

Balgi, S and Dukkipati, A (2019) CUDA: Contradistinguisher for unsupervised domain adaptation. In: 19th IEEE International Conference on Data Mining, ICDM 2019, 8-11 November, 2019, Beijing; China, pp. 21-30.

Baligar, VP and Patnaik, LM and Nagabhushana, GR (2006) Low complexity, and high fidelity image compression using fixed threshold method. In: Information Sciences, 176 (6). pp. 664-675.

Baligar, Vishwanath P and Patnaik, LM and Nagabhushana, GR (2003) High compression and low order linear predictor for lossless coding of grayscale images. In: Image and Vision Computing, 21 (6). pp. 543-550.

Banchhor, S and Gajjala, R and Sabharwal, Y and Sen, S (2021) Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 15-17 Dec 2021, Virtual, Online.

Bandishti, Vinayaka and Pananilath, Irshad and Bondhugula, Uday (2012) Tiling stencil computations to maximize parallelism. In: 12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, 2012, New York.

Bandyapadhyay, Sayan and Basu Roy, Aniket (2017) Effectiveness of Local Search for Art Gallery Problems. In: 15th International Symposium on Algorithms and Data Structures, WADS 2017, 31 July 2017 - 2 August 2017, St. John’s, NL, Canada, pp. 49-60.

Bandyopadhyay, S and Aggarwal, M and Murty, MN (2021) A Deep Hybrid Pooling Architecture for Graph Classification with Hierarchical Attention. In: 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 11-14 May 2021, pp. 554-565.

Bandyopadhyay, S and Biswas, A and Kara, H and Murty, MN (2020) A multilayered informative randomwalk for attributed social network embedding. In: Frontiers in Artificial Intelligence and Applications, 29 August-8 September 2020, Santiago de Compostela, Online; Spain, pp. 1738-1745.

Bandyopadhyay, S and Lokesh, N and Murty, MN (2019) Outlier aware network embedding for attributed networks. In: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 27 - 1 February 2019, Honolulu, pp. 12-19.

Bandyopadhyay, S and Lokesh, N and Vivek, SV and Murty, MN (2020) Outlier resistant unsupervised deep architectures for attributed network embedding. In: WSDM 2020 - Proceedings of the 13th International Conference on Web Search and Data Mining, 3-7 Feb., 2020, Houston, USA, pp. 25-33.

Bandyopadhyay, S and Peter, V (2021) Unsupervised constrained community detection via self-expressive graph neural network. In: 37th Conference on Uncertainty in Artificial Intelligence, UAI 2021, 1088, pp. 1078-1088.

Bandyopadhyay, S and Vishal Vivek, S and Murty, MN (2020) Integrating network embedding and community outlier detection via multiclass graph description. In: Frontiers in Artificial Intelligence and Applications, 29 August-8 September 2020, Santiago de Compostela, Online; Spain, pp. 976-983.

Bandyopadhyay, Sambaran and Murty, M Narasimha (2017) Axioms to Characterize Efficient Incremental Clustering. In: 23rd International Conference on Pattern Recognition (ICPR), DEC 04-08, 2016, Mexican Assoc Comp Vis Robot & Neural Comp, Cancun, MEXICO, pp. 450-455.

Bandyopadhyay, Sambaran and Nandanwar, Sharad and Deshmukh, Rishabh and Musti, Narasimha Murty (2018) DivGroup: A Diversified Approach to Divide Collection of Patterns into Uniform Groups. In: 24th International Conference on Pattern Recognition (ICPR), AUG 20-24, 2018, Chinese Acad Sci, Inst Automat, Beijing, PEOPLES R CHINA, pp. 964-969.

Bandyopadhyay, Sambaran and Narayanam, Ramasuri and Murty, Narasimha M (2018) A Generic Axiomatic Characterization for Measuring Influence in Social Networks. In: 24th International Conference on Pattern Recognition (ICPR), AUG 20-24, 2018, Chinese Acad Sci, Inst Automat, Beijing, PEOPLES R CHINA, pp. 2606-2611.

Bangalore, L and Choudhury, A and Patra, A (2020) The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. In: Journal of the ACM, 67 (3).

Bangalore, Laasya and Choudhury, Ashish and Patra, Arpita (2018) Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. In: 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), JUL 23-27, 2018, Royal Holloway Univ London, Egham, ENGLAND, pp. 295-304.

Baraskar, O and Dewan, A and Saha, C and Sinha, P (2024) NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 8 July 2024through 12 July 2024, Tallinn.

Barequet, Gill and De, Minati (2017) Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. In: 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), FEB 16-18, 2017, Sancoale, INDIA, pp. 24-36.

Barman, S and Bhaskar, U and Krishna, A and Sundaram, RG (2020) Tight approximation algorithms for p-mean welfare under subadditive valuations. In: Leibniz International Proceedings in Informatics, LIPIcs, 7- 9 September 2020, Virtual, Pisa.

Barman, S and Bhaskar, U and Pandit, Y and Pyne, S (2024) Nearly Equitable Allocations beyond Additivity and Monotonicity. In: 38th AAAI Conference on Artificial Intelligence, AAAI 2024, 20 February 2024through 27 February 2024, Vancouver, pp. 9494-9501.

Barman, S and Bhaskar, U and Shah, N (2020) Optimal Bounds on the Price of Fairness for Indivisible Goods. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7-11 December 2020, Beijing; China, pp. 356-369.

Barman, S and Bhattacharyya, A and Ghoshal, S (2018) Testing sparsity over known and unknown bases. In: 35th International Conference on Machine Learning, ICML 2018, 10 - 15 July 2018, Stockholm, pp. 819-843.

Barman, S and Echenique, F (2020) The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. In: 21st ACM Conference on Economics and Computation, EC 2020, 13 - 17, July 2020, Hungary, pp. 765-766.

Barman, S and Echenique, F (2023) The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. In: Mathematics of Operations Research, 48 (1). pp. 313-331.

Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2020) Tight Approximation Bounds for Maximum Multi-coverage. In: 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, 8-10 Jun 2020, London, pp. 66-77.

Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2022) Tight approximation bounds for maximum multi-coverage. In: Mathematical Programming, 192 (1-2). pp. 443-476.

Barman, S and Ghalme, G and Jain, S and Kulkarni, P and Narang, S (2019) Fair division of indivisible goods among strategic agents. In: 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019, 13 - 17 May 2019, Montreal, pp. 1811-1813.

Barman, S and Gopalan, A and Saha, A (2018) Online learning for structured loss spaces. In: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, 2 - 7 February 2018, New Orleans, pp. 2696-2703.

Barman, S and Kar, D and Pathak, S (2024) Parameterized Guarantees for Almost Envy-Free Allocations. In: AAMAS 2024, 6 May 2024through 10 May 2024, Auckland, New Zealand, pp. 151-159.

Barman, S and Krishna, A and Kulkarni, P and Narang, S (2024) Sublinear approximation algorithm for nash social welfare with XOS valuations. In: UNSPECIFIED.

Barman, S and Krishna, A and Narahari, Y and Sadhukan, S (2022) Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. In: 31st International Joint Conference on Artificial Intelligence, IJCAI 2022, 23 - 29 July 2022, Vienna, pp. 60-66.

Barman, S and Krishna, A and Narahari, Y and Sadhukhan, S (2022) Nash Welfare Guarantees for Fair and Efficient Coverage. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2 - 15 December 2022, Troy, pp. 256-272.

Barman, S and Krishnamurthy, R and Rahul, S (2021) Optimal Algorithms for Range Searching over Multi-Armed Bandits. In: 30th International Joint Conference on Artificial Intelligence, IJCAI 2021, 19-27 Aug 2021, Virtual, Online, pp. 2177-2183.

Barman, S and Krishnamurthy, SK (2020) Approximation Algorithms for Maximin Fair Division. In: ACM Transactions on Economics and Computation, 8 (1).

Barman, S and Kulkarni, P (2023) Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.

Barman, S and Rathi, N (2020) Fair Cake Division under Monotone Likelihood Ratios. In: 21st ACM Conference on Economics and Computation, EC 2020, 13-17, July 2020, Hungary, pp. 401-437.

Barman, S and Verma, P (2022) Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. In: 17th International Conference on Web and Internet Economics, WINE 2021, 14 - 17 December 2021, Virtual, Online, pp. 373-390.

Barman, Siddharth (2018) APPROXIMATING NASH EQUILIBRIA AND DENSE SUBGRAPHS VIA AN APPROXIMATE VERSION OF CARATHEODORY'S THEOREM. In: SIAM JOURNAL ON COMPUTING, 47 (3). pp. 960-981.

Barman, Siddharth and Fawzi, Omar (2018) Algorithmic Aspects of Optimal Channel Coding. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (2). pp. 1038-1045.

Barman, Siddharth and Krishnamurthy, Sanath Kumar and Vaish, Rohit (2018) Greedy Algorithms for Maximizing Nash Social Welfare. In: 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018, 10 July 2018, Sweden, pp. 7-13.

Barua, Rana and Roy, Suman and Chaochen, Zhou (1999) Completeness of Neighbourhood Logic. [Book Chapter]

Basavaraju, M and Chandran, LS and Karthick, T (2012) Maximum weight independent sets in hole- and dart-free graphs. In: Discrete Applied Mathematics, 160 (16-17). pp. 2364-2369.

Basavaraju, M and Sunil Chandran, L and Francis, MC and Naskar, A (2024) Weak Total Coloring Conjecture and Hadwiger�s Conjecture on Total Graphs. In: Electronic Journal of Combinatorics, 31 (1).

Basavaraju, Manu and Chandran, Sunil L (2009) Acyclic Edge Coloring of Graphs with Maximum Degree 4. In: Journal Of Graph Theory, 61 (3). pp. 192-209.

Basavaraju, Manu and Chandran, Sunil L (2010) Acyclic Edge Coloring of Triangle Free Planar Graphs CoRR abs. UNSPECIFIED.

Basavaraju, Manu and Chandran, Sunil L (2012) Acyclic Edge Coloring of Triangle-Free Planar Graphs. In: JOURNAL OF GRAPH THEORY, 71 (4). pp. 365-385.

Basavaraju, Manu and Chandran, Sunil L (2012) Acyclic edge coloring of 2-degenerate graphs. In: Journal of Graph Theory, 69 (1). pp. 1-27.

Basavaraju, Manu and Chandran, Sunil L and Cohen, Nathann and Havet, Frederic and Mueller, Tobias (2011) Acyclic Edge-Coloring of Planar Graphs. In: SIAM Journal on Discrete Mathematics, 25 (2). pp. 463-478.

Basavaraju, Manu and Chandran, Sunil L and Golumbic, Martin Charles and Mathew, Rogers and Rajendraprasad, Deepak (2016) Separation Dimension of Graphs and Hypergraphs. In: 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), JUN 25-27, 2014, Nouan le Fuzelier, FRANCE, pp. 187-204.

Basavaraju, Manu and Chandran, Sunil L and Rajendraprasad, Deepak and Ramaswamy, Arunselvan (2014) Rainbow Connection Number of Graph Power and Graph Products. In: GRAPHS AND COMBINATORICS, 30 (6). pp. 1363-1382.

Basavaraju, Manu and Chandran, Sunil L and Ramaswamy, Arunselvan and Rajendraprasad, Deepak (2010) Rainbow Connection Number and Radius. UNSPECIFIED.

Basavaraju, Manu and Chandran, Sunil L (2008) Acyclic edge coloring of subcubic graphs. In: Discrete Mathematics, 308 (24). pp. 6650-6653.

Basavaraju, Manu and Chandran, Sunil L (2009) A note on acyclic edge coloring of complete bipartite graphs. In: Discrete Mathematics, 309 (13). pp. 4646-4648.

Basavaraju, Manu and Chandran, Sunil L and Kummini, Manoj (2010) d-Regular Graphs of Acyclic Chromatic Index at Least d+2. In: Journal of Graph Theory, 63 (3). pp. 226-230.

Basu, Arkaprava and Greathouse, Joseph L and Venkataramani, Guru and Vesely, Jan (2018) Interference from GPU System Service Requests. In: 2018 IEEE International Symposium on Workload Characterization, IISWC 2018, 30 September - 2 October 2018, Raleigh; United States, pp. 179-190.

Basu, Julie and Patnaik, LM and Goswami, AK (1987) Ordered Ports – a Language Concept for High-level Distributed Programming. In: Computer Journal, The, 30 (6). pp. 487-497.

Baswana, Surender and Kavitha, Telikepalli (2010) Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. In: SIAM Journal on Computing, 39 (7). pp. 2865-2896.

Baswana, Surender and Kavitha, Telikepalli and Mehlhorn, Kurt and Pettie, Seth (2011) Additive Spanners and (alpha, beta)-Spanners. In: ACM Transactions on Algorithms, 7 (1).

Baswana, Surender and Sen, Sandeep and Hariharan, Ramesh (2002) Improved Decremental Algorithms for Maintaining Transitive Closure and Allpairs Shortest Paths. In: of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada, pp. 117-123.

Bayanna, Raja A and Louis, Rohan E and Chatterjee, S and Mathew, Shibu K and Venkatakrishnan, P (2015) Membrane-based deformable mirror: intrinsic aberrations and alignment issues. In: APPLIED OPTICS, 54 (7). pp. 1727-1736. (In Press)

Beck, RR and Vijeev, A and Ganapathy, V (2020) Privaros: A Framework for Privacy-Compliant Delivery Drones. In: 27th ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, 9-13 Nov 2020, Virtual, Online, United States, pp. 181-194.

Behera, TK and Mishra, BS and Patnaik, LM and Girault, C (1994) Modelling And Performance Evaluation Of Flexible Manufacturing Systems Using Deterministic And Stochastic Timed Petri Nets. In: Fourth International Conference on Factory 2000 - Advanced Factory Automation, 3-5 October, United Kingdom, pp. 362-368.

Bellikar, Ganesh and Bhatia, Ashutosh and Hansdah, RC and Singh, Sudhanshu (2018) 3TAAV: A Three-Tier Architecture for Pseudonym-Based Anonymous Authentication in VANETs. In: 2018 International Conference on Information Networking (ICOIN), 10-12 Jan. 2018, Chiang Mai, Thailand, pp. 420-425.

Belur, Dasarathy V and Kumar, Bharath KP (1978) CHITRA: Cognitive handprinted input-trained recursively analyzing system for recognition of alphanumeric characters. In: International Journal of Computer & Information Sciences, 7 (3). pp. 253-282.

Ben-Tal, Aharon and Bhadra, Sahely and Bhattacharyya, Chiranjib and Nath, Saketha J (2011) Chance constrained uncertain classification via robust optimization. In: Mathematical Programming, 127 (1). pp. 145-173.

Ben-Tal, Aharon and Bhadra, Sahely and Bhattacharyya, Chiranjib and Nemirovski, Arkadi (2012) Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices. In: JOURNAL OF MACHINE LEARNING RESEARCH, 13 . pp. 2923-2954.

Berger, Eli and Hartman, Irith Ben-Arroyo (2012) A unified approach to known and unknown cases of Berge's conjecture. In: Journal of Graph Theory, 71 (3). pp. 317-330.

Bhadra, Sahely and Nath, J Saketha and Ben-Tal, Aharou and Bhattacharyya, Chiranjib (2009) Interval Data Classification under Partial Information: A Chance-Constraint Approach. In: Lecture Notes in Computer Science, 5476 . pp. 208-219.

Bhadra, Sahely and Bhattacharya, Sourangshu and Bhattacharyya, Chiranjib and Ben-tal, Aharon (2010) Robust Formulations for Handling Uncertainty in Kernel Matrices. In: International Conference on Machine Learning (ICML), 2010.

Bhadra, Sahely and Bhattacharyya, Chiranjib and Chandra, Nagasuma R and Mian, I Saira (2009) A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data. In: Algorithms for Molecular Biology, 4 (5). pp. 1-15.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: ACM, Jun 11-13, San Diegeo, pp. 605-614.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2008) Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In: SODA '08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, New York, NY.

Bhandaru, Malini K and Murty, Narasimha M (1991) Incremental Learning from Examples Using HC-Expressions. In: Pattern Recognition, 24 (4). pp. 273-282.

Bharadwaj, BVS and Chandran, LS and Das, Anita (2008) Isoperimetric Problem and Meta-fibonacci Sequences. In: 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), JUN 27-29, 2008, Dalian.

Bharadwaj, Raghuram D and Reddy, Sai Koti and Narayanam, Krishnasuri and Bhatnagar, Shalabh (2018) A unified decision making framework for supply and demand management in microgrid networks. In: IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm), OCT 29-31, 2018, Aalborg, DENMARK.

Bharadwaj, S and Kadam, T (2022) GitHub Issue Classification Using BERT-Style Models. In: 1st IEEE/ACM International Workshop on Natural Language-Based Software Engineering, NLBSE 2022, 8 May 2022, Pittsburgh, pp. 40-43.

Bharadwaj, S and Shevade, S (2022) Efficient Constituency Tree based Encoding for Natural Language to Bash Translation. In: 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2022, 10 - 15 July 2022, Seattle, pp. 3159-3168.

Bharadwaj, Subramanya BV and Rao, Chintan H and Ashok, Pradeesha and Govindarajan, Sathish (2012) On piercing (pseudo)lines and boxes. In: 24th Canadian Conference on Computational Geometry, August 8-10, 2012, Charlottetown, Prince Edward Island, Canada.

Bharadwaj, Subramanya BV and Govindarajan, Sathish and Sharma, Karmveer (2011) On the Erdos-Szekeres n-interior point problem. In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2001, EuroComb.

Bharadwaj, Subramanya BV and Govindarajan, Sathish and Sharma, Karmveer (2014) On the Erdos-Szekeres n-interior-point problem. In: EUROPEAN JOURNAL OF COMBINATORICS, 35 (SI). pp. 86-94.

Bharadwaj Diddigi, R and Kamanchi, C and Bhatnagar, S (2020) A convergent off-policy temporal difference algorithm. In: Frontiers in Artificial Intelligence and Applications, 29 August-8 September 2020, Online; Spain, pp. 1103-1110.

Bharath, B and Borkar, VS (1999) Stochastic approximation algorithms: Overview and recent trends. In: Sadhana, 24 (Part 4). pp. 425-452.

Bharath, BN and Murthy, Chandra R (2013) Channel training signal design for reciprocal multiple antenna systems with beamforming. In: IEEE Transactions on Vehicular Technology, 62 (1). pp. 140-151.

Bharathi, Arpitha P and De, Minati and Lahiri, Abhiruk (2017) Circular Separation Dimension of a Subclass of Planar Graphs. In: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 19 (3).

Bharathi, Devi B and Sarma, VVS (1986) A Fuzzy Approximation Scheme for Sequential Learning in Pattern Recognition. In: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 16 (5). 668 -679.

Bhardwaj, Deepak and D’Souza, Deepak (2006) A unification-based decision procedure for cryptographic protocol analysis. In: Proc. 6th International Workshop on Issues in theory of Security (WITS), , 2006, Vienna.

Bhardwaj, MR and Ahmed, B and Diwakar, P and Ghalme, G and Narahari, Y (2023) Designing Fair, Cost-Optimal Auctions Based on Deep Learning for Procuring Agricultural Inputs Through Farmer Collectives. In: 19th IEEE International Conference on Automation Science and Engineering, CASE 2023Auckland26 August 2023through 30 August 2023, 26-30 August 2023, Auckland, New Zealand.

Bhardwaj, MR and Chaudhary, A and Enaganti, I and Sagar, K and Narahari, Y (2023) A Decision Support Tool for District Level Planning of Agricultural Crops for Maximizing Profits of Farmers. In: 19th IEEE International Conference on Automation Science and Engineering, CASE 2023Auckland26 August 2023through 30 August 2023Code 193105, 19th IEEE International Conference on Automation Science and Engineering, CASE 2023, Auckland.

Bhardwaj, MR and Pawar, J and Bhat, A and Enaganti, I and Sagar, K and Narahari, Y (2023) An Innovative Deep Learning Based Approach for Accurate Agricultural Crop Price Prediction. In: 19th IEEE International Conference on Automation Science and Engineering, CASE 2023, 26-30 August 2023, Auckland, New Zealand.

Bhargava, V and Garg, A and Kayal, N and Saha, C (2022) Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. In: 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022, 19 - 21 September 2022, Virtual, Urbana-Champaign.

Bhaskar, Dasgupta and Veni, Madhavan CE (1989) An approximate algorithm for the minimal vertex nested polygon problem. In: Information Processing Letters, 33 (1). pp. 35-44.

Bhaskar, Kalyani and Sarma, VVS and Thukaram, D and Ramakrishna, K (2006) Decision support requirements for intelligent operation of southern grid in India. In: IEEE Power India Conference 2006,, Apr 10-12, 2006, New Delhi, India,, pp. 48-54.

Bhaskaracharya, Somashekaracharya G and Bondhugula, Uday (2013) PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language. In: 22nd International Conference on Compiler Construction (CC), MAR 16-24, 2013, Rome, ITALY, pp. 123-143.

Bhaskaracharya, Somashekaracharya G and Bondhugula, Uday and Cohen, Albert (2016) Automatic Storage Optimization for Arrays. In: ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 38 (3).

Bhaskaracharya, Somashekaracharya G and Bondhugula, Uday and Cohen, Albert (2016) SMO: An Integrated Approach to Intra-array and Inter-array Storage Optimization. In: ACM SIGPLAN NOTICES, 51 (1). pp. 526-538.

Bhat, Satyanath and Jain, Shweta and Gujar, Sujit and Narahari, Y (2019) An optimal bidimensional multi-armed bandit auction for multi-unit procurement. In: ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 85 (1). pp. 1-19.

Bhatia, Ashutosh and Hansdah, RC (2015) DSLR: A Distributed Schedule Length Reduction Algorithm for WSNs. In: 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS), MAY 25-29, 2015, Hyderabad, INDIA, pp. 365-374.

Bhatia, Ashutosh and Hansdah, RC (2015) A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs. In: 2013 27th International Conference on Advanced Information Networking and Applications Workshops, 2015.

Bhatia, Ashutosh and Hansdah, RC (2014) A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs. In: 9th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), MAY 26-28, 2014, Marina Del Rey, CA, pp. 294-301.

Bhatia, Ashutosh and Hansdah, RC (2014) RD-TDMA: A Randomized and Distributed TDMA Scheduling for Correlated Contention in WSNs. In: 28th IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE WAINA), MAY 13-16, 2014, Univ Victoria, Victoria, CANADA, pp. 378-384.

Bhatia, Ashutosh and Hansdah, RC (2014) A TDMA-based Energy Aware MAC (TEA-MAC) Protocol for Reliable Multicast in WSNs. In: 28th IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA), MAY 13-16, 2014, Univ Victoria, Victoria, CANADA, pp. 798-805.

Bhatia, Ashutosh and Hansdah, RC (2016) TRM-MAC: A TDMA-based reliable multicast MAC protocol for WSNs with flexibility to trade-off between latency and reliability. In: COMPUTER NETWORKS, 104 . pp. 79-93.

Bhatia, Ashutosh and Hansdah, RC (2013) A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs. In: Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on . pp. 377-384.

Bhatia, Ashutosh and Hansdah, RC (2014) A media access and feedback protocol for reliable multicast over wireless channel. In: WIRELESS NETWORKS, 20 (8). pp. 2371-2383.

Bhatia, Ashutosh and Patro, Ranjeet K (2014) Emergency Handling in MICS based Body Area Network. In: IEEE International Conference on Electronics, Computing and Communication Technologies (IEEE CONECCT), JAN 06-07, 2014, Indian Inst Sci, Bangalore, INDIA.

Bhatia, Ashutosh and Singh, Sudhanshu (2017) Bandwidth Efficient Clock Skew Compensation in TDMA-based Star Topology Wireless Networks. In: 31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA) , MAR 27-29, 2017, Tamkang Univ, Taipei, TAIWAN, pp. 522-529.

Bhatnagar, Shalabh and Kowshik, Hemant J (2005) A Discrete Parameter Stochastic Approximation Algorithm for Simulation Optimization. In: SIMULATION, 81 (11). pp. 757-772.

Bhatnagar, S The Reinforce Policy Gradient Algorithm Revisited. In: UNSPECIFIED, p. 177.

Bhatnagar, S and Patel, S and Karmeshu, Karmeshu (2018) A stochastic approximation approach to active queue management. In: Telecommunication Systems, 68 (1). pp. 89-104.

Bhatnagar, Shalabh (2005) Adaptive Multivariate Three-Timescale Stochastic Approximation Algorithms for Simulation Based Optimization. In: ACM Transactions on Modeling and Computer Simulation, 15 (1). pp. 74-107.

Bhatnagar, Shalabh (2007) Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization. In: ACM Transactions on Modeling and Computer Simulation, 18 (1). 2:1-2:35.

Bhatnagar, Shalabh (2011) The Borkar-Meyn theorem for asynchronous stochastic approximations. In: Systems & Control Letters, 60 (7). pp. 472-478.

Bhatnagar, Shalabh (2010) An actor-critic algorithm with function approximation for discounted cost constrained Markov decision processes. In: Systems & Control Letters, 59 (12). pp. 760-766.

Bhatnagar, Shalabh and Reddy, I Bala Bhaskar (2005) Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation. In: Telecommunication Systems, 29 (1). pp. 9-31.

Bhatnagar, Shalabh and Abdulla, Mohammed Shahid (2006) An Actor-Critic Algorithm for Finite Horizon Markov Decision Processes. In: Proceedings of the 45th IEEE Conference on Decision & Control Manchester Grand Hyatt Hotel, December 13-15, 2006, San Diego, CA.

Bhatnagar, Shalabh and Abdulla, Mohammed Shahid (2008) Simulation-Based Optimization Algorithms for Finite-Horizon Markov Decision Processes. In: Simulation- Transactions of the Society for Modeling and Simulation international, 84 (12). pp. 577-600.

Bhatnagar, Shalabh and Abdulla, Mohammed Shahid (2006) A reinforcement learning based algorithm for finite horizon Markov decision processes. In: 45th IEEE Conference on Decision and Control,, Dec 13-15, 2006, San Diego, CA, pp. 5519-5524.

Bhatnagar, Shalabh and Babu, Mohan K (2008) New algorithms of the Q-learning type. In: Automatica, 44 (4). pp. 1111-1119.

Bhatnagar, Shalabh and Borkar, VS (1997) Multiscale stochastic approximation for parametric optimization of hidden Markov models. In: Probability in the Engineering and Informational Sciences, 11 (4). pp. 509-522.

Bhatnagar, Shalabh and Borkar, VS (1998) A two timescale stochastic approximation scheme for simulation-based parametric optimization. In: Probability in the Engineering and Informational Sciences, 12 (4). pp. 519-531.

Bhatnagar, Shalabh and Borkar, VS and Akarapu, Madhukar (2006) A Simulation-Based Algorithm for Ergodic Control of Markov Chains Conditioned on Rare Events. In: Journal of Machine Learning Research, 7 . pp. 1937-1962.

Bhatnagar, Shalabh and Borkar, VS and Prabuchandran, KJ (2013) Feature Search in the Grassmanian in Online Reinforcement Learning. In: IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 7 (5). pp. 746-758.

Bhatnagar, Shalabh and Fu, Michael C and Marcus, Steven I and Wang, I-Jeng (2003) Two-Timescale Simultaneous Perturbation Stochastic Approximation Using Deterministic Perturbation Sequences. In: ACM Transactions on Modeling and Computer Simulation, 13 (2). pp. 180-209.

Bhatnagar, Shalabh and Hemachandra, N and Mishra, Vivek Kumar (2011) Stochastic Approximation Algorithms for Constrained Optimization via Simulation. In: ACM Transactions on Modeling and Computer Simulation, 21 (3).

Bhatnagar, Shalabh and Karmeshu, * (2011) Monte-Carlo estimation of time-dependent statistical characteristics of random dynamical systems. In: Applied Mathematical Modelling, 35 (6). pp. 3063-3079.

Bhatnagar, Shalabh and Karmeshu, M and Mishra, Vivek Kumar (2009) Optimal Parameter Trajectory Estimation in Parameterized SDEs: An Algorithmic Procedure. In: ACM Transactions on Modeling and Computer Simulation, 19 (2). 8-8:26.

Bhatnagar, Shalabh and Kumar, Shishir (2004) A Simultaneous Perturbation Stochastic Approximation-Based Actor-Critic Algorithm for Markov Decision Processes. In: IEEE Transactions on Automatic Control, 49 (4). pp. 592-598.

Bhatnagar, Shalabh and Lakshmanan, K (2016) Multiscale Q-learning with linear function approximation. In: DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 26 (3). pp. 477-509.

Bhatnagar, Shalabh and Lakshmanan, K (2012) An Online Actor-Critic Algorithm with Function Approximation for Constrained Markov Decision Processes. In: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 153 (3). pp. 688-708.

Bhatnagar, Shalabh and Mishra, Vivek Kumar and Hemachandra, Nandyala (2011) Stochastic Algorithms for Discrete Parameter Simulation Optimization. In: IEEE Transactions on Automation Science and Engineering, 8 (4). pp. 780-793.

Bhatnagar, Shalabh and Panigrahi, Ranjan J (2006) Actor-critic algorithms for hierarchical Markov decision processes. In: Automatica, 42 (4). pp. 637-644.

Bhatnagar, Shalabh and Patro, Rajesh Kumar (2009) A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection. In: IEEE Communications letters, 13 (10). pp. 809-811.

Bhatnagar, Shalabh and Prashanth, LA (2015) Simultaneous Perturbation Newton Algorithms for Simulation Optimization. In: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 164 (2). pp. 621-643.

Bhatnagar, Shalabh and Sutton, Richard S and Ghavamzadeh, Mohammad and Lee, Mark (2007) Incremental natural-gradient actor-critic algorithms. In: Proceedings of 21st Annual Conference on Neural Information Processing Systems (NIPS-2007), Vancouver, Canada,, Dec. 2007, Vancouver, Canada.

Bhatnagar, Shalabh and Sutton, Richard S and Ghavamzadeh, Mohammad and Lee, Mark (2009) Natural actor-critic algorithms. In: Automatica, 45 (11). pp. 2471-2482.

Bhattacharya, Amitava and Mondal, Anupam and Murthy, T Srinivasa (2018) Problems on matchings and independent sets of a graph. In: DISCRETE MATHEMATICS, 341 (6). pp. 1561-1572.

Bhattacharya, Binay K and De, Minati and Maheshwari, Anil and Nandy, Subhas C and Roy, Sasanka (2017) Rectilinear path problems in restricted memory setup. In: DISCRETE APPLIED MATHEMATICS, 228 (SI). pp. 80-87.

Bhattacharya, C and Nath, Saketha J (2015) Applications of Data Sciences FOREWORD. In: SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 40 (6). p. 1681.

Bhattacharya, Indrajit and Godbole, Shantanu and Joshi, Sachindra and Verma, Ashish (2012) Cross-Guided Clustering: Transfer of Relevant Supervision across Tasks. In: ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 6 (2).

Bhattacharya, Sourangshu and Bhattacharyya, Chiranjib and Chandra, Nagasuma (2007) Structural Alignment based Kernels for Protein Structure Classification. In: ICML '07 Proceedings of the 24th international conference on Machine learning, New York, NY.

Bhattacharya, Sourangshu and Bhattacharyya, Chiranjib and Chandra, Nagasuma R (2007) Comparison of protein structures by growing neighborhood alignments. In: BMC Bioinformatics, 8 (77).

Bhattacharya, Sourangshu and Bhattacharyya, Chiranjib and Chandra, Nagasuma R (2006) Projections for fast protein structure retrieval. In: BMC Bioinformatics, 7 . S5.

Bhattacharya, Suparna and Gopinath, K (2011) Virtually cool ternary content addressable memory. In: HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems, 2011, USENIX Association Berkeley, CA, USA.

Bhattacharya, Suparna and Gopinath, K and Nanda, Mangala Gowri (2013) Combining Concern Input with Program Analysis for Bloat Detection. In: ACM SIGPLAN NOTICES, 48 (10). pp. 745-763.

Bhattacharya, Suparna and Gopinath, K and Rajamani, Karthick and Gupta, Manish (2011) Software Bloat and Wasted Joules: Is Modularity a Hurdle to Green Software? In: Computer, 44 (9). pp. 97-101.

Bhattacharya, Suparna and Nanda, Mangala Gowri and Gopinath, K and Gupta, Manish (2011) Reuse, recycle to de-bloat software. In: ECOOP 2011 – Object-Oriented Programming, July 25-29, 2011, Lancaster, Uk.

Bhattacharya, Suparna and Rajamani, Karthick and Gopinath, K and Gupta, Manish (2012) Does lean imply green?: a study of the power performance implications of Java runtime bloat. In: SIGMETRICS '12 Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems, June 2012, New York, NY, USA.

Bhattacharya, Suparna and Rajamani, Karthick and Gopinath, K and Gupta, Manish (2011) Interplay of software bloat, hardware energy proportionality and system bottlenecks. In: HotPower '11 Proceedings of the 4th Workshop on Power-Aware Computing and Systems, 2011, New York, NY, USA.

Bhattacharya, U and Veerawal, S and Govindu, VM (2018) Fast multiview 3D scan registration using planar structures. In: 7th IEEE International Conference on 3D Vision, 3DV 2017, 10 - 12 October 2017, Qingdao, pp. 548-556.

Bhattacharyya, A and Gadekar, A and Rajgopal, N (2018) Improved learning of k-parities. In: 24th International Conference on Computing and Combinatorics Conference, 2 - 4 July 2018, Qing Dao, pp. 542-553.

Bhattacharyya, A and Gadekar, A and Rajgopal, N (2020) Improved learning of k-parities. In: Theoretical Computer Science, 840 . pp. 249-256.

Bhattacharyya, A and Ghoshal, S and Saket, R (2018) Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. In: 31st Annual Conference on Learning Theory, COLT 2018, 6 - 9 July 2018, Stockholm, pp. 876-917.

Bhattacharyya, A and Gopi, S and Tal, A (2017) Lower bounds for 2-query LCCs over large alphabet. In: 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017, 16 - 18 August 2017, Berkeley.

Bhattacharyya, A and Sunil Chandran, L and Ghoshal, S (2020) Combinatorial lower bounds for 3-query LDCs. In: Leibniz International Proceedings in Informatics, LIPIcs, 12 - 14 January 2020, Seattle.

Bhattacharyya, Arnab (2014) Polynomial Decompositions in Polynomial Time. In: 22nd Annual European Symposium on Algorithms (ESA) held as part of ALGO Meeting Location, SEP 08-10, 2014, Wroclaw, POLAND , pp. 125-136.

Bhattacharyya, Arnab and Gopi, Sivakanth (2017) Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. In: ACM Transactions on Computation Theory, 9 (2). pp. 1-17. ISSN 1942-3454

Bhattacharyya, Arnab and Grandoni, Fabrizio and Nikolov, Aleksandar and Saha, Barna and Saurabh, Saket and Vijayaraghavan, Aravindan and Zhang, Qin (2018) Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. In: ACM TRANSACTIONS ON ALGORITHMS, 14 (3, SI).

Bhattacharyya, Arnab and Xie, Ning (2015) Lower bounds for testing triangle-freeness in Boolean functions. In: COMPUTATIONAL COMPLEXITY, 24 (1). pp. 65-101.

Bhattacharyya, C and Grate, LR and Jordan, MI and Ghaoui, El L and Mian, IS (2004) Robust Sparse Hyperplane Classifiers: Application to Uncertain Molecular Profiling Data. In: Journal of Computational Biology, 11 (6). pp. 1073-1089.

Bhattacharyya, C and Kannan, R (2020) Finding a latent k�simplex in O� (k · nnz(data)) time via Subset Smoothing. In: 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, 5-8 January 2020, Salt Lake City; United States, pp. 122-140.

Bhattacharyya, C and Kannan, R (2020) Near-optimal sample complexity bounds for learning latent k-polytopes and applications to ad-mixtures. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, virtual, online, pp. 831-840.

Bhattacharyya, C and Kannan, R and Kumar, A (2024) Random Separating Hyperplane Theorem and Learning Polytopes. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 8 July 2024through 12 July 2024, Tallinn.

Bhattacharyya, C and Keerthi, Sathiya S (2000) Information geometry and Plefka’s mean-field theory. In: Journal of Physics A : Mathematical and General, 33 (7). pp. 1307-1312.

Bhattacharyya, C and Vinay, V (2020) Suppress, and Not Just Flatten: Strategies for Rapid Suppression of COVID19 Transmission in Small World Communities. In: Journal of the Indian Institute of Science, 100 (4). pp. 849-862.

Bhattacharyya, Chiranjib (2019) Guest Editor's Note. In: JOURNAL OF THE INDIAN INSTITUTE OF SCIENCE, 99 (2). p. 175.

Bhattacharyya, Chiranjib (2004) Robust Classification of noisy data using Second Order Cone Programming approach. In: International Conference on Intelligent Sensing and Information Processing., 4-7 January 2004, Chennai, India, pp. 433-438.

Bhattacharyya, Chiranjib (2004) Second Order Cone Programming Formulations for Feature Selection. In: Journal of Machine Learning Research, 5 . pp. 1417-1433.

Bhattacharyya, Chiranjib and Keerthi, Sathiya S (2001) Mean-field methods for a special class of Belief Networks. In: Journal Of Artificial Intelligence Research, 15 . pp. 91-114.

Bhavesh, Bharadiya N and Maity, Soumyadev and Hansdah, RC (2013) A Protocol for Authentication with Multiple Levels of Anonymity (AMLA) in VANETs. In: Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on . pp. 462-469.

Bhowmick, Diptendu and Chandran, Sunil L (2010) Boxicity and cubicity of asteroidal triple free graphs. In: Discrete Mathematics, 310 (10-11). pp. 1536-1543.

Bhowmick, Diptendu and Chandran, Sunil L (2011) Boxicity of Circular Arc Graphs. In: Graphs and Combinatorics, 27 (6). pp. 769-783.

Bhowmik, Anasua and Franklin, Manoj (2004) Evaluation of a Speculative Multithreading Compiler by Characterizing Program Dependences. In: 2004 IEEE International Workshop on Workload Characterization WWC-7, 25 October, Austin,Texas, pp. 19-26.

Bhowmik, Anasua and Franklin, Manoj (2004) A General Compiler Framework for Speculative Multithreaded Processors. In: IEEE Transactions on Parallel and Distributed Systems, 15 (8). pp. 713-724.

Bin Masood, Talha and Natarajan, Vijay (2016) An Integrated Geometric and Topological Approach to Connecting Cavities in Biomolecules. In: IEEE Pacific Visualization Symposium (IEEE PacificVis), APR 19-22, 2016, Natl Taiwan Univ Sci & Technol, Taipei, TAIWAN, pp. 104-111.

Bin Masood, Talha and Sandhya, Sankaran and Chandra, Nagasuma and Natarajan, Vijay (2015) CHEXVIS: a tool for molecular channel extraction and visualization. In: BMC BIOINFORMATICS, 16 .

Bin Masood, Talha and Thomas, Dilip Mathew and Natarajan, Vijay (2013) Scalar field visualization via extraction of symmetric structures. In: Visual Computer, 29 (6-8). pp. 761-771.

Biswas, A and Barman, S (2019) Matroid constrained fair allocation problem. In: 33rd AAAI Conference on Artificial Intelligence, 27 January - 1 February 2019, Honolulu, pp. 9921-9922.

Biswas, A and Mukherjee, S (2019) Fairness through the lens of proportional equality. In: 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019, 13 - 17 May 2019, Montreal, pp. 1832-1834.

Biswas, S and Narahari, Y (2004) Object oriented modeling and decision support for supply chains. In: European Journal of Operational Research, 153 (3). pp. 704-726.

Biswas, S and Narahari, Y (2010) Tatonnement Mechanisms for Combinatorial Exchanges. In: Commerce and Enterprise Computing (CEC), 2010 IEEE 12th Conference on , 10-12 Nov. 2010, Shanghai.

Biswas, S and Narahari, Y (2010) An iterative auction mechanism for combinatorial exchanges. In: Automation Science and Engineering (CASE), 2010 IEEE Conference on , 21-24 Aug. 2010, Toronto, ON.

Biswas, S and Rajarman, V (1987) An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables. In: IEEE Transactions on Software Engineering, 13 (12). pp. 1340-1347.

Biswas, S and Susheela Devi, V (2019) Parallelization of Multi-label classification for large data sets. In: UNSPECIFIED, pp. 2005-2010.

Biswas, Shantanu and Bagch, Deepak and Narahari, Y and Suresh, P and Subrahmany, SV and Lakshmi, Udaya and Viswanadham, N (2012) Mechanism design for green, truthful procurement auctions. In: 2012 IEEE International Conference on Automation Science and Engineering (CASE), 20-24 Aug. 2012, Seoul.

Biswas, Shantanu and Narahari, Y (2005) Iterative Dutch Combinatorial auctions. In: Annals of Mathematics and Artificial Intelligence, 44 (3). pp. 1573-7470.

Biswas, Shantanu and Narahari, Y and Sarma, Anish Das (2004) A Decomposition Based Approach for Design of Supply Aggregation and Demand Aggregation Exchanges. In: Applying Formal Methods: Testing, Performance, and M/E-Commerce, FORTE2004 (Lecture Notes in Computer Science), October 1-2, 2004, Toledo, Spain, Vol.3236, 58-71.

Biswas, Shinjini and Devi, Susheela V (2018) Parallelization of Multi-label classification for large data sets. In: 2018 IEEE Symposium Series On Computational Intelligence (IEEE SSCI), NOV 18-21, 2018, Bengaluru, INDIA, pp. 2005-2010.

Bohra, Ankur and Chandran, Sunil L and Rajub, Krishnam J (2006) Boxicity of series-parallel graphs. In: Discrete Mathematics, 306 (18). pp. 2219-2221.

Bondhugula, Uday (2013) Compiling Affine Loop Nests for Distributed-Memory Parallel Architectures. In: International Conference for High Performance Computing, Networking, Storage and Analysis (SC), NOV 17-22, 2013, Denver, CO.

Bondhugula, Uday and Acharya, Aravind and Cohen, Albert (2016) The Pluto plus Algorithm: A Practical Approach for Parallelization and Locality Optimization of Affine Loop Nests. In: ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 38 (3).

Bondhugula, Uday and Bandishti, Vinayaka and Pananilath, Irshad (2017) Diamond Tiling: Tiling Techniques to Maximize Parallelism for Stencil Computations. In: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 28 (5). pp. 1285-1298.

Boora, Niranjan K and Bhattacharyya, Chiranjib and Gopinath, K (2004) Efficient Algorithms for Intrusion Detection. In: First International Conference on Distributed Computing and Internet Technology:ICDCIT 2004(Lecture Notes in Computer Science), 22-24 December, 2004, Bhubaneswar, India, Vol. 3347, 346-352.

Bordawekar, Rajesh and Rao, Ravi and Bondhugula, Uday (2010) Believe it or Not! Multicore CPUs can Match GPUs for FLOP-intensive Applications. Report RC24982, IBM TJ.

Borgaonkar, SR and Rao, SN (1981) Analysis and design of DC blocks. In: Electronics Letters, 17 (2). pp. 101-103.

Borgaonkar, SR and Rao , SN (1979) Broad-Band Coupling of High-Q Resonant Loads. In: IEEE Transactions on Microwave Theory and Techniques, 27 (7). pp. 688-690.

Borkar, VS (1998) Asynchronous stochastic approximations. In: SIAM Journal on Control and Optimization, 36 (3). pp. 840-851.

Borkar, VS (1996) Distributed computation of fixed points of infinity-nonexpansive maps. In: Proceedings of the Indian Academy of Sciences - Mathematical Sciences, 106 (3). pp. 289-300.

Borkar, VS (1998) Ergodic control of partially observed Markov chains. In: Systems & Control Letters, 34 (4). pp. 185-189.

Borkar, VS (1997) Stochastic approximation with two time scales. In: Systems & Control Letters, 29 (5). pp. 291-294.

Borkar, VS (1999) Stochastic differential equations and applications. In: Current Science (Bangalore), 76 (2). 128-128 .

Borkar, VS and Chandru, Vijay and Mitter, Sanjoy K (2002) Mathematical Programming Embeddings of Logic. In: Journal of Automated Reasoning, 29 (1). pp. 91-106.

Borkar, VS and Ghosh, MK and Sahay, P (1999) Optimal control of a stochastic hybrid system with discounted cost. In: Journal of Optimization Theory and Applications, 101 (3). pp. 557-580.

Borkar, VS and Gupta, Piyush (1999) Randomized Neural Networks for Learning Stochastic Dependences. In: IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics, 29 (4). pp. 469-480.

Borkar, VS and Jain, Sanjay and Rangarajan, Govindan (1998) Dynamics of individual specialization and global diversification in communities. In: Complexity, 3 (3). pp. 50-56.

Borkar, VS and Jain, Sanjay and Rangarajan, Govindan (1999) Evolutionary games with two timescales. In: Physlca D, 125 (1-2). pp. 155-166.

Borkar, VS and Meyn, SP (1998) Stability and Convergence of Stochastic Approximation using the O.D.E. Method. In: 37th IEEE Conference on Decision and Control, 1998, 16-18 December, Florida,USA, Vol.1, 277-282.

Borkar, VS and Mitter, SK (1999) A Strong Approximation Theorem for Stochastic Recursive Algorithm. In: Journal of Optimization Theory And Applications, 100 (3). pp. 499-513.

Borkar, VS and Mitter, Sanjoy K and Tatikonda, Sekhar C (1998) Optimal Sequential Vector Quantization of Markov Sources. In: 1998 IEEE International Symposium on Information Theory, 16-21 August, Cambridge,USA, p. 71.

Borkar, Vivek S and Konda, Vijaymohan R (1997) The actor-critic algorithm as multi-time-scale stochastic approximation. In: Sadhana : Academy Proceedings in Engineering Sciences, 22 (part 4). pp. 525-543.

Bouyer, Patricia and Chevalier, Fabrice and DSouza, Deepak (2005) Fault Diagnosis Using Timed Automata. In: 8th International Conference, FOSSACS 2005, April 4-8, 2005., Edinburgh, UK..

Brener, Nathan E and Iyengar, Sitharama S and Looney, Hua C and Vakamudi, Narayanadas and Yu, Decai and Huang, Qianyu and Barhen, Jacob (2004) Three-dimensional route planning for large grids. In: Journal of the Indian Institute of Science, 84 (3&4). pp. 67-76.

Buchsbaum, Adam L and Sundar, Rajamani and Tarjan, Robert E (1995) Lazy structure sharing for query optimization. In: Acta Informatica , 32 (3). pp. 255-270.

Budhiraja, A and Sukhwani, M and Aggarwal, M and Shevade, S and Sathyanarayana, G and Tallamraju, RB (2022) Using Relational Graph Convolutional Networks to Assign Fashion Communities to Users. In: 3rd workshop on recommender systems in fashion and retail, 2021, 27 September - 1 October 2021, Amsterdam, pp. 3-13.

Budi, Suseela and Gupta, Pradeep and Varghese, Kuruvilla and Bharadwaj, Amrutur (2018) A RISC-V ISA Compatible Processor IP for SoC. In: 2018 INTERNATIONAL SYMPOSIUM ON DEVICES, CIRCUITS AND SYSTEMS (ISDCS), MAR 29-31, 2018, Howrah, INDIA.

Byali, Megha and Joseph, Arun and Patra, Arpita and Ravi, Divya (2018) Fast Secure Computation for Small Population over the Internet. In: PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (, October 15-19, 2018, Canada, pp. 677-694.

C

Campanelli, M and Ganesh, C and Khoshakhlagh, H and Siim, J (2023) Impossibilities in Succinct Arguments: Black-Box Extraction and More. In: 14th International Conference on Cryptology in Africa, AFRICACRYPT 2023, 19-21 July 2023, Sousse, pp. 465-489.

Caragiannis, I and Narang, S (2023) Repeatedly Matching Items to Agents Fairly and Efficiently. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 981 .

Chakrabarti, Soumen and Khanna, Rajiv and Sawant, Uma and Bhattacharyya, Chiru (2008) Structured Learning for Non-Smooth Ranking losses. In: In KDD.

Chakrabarti, Sujit Kumar and Srikant, YN (2006) Specification Based Regression Testing Using Explicit State Space Enumeration. In: International Conference on Software Engineering Advances, Oct. 2006 , Tahiti.

Chakraborty, Anshuk and Bhatnagar, Shalabh (2010) Optimized Policies for the Retransmission Probabilities in Slotted Aloha. In: Simulation, 86 (4). pp. 247-261.

Chakraborty, D and Chandran, LS and Padinhatteeri, S and Pillai, RR (2021) Algorithms and Complexity of s-Club Cluster Vertex Deletion. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 5-7 Jul 2021, pp. 152-164.

Chakraborty, D and Chandran, LS and Padinhatteeri, S and Pillai, RR (2024) s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. In: Discrete Applied Mathematics, 345 (345). pp. 170-189.

Chakraborty, D and Das, S and Khan, A and Subramanian, A (2022) Fair Rank Aggregation. In: 36th Conference on Neural Information Processing Systems, NeurIPS 2022, 28 - 9 December 2022, New Orleans.

Chakraborty, D and Das, S and Mukherjee, S and Sahoo, UK and Sen, S (2023) Triangle-free projective-planar graphs with diameter two: Domination and characterization. In: Discrete Applied Mathematics, 331 . pp. 11-24.

Chakraborty, Joy and Souza, Deepak D and Narayan Kumar, K (2010) Analysing Message Sequence Graph Specifications. In: Proceedings of 4th International Symposium on Leveraging Applications of Formal Methods ISoLA) 2010, LNCS 6415, 2010.

Chakraborty, S and Dutta, P and Roychowdhury, S and Mukherjee, A (2022) CRUSH: Contextually Regularized and User anchored Self-supervised Hate speech Detection. In: 2022 Findings of the Association for Computational Linguistics: NAACL 2022, 10 - 15 July 2022, Seattle, pp. 1874-1886.

Chakrapani, N and Rangaswamy, SV and Tikekar, VG (1979) Development of a structured program for conversion to prenex normal form. In: Journal of the Indian Institute of Science, 61 (5). pp. 123-133.

Chakravarty, Saswata and Padakandla, Sindhu and Bhatnagar, Shalabh (2014) A simulation-based algorithm for optimal pricing policy under demand uncertainty. In: INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 21 (5). pp. 737-760.

Challa, A and Barman, G and Danda, S and Sagar, BSD (2021) Band Selection Using Dilation Distances. In: IEEE Geoscience and Remote Sensing Letters, 19 .

Challa, A and Danda, S and Sagar, BSD and Najman, L (2020) Power Spectral Clustering. In: Journal of Mathematical Imaging and Vision, 62 . pp. 1195-1213.

Chan, Hubert TH and Louis, Anand and Tang, Zhihao Gavin and Zhang, Chenzi (2018) Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. In: JOURNAL OF THE ACM, 65 (3).

Chan, TM and Rahul, S (2021) Simple multi-pass streaming algorithms for skyline points and extreme points. In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16 -19 March 2021, Virtual, Saarbrucken.

Chandra, Praphul and Gujar, Sujit and Narahari, Y (2016) Crowdfunding Public Projects with Provision Point: A Prediction Market Approach. In: 22nd European Conference on Artificial Intelligence (ECAI), AUG 29-SEP 02, 2016, Hague, NETHERLANDS, pp. 778-786.

Chandra, Praphul and Gujar, Sujit and Narahari, Y (2016) Crowdsourced Referral Auctions. In: 22nd European Conference on Artificial Intelligence (ECAI), AUG 29-SEP 02, 2016, Hague, NETHERLANDS, pp. 1654-1655.

Chandramouli, A and Choudhury, A and Patra, A (2022) A Survey on Perfectly Secure Verifiable Secret-sharing. In: ACM Computing Surveys, 54 (11s).

Chandran, LS (2001) Edge connectivity vs vertex connectivity in chordal graphs. In: of 7th Annual International Computing and Combinatorics Conference (COCOON'01), 20-23 Aug. 2001, Guilin, China, pp. 384-389.

Chandran, Sunil L (1999) A high girth graph construction and a lower bound for hitting set size for combinatorial rectangles. In: Proceedings 19th FST & TCS 1999: Nineteenth Conference on the Foundations of Software Technology and Theoretical Computer Science, 13-15 Dec. 1999, Chennai, India, pp. 283-290.

Chandran, LS (2001) A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. In: 7th Annual International Computing and Combinatorics Conference,COCOON'01 (Lecture Notes in Computer Science), 20-23 Aug 2001, Guilin, China, pp. 308-317.

Chandran, LS and Das, Anita and Shah, CD (2009) Cubicity, boxicity, and vertex cover. In: Discrete Mathematics, 309 (8). pp. 2488-2496.

Chandran, LS and Das, SK and Hell, P and Padinhatteeri, S and Pillai, RR (2021) Template-Driven Rainbow Coloring of Proper Interval Graphs. In: 7th International Conference on Algorithms and Discrete Applied Mathematics, 11-13 Feb 2021, Rupnagar, pp. 452-470.

Chandran, LS and Hashim, T and Jacob, D and Mathew, R and Rajendraprasad, D and Singh, N (2024) New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. In: Discrete Mathematics, 347 (4).

Chandran, LS and Ibarra, L and Ruskey, F and Sawada, J (2003) Generating and characterizing the perfect elimination orderings of a chordal graph. In: Theoretical Computer Science, 307 (2). pp. 303-317.

Chandran, LS and Lahiri, A and Singh, N (2021) Improved approximation for maximum edge colouring problem. In: Discrete Applied Mathematics .

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Padinhatteeri, S and Ravi Shankar, K (2020) List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph. In: 6th International Conference on Algorithms and Discrete Applied Mathematics, 13-15 FEB 2020, Hyderabad, pp. 235-247.

Chandran, LS and Sivadasan, N (2007) Boxicity and treewidth. In: Journal of Combinatorial Theory, Series B, 97 (5). pp. 733-744.

Chandran, N and Kanukurthi, B and Obbattu, SLB and Sekar, S (2022) Short Leakage Resilient and Non-malleable Secret Sharing Schemes. In: 42nd Annual International Cryptology Conference, CRYPTO 2022, 15 - 18 August 2022, Santa Barbara, pp. 178-207.

Chandran, S and Issac, D and Karrenbauer, A (2017) On the parameterized complexity of BicliqueCover and partition. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24 - 26 August 2016, Aarhus.

Chandran, Sunil and Ram, Shankar L (2002) On the Number of Minimum Cuts in a Graph. IISc-­CSA-­2002­-5.

Chandran, Sunil L (2003) A High Girth Graph Construction. In: SIAM Journal on Discrete Mathematics, 16 (3). pp. 366-370.

Chandran, Sunil L (2003) A lower bound for the hitting set size for combinatorial rectangles and an application. In: Information Processing Letters, 86 (2). pp. 75-78.

Chandran, Sunil L and Chitnis, Rajesh and Kumar, Ramanjit (2013) On the SIG-dimension of trees under the L (a)-metric. In: Graphs and Combinatorics, 29 (4). pp. 773-794.

Chandran, Sunil L and Francis, Mathew and Sivadasan, Naveen (2006) Geometric representations of graphs in low dimension. In: 12th Annual International Conference on Computing and Combinatorics (COCOON-2006), , August . 2006, Taiwan, Taipei.

Chandran, Sunil L and Francis, Mathew C and Mathew, Rogers (2011) Boxicity of Leaf Powers. In: Graphs and Combinatorics, 27 (1). pp. 61-72.

Chandran, Sunil L and Francis, Mathew C and Mathew, Rogers (2011) Chordal Bipartite Graphs with High Boxicity. In: Graphs and Combinatorics, 27 (3). pp. 353-362.

Chandran, Sunil L and Francis, Mathew C and Mathew, Rogers (2008) Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time. In: ICIT '08 Proceedings of the 2008 International Conference on Information Technology, 17-20 Dec. 2008 , Washington, DC.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2013) Cubicity and Bandwidth. In: GRAPHS AND COMBINATORICS, 29 (1). pp. 45-69.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2008) On the Cubicity of AT-free graphs and circular arc graphs,Graph Theory, Computational Intelligence and Thought. In: A conference celebrating M.C. Golumbic's 60th birthday in Israel .

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2008) Representing graphs as the intersection of axis-parallel cubes. In: MCDES (Managing Complexity in Distributed World), IISc Centenary Conference..

Chandran, Sunil L and Francis, Mathew C and Suresh, Santhosh (2009) Boxicity of Halin graphs. In: Discrete Mathematics, 309 (10). pp. 3233-3237.

Chandran, Sunil L and Imrich, Wilfried and Mathew, Rogers and Rajendraprasad, Deepak (2015) Boxicity and cubicity of product graphs. In: EUROPEAN JOURNAL OF COMBINATORICS, 48 (SI). pp. 100-109.

Chandran, Sunil L and Imrich, Wilfried and Mathew, Rogers and Rajendraprasad, Deepak (2015) Boxicity and cubicity of product graphs. In: EUROPEAN JOURNAL OF COMBINATORICS, 48 (SI). pp. 100-109.

Chandran, Sunil L and Issac, Davis and Zhou, Sanming (2016) Hadwiger's Conjecture and Squares of Chordal Graphs. In: 22nd International Computing and Combinatorics Conference (COCOON), AUG 02-04, 2016, Ho Chi Minh City, VIETNAM, pp. 417-428.

Chandran, Sunil L and Issac, Davis and Zhou, Sanming (2019) Hadwiger's conjecture for squares of 2-trees. In: EUROPEAN JOURNAL OF COMBINATORICS, 76 . pp. 159-174.

Chandran, Sunil L and Kavitha, T (2006) The carvingwidth of hypercubes. In: Discrete Mathematics, 306 (18). pp. 2270-2274.

Chandran, Sunil L and Mathew, Rogers (2013) Bipartite Powers of k-chordal Graphs. In: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 15 (2). pp. 49-58.

Chandran, Sunil L and Mathew, Rogers and Rajendraprasad, Deepak (2016) Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. In: DISCRETE MATHEMATICS, 339 (2). pp. 443-446.

Chandran, Sunil L and Mathew, Rogers and Rajendraprasad, Deepak and Sharma, Roohani (2013) Product Dimension of Forests and Bounded Treewidth Graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 20 (3).

Chandran, Sunil L and Mathew, Rogers and Sivadasan, Naveen (2010) Boxicity of Line Graphs. UNSPECIFIED.

Chandran, Sunil L and Mathew, Rogers and Sivadasan, Naveen (2011) Boxicity of line graphs. In: Discrete Mathematics, 311 (21). pp. 2359-2367.

Chandran, Sunil L and Rajendraprasad, Deepak (2012) Rainbow colouring of split and threshold Graphs. In: Computing and Combinatorics, 7434 . pp. 181-192.

Chandran, Sunil L and Rajendraprasad, Deepak and Singh, Nitin (2014) On Additive Combinatorics of Permutations of Z(n). In: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 16 (2). pp. 35-40.

Chandran, Sunil L and Rajendraprasad, Deepak and Tesar, Marek (2017) Rainbow colouring of split graphs. In: DISCRETE APPLIED MATHEMATICS, 216 (1, SI). pp. 98-113.

Chandran, Sunil L and Ram, Shankar L (2002) Approximations for ATSP with Parametrized Triangle Inequality. [Book Chapter]

Chandran, Sunil L and Ram, Shankar L (2004) On the Number of Minimum cuts in a Graph. In: SIAM Journal on Discrete Mathematics, 18 (1). pp. 177-194.

Chandran, Sunil L and Ram, Shankar L (2007) On the relationship between ATSP and the cycle cover problem. In: Theoretical Computer Science, 370 (1-3). pp. 218-228.

Chandran, Sunil L and Sivadasan, Naveen (2007) On the Hadwiger’s conjecture for graph products. In: Discrete Mathematics, 307 (2). pp. 266-273.

Chandran, Sunil L and Das, Anita and Issac, Davis and van Leeuwen, Erik Jan (2018) Algorithms and Bounds for Very Strong Rainbow Coloring. In: 13th Latin American Theoretical Informatics Symposium (LATIN), APR 16-19, 2018, Buenos Aires, ARGENTINA, pp. 625-639.

Chandran, Sunil L and Das, Anita and Rajendraprasad, Deepak and Varma, NithinM (2012) Rainbow connection number and connected dominating sets. In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, August 29-September 2, 2011, Budapest, hungary, pp. 206-218.

Chandran, Sunil L and Das, Anita and Sivadasan, Naveen (2009) On the cubicity of bipartite graphs. In: Information Processing Letters, 109 (9). pp. 432-435.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2008) Boxicity and maximum degree. In: Journal of Combinatorial Theory - Series B, 98 (2). pp. 443-445.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2010) Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. In: Algorithmica, 56 (2). pp. 129-140.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2009) On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. In: conference on Graph Theory, Computational Intelligence and Thought, SEP 19, 2008-SEP 25, 2009, Jerusalem.

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2009) On the Cubicity of Interval Graphs. In: Graphs and combinatorics, 25 (2). pp. 169-179.

Chandran, Sunil L and Kostochka, Alexandr and Raju, Krishnam J (2008) Hadwiger Number and the Cartesian Product of Graphs. In: Graphs and Combinatorics, 24 (4). pp. 291-301.

Chandran, Sunil L and Narayanaswamy, NS (2009) On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. In: 10th International Computing and Combinatorics Conference, AUG 17-20, 2004, Cheju Isl, SOUTH KOREA, pp. 11-19.

Chandran, Sunil L and Sivadasan, Naveen (2008) The cubicity of hypercube graphs. In: Discrete Mathematics, 308 (23). pp. 5795-5800.

Chandrasekaran, N and lyengar, Sitharama S and Chen, Peter P (1988) A denotational semantics for the generalized ER model and a simple ER algebra. In: International Journal of Computer Mathematics, 24 (2). pp. 99-113.

Chandrashekar, TS and Narahari, Y (2007) A Shapley value analysis to coordinate the formation of procurement. In: IEEE International Conference on Automation Science and Engineering, SEP 22-25, 2007, Scottsdale, AZ.

Chandrashekar, TS and Narahari, Y (2014) Procurement Network Formation: A Cooperative Game Theoretic Approach. [Book Chapter]

Chandrashekar, TS and Narahari, Y (2007) A Shapley Value Analysis to Coordinate the Formation of Procurement Networks. In: CASE 2007. IEEE International Conference on Automation Science and Engineering, 2007., 22-25 Sept. 2007 , Scottsdale, AZ .

Chandrashekar, TS and Narahari, Y (2007) The core and shapley value analysis for cooperative formation of procurement networks. In: 9th IEEE International Conference on E-Commerce Technology/4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, JUL 23-26, 2007, Tokyo.

Chandrashekar, TS and Narahari, Y and Rosa, Charles H and Kulkarni, Devadatta M and Tew, Jeffrey D and Dayama, Pankaj (2007) Auction-Based Mechanisms for Electronic Procurement. In: IEEE Transactions on Automation Science and Engineering, 4 (3). pp. 297-321.

Chandrashekar, TS and Narahari, Yadati (2005) Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information. [Book Chapter]

Chandru, V (1993) Variable Elimination in Linear Constraints. In: Computer Journal, The, 36 (5). pp. 463-472.

Chandru, V and Dattasharma, A and Keerthi, SS and Sancheti, NK and Vinay, V (1995) Algorithms for the optimal loading of recursive neural nets. In: of Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 Jan. 1995, San Francisco, CA, USA, pp. 342-349.

Chandru, V and Lee, CY and Uzsoy, R (1993) Minimizing total completion time on batch processing machines. In: International Journal of Production Research, 31 (9). pp. 2097-2121.

Chandru, V and Mahesh, N and Manivannan, M and Manohar, S (2000) Volume Sculpting and Keyframe Animation System. In: Computer Animation 2000, 3-5 May, Philadelphia, 134 -139.

Chandru, V and Manivannan, M and Manohar, S (1999) Minkowski operators and features of voxel models. In: ASME 1999 Design Engineering Technical Conferences, DETC 1999, 12-16 Sep 1999, Las Vegas; United States, pp. 1247-1257.

Chandru, V and Monohar, S (1997) Volume modelling for emerging manufacturing technologies. In: Sadhana : Academy Proceedings in Engineering Sciences, 22 (part 2). pp. 199-216.

Chandru, V and Vidyasagar, M and Vinay, V (1997) Tractable theories for the synthesis of neural networks. [Book Chapter]

Chandru, Vijay and DattaSharma, Abhi and Kumar, Anil VS (2003) The algorithmics of folding proteins on lattices. In: Discrete Applied Mathematics, 127 (1). pp. 145-161.

Chandru, Vijay and Ghosh, Subir Kumar and Maheshwari, Anil and Rajan, VT and Saluja, Sanjeev (1995) $_N$$_C-$ Algorithms for Minimum Link Path and Related Problems. In: Journal of Algorithms, 19 (2). pp. 173-203.

Chandru, Vijay and Hariharan, Ramesh and Krishnakumar, Narasimha M (2004) Short-Cuts on Star, Source and Planar Unfoldings. [Book Chapter]

Chandru, Vijay and Lassez, Jean-Louis (2004) Qualitative theorem proving in linear constraints. In: Verification: Theory And Practice - Essays Dedicated To Zhoar Manna On The Occasion Of His 64th Birthday Book Series: Lecture Notes In Computer Science, 2772 . pp. 398-399.

Chandru, Vijay and Lassez, Jean-Louis (2003) Qualitative theorem proving in linear constraints. In: Lecture Notes in Computer Science, 2772 . pp. 395-406.

Chandru, Vijay and Manohar, Swami and Prakash, Edmond C (1995) Voxel- Based Modeling for layered Manufacturing. In: IEEE Computer Graphics and Applications, 15 (6). pp. 42-47.

Chandru, Vijay and Roy, Suman and Subrahmanyam, Ramesh (1998) Negation as Failure as Resolution. In: Constraints, 3 (4). pp. 315-329.

Chandru, Vijaya and Lee, Chung-Yee and Uzsoy, Reha (1993) Minimizing total completion time on a batch processing machine with job families. In: Operations Research Letters, 13 (2). pp. 61-65.

Chang, Gerard J and Panda, BS and Pradhan, D (2012) Complexity of distance paired-domination problem in graphs. In: THEORETICAL COMPUTER SCIENCE, 459 . pp. 89-99.

Chaterjee, A and Ghalme, G and Jain, S and Vaish, R and Narahari, Y (2017) Analysis of Thompson sampling for stochastic sleeping bandits. In: 33rd Conference on Uncertainty in Artificial Intelligence, UAI 2017, 11 - 15 August 2017, Sydney.

Chatterjee, S and Das, MPL and Pandit, T (2022) Revisiting the Security of Salted UOV Signature. In: 23rd International Conference on Cryptology, INDOCRYPT 2022, 11 December - 14 December 2022, Kolkata, pp. 697-719.

Chatterjee, S and Dimri, A and Pandit, T (2021) Identity-Based Signature and Extended Forking Algorithm in the Multivariate Quadratic Setting. In: 22nd International Conference on Cryptology in India, INDOCRYPT 2021, 12 - 15 Dec 2021, Jaipur, pp. 387-412.

Chatterjee, S and Kabaleeshwaran, R (2020) From Rerandomizability to Sequential Aggregation: Efficient Signature Schemes Based on SXDH Assumption. In: 25th Australasian Conference on Information Security and Privacy, ACISP 2020, 30th Nov.-2nd Dec.,2020, Perth; Australia, pp. 183-203.

Chatterjee, S and Kabaleeshwaran, R (2019) Rerandomizable Signatures Under Standard Assumption. In: 20th International Conference on Cryptology in India, INDOCRYPT 2019, 15 - 18 December 2019, Hyderabad, pp. 45-67.

Chatterjee, S and Kabaleeshwaran, R (2018) Towards static assumption based cryptosystem in pairing setting: Further applications of DéjàQ and dual-form signature. In: 12th International Conference on Provable Security, ProvSec 2018, 25 - 28 October 2018, Jeju, pp. 220-238.

Chatterjee, S and Kesarwani, M and Modi, J and Mukherjee, S and Parshuram Puria, SK and Shah, A (2020) Secure and efficient wildcard search over encrypted data. In: International Journal of Information Security .

Chatterjee, S and Mukherjee, S (2018) Keyword search meets membership testing: Adaptive security from SXDH. In: 19th International Conference on Cryptology in India, INDOCRYPT 2018, 9 - 12 December 2018, New Delhi, pp. 21-43.

Chatterjee, S and Mukherjee, S (2019) Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle). In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11405 . pp. 62-82.

Chatterjee, S and Pandit, T (2022) Efficient IBS from a New Assumption in the Multivariate-Quadratic Setting. In: 23rd International Conference on Cryptology, INDOCRYPT 2022, 11- 14 December 2022, Kolkata, pp. 679-696.

Chatterjee, S and Parshuram Puria, SK and Shah, A (2020) Efficient backward private searchable encryption. In: Journal of Computer Security, 28 (2). pp. 229-267.

Chatterjee, S and Prem Laxman Das, M and Kabaleeshwaran, R (2018) Converting pairing-based cryptosystems from composite to prime order setting-A comparative analysis. In: Journal of Mathematical Cryptology, 12 (3). pp. 159-190.

Chatterjee, Sanjit and Kamath, Chethan (2016) A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound. In: ALGORITHMICA, 74 (4). pp. 1321-1362.

Chatterjee, Sanjit and Kamath, Chethan (2013) From Selective-ID to Full-ID IBS without Random Oracles. In: 3rd International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE), OCT 19-23, 2013, Indian Inst Technol Kharagpur, Kharagpur, INDIA, pp. 172-190.

Chatterjee, Sanjit and Kamath, Chethan and Kumar, Vikas (2018) PRIVATE SET-INTERSECTION WITH COMMON SET-UP. In: ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 12 (1). pp. 17-47.

Chatterjee, Sanjit and Karabina, Koray and Menezes, Alfred (2015) Fault Attacks on Pairing-Based Protocols Revisited. In: IEEE TRANSACTIONS ON COMPUTERS, 64 (6). pp. 1707-1714.

Chatterjee, Sanjit and Koblitz, Neal and Menezes, Alfred and Sarkar, Palash (2017) Another Look at Tightness II: Practical Issues in Cryptography. In: 2nd International Conference on Cryptology and Malicious Security (Mycrypt), DEC 01-02, 2016, Kuala Lumpur, MALAYSIA, pp. 21-55.

Chatterjee, Sanjit and Menezes, Alfred and Rodriguez-Henriquez, Francisco (2017) On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One. In: IEEE TRANSACTIONS ON COMPUTERS, 66 (6). pp. 1061-1070.

Chatterjee, Sanjit and Menezes, Alfred and Sarkar, Palash (2012) Another look at tightness. In: 18th International Workshop, SAC 2011, August 11-12, 2011, Toronto, ON, Canada.

Chatterjee, Sanjit and Menezes, Alfred and Ustaoglu, Berkant (2011) A generic variant of NIST’s KAS2 key agreement protocol. In: ACISP'11 Proceedings of the 16th Australasian Conference on Information Security and Privacy, 2011, Heidelberg.

Chatterjee, Sanjit and Mukherjee, Sayantan and Pandit, Tapas (2017) CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient. In: 18th International Conference on Cryptology in India, INDOCRYPT 2017, 10 December - 13 December 2017, Chennai, pp. 85-106.

Chatterjee, Sanjit and Mukherjee, Sayantan and Patidar, Govind (2015) Efficient Protocol for Authenticated Email Search. In: 5th International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE), OCT 03-07, 2015, Malaviya Natl Inst Technol, Jaipur, INDIA, pp. 1-20.

Chattopadhyay, E and Kanukurthi, B and Obbattu, SLB and Sekar, S (2019) Privacy Amplification from Non-malleable Codes. In: 20th International Conference on Cryptology in India, INDOCRYPT 2019, 15- 18 December 2019, Hyderabad, pp. 318-337.

Chaturvedi, Vijay Prakash and Rakesh, V and Bhatnagar, Shalabh (2007) An efficient and optimized bluetooth scheduling algorithm for piconets. In: 4th International Conference on Distributed Computing and Internet Technology, DEC 17-20, 2007, Bangalore.

Chaudhari, Harsh and Choudhury, Ashish and Patra, Arpita and Suresh, Ajith (2019) ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. In: ACM SIGSAC Conference on Cloud Computing Security Workshop (CCSW), November 2019, pp. 81-92.

Chaudhari, Harsh and Rachuri, Rahul and Suresh, Ajith (2020) Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. In: The 26th Annual Network and Distributed System Security Symposium (NDSS) 2020.

Chaudhari, Sneha and Murty, Narasimha M (2014) Average Overlap for Clustering Incomplete Data using Symmetric Non-Negative Matrix Factorization. In: 22nd International Conference on Pattern Recognition (ICPR), AUG 24-28, 2014, Swedish Soc Automated Image Anal, Stockholm, SWEDEN, pp. 1431-1436.

Chaudhari, Sneha and Shevade, Shirish (2012) Learning from positive and unlabelled examples using maximum margin clustering. In: ICONIP 2012 19th International Conference, November 12-15, 2012, Doha, Qatar.

Chaudhuri, Arghya Roy and Murty, Narasimha M (2012) On the relation between K-means and PLSA. In: 2012 21st International Conference on Pattern Recognition (ICPR), 11-15 Nov. 2012, Tsukuba, Japan.

Chawla, G and Aman, N and Komondoor, R and Bokil, A and Kharat, N (2022) Verification of ORM-based Controllers by Summary Inference. In: 44th ACM/IEEE International Conference on Software Engineering, ICSE 2022, 22 - 27 May 2022, Pittsburgh, pp. 2340-2351.

Cheng, Shu and Woodcock, Jim and D'Souza, Deepak (2015) Using formal reasoning on a model of tasks for FreeRTOS. In: FORMAL ASPECTS OF COMPUTING, 27 (1). pp. 167-192.

Cheramangalath, Unnikrishnan and Nasre, Rupesh and Srikant, Y N (2017) DH-Falcon: A language for large-scale graph processing on Distributed Heterogeneous systems. In: IEEE International Conference on Cluster Computing (CLUSTER), SEP 05-08, 2017, Honolulu, HI, pp. 439-450.

Cheramangalath, Unnikrishnan and Nasre, Rupesh and Srikant, YN (2017) DH-Falcon: A language for large-scale graph processing on Distributed Heterogeneous systems. In: IEEE International Conference on Cluster Computing (CLUSTER), SEP 05-08, 2017, Honolulu, HI, pp. 439-450.

Cherukupally, S (2020) Blockchain technology: Theory and practice. In: Handbook of Statistics . (In Press)

Cherukupally, S (2020) On a symmetricity property connected to the Euclidean algorithm. In: Integers, 20 . pp. 1-21.

Cheung, Sen-Ching Samson and Sun, Yan Lindsay and Aberer, Karl and Haritsa, Jayant and Horne, Bill and Hwang, Kai (2013) Special issue on privacy and trust management in cloud and distributed systems. In: IEEE Transactions on Information Forensics and Security, 8 (6). pp. 835-837.

Chevalier, Fabrice and D'Souza, Deepak and Mohan, M Raj and Prabhakar, Pavithra (2009) Automata and logics over finitely varying functions. In: International Symposium on Logical Foundations of Computer Science (LFCS 2007), JUN 04-07, CUNY, New York, pp. 324-336.

Chevalier, Fabrice and D'Souza, Deepak and Prabhakar, Pavithra (2006) On continuous timed automata with input-determined guards. In: Proc. Confernece on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), , 2006, Kolkata.

Chevalier, Fabrice and D’Souza, Deepak and Prabhakar, Pavithra (2007) Counter-free input-determined timed automata. In: FORMATS 2007, Salzburg, Austria, October 2007, Salzburg.

Chidambara, MR (1973) Comments on "On the Simplification of Linear Systems". In: IEEE Transactions on Automatic Control, 18 (1). 76 -77.

Chidambara, MR and Shastry, MLSK (1981) A New Algorithm For The Determination Of The Eigenvalues Of A Real matrix. In: Indian Journal of Technology, 19 (9). pp. 360-364.

Chinchani, AM and Paliwal, S and Ganesh, S and Chandrasekhar, V and Yu, BM and Sridharan, D (2022) Tracking momentary fluctuations in human attention with a cognitive brain-machine interface. In: Communications Biology, 5 (1).

Chinta, Punya Murthy and Balamurugan, P and Shevade, Shirish and Murty, Narasimha M (2013) Optimizing F-Measure with Non-Convex Loss and Sparse Linear Classifiers. In: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), AUG 04-09, 2013, Dallas, TX.

Chinta, Punya Murthy and Murty, Narasimha M (2012) Discriminative feature analysis and selection for document classification. In: 19th International Conference, ICONIP 2012, November 12-15, 2012, Doha, Qatar.

Chinthalapati, VLR and Yadati, Narahari and Karumanchi, R (2006) Learning dynamic prices in multiseller electronic retail markets with price sensitive customers, stochastic demands, and inventory replenishments. In: IEEE Transactions on Systems Man And Cybernetics Part C-Applications And Reviews, 36 (1). pp. 92-106.

Chitoor, Suresh S and Murty, Narasimha M and Bhandaru, Malini K (1991) A New Data Structure HC-Expression for Learning from Examples. In: Pattern Recognition, 24 (1). pp. 19-29.

Chitta, Radha and Murty, M Narasimha (2010) Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification. In: Pattern Recognition, 43 (3). pp. 796-804.

Chopra, N and Pai, R and D’Souza, D (2019) Data Races and Static Analysis for Interrupt-Driven Kernels. In: 28th European Symposium on Programming, ESOP 2019 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, 6 - 11 April 2019, Prague, pp. 697-723.

Choudhary, Y and Kolathaya, S (2022) Energy based Control Barrier functions for Robotic Manipulators with Large Safety Constraints. In: 2022 European Control Conference, ECC 2022, 12 - 15 July 2022, London, pp. 1328-1335.

Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2017) Brief announcement: Crash-tolerant consensus in directed graph revisited. In: 31st International Symposium on Distributed Computing, DISC 2017, 16 - 20 October 2017, Vienna.

Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2018) Crash-tolerant consensus in directed graph revisited (Extended abstract). In: 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, 18 - 21 June 2018, Ma’ale HaHamisha, pp. 55-71.

Choudhury, Ashish and Orsini, Emmanuela and Patra, Arpita and Smart, Nigel P (2016) Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In: 10th International Conference on Security and Cryptography for Networks (SCN), AUG 31-SEP 02, 2016, Amalfi, ITALY, pp. 147-168.

Choudhury, Ashish and Orsini, Emmanuela and Patra, Arpita and Smart, Nigel P (2016) Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In: 10th International Conference on Security and Cryptography for Networks (SCN), AUG 31-SEP 02, 2016, Amalfi, ITALY, pp. 147-168.

Choudhury, Ashish and Orsini, Emmanuela and Patra, Arpita and Smart, Nigel P (2016) Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In: 10th International Conference on Security and Cryptography for Networks (SCN), AUG 31-SEP 02, 2016, Amalfi, ITALY, pp. 147-168.

Choudhury, Ashish and Patra, Arpita (2017) An Efficient Framework for Unconditionally Secure Multiparty Computation. In: IEEE Transactions on Information Theory, 63 (1). pp. 428-468. ISSN 0018-9448

Choudhury, Ashish and Patra, Arpita and Ravi, Divya (2017) Round and Communication Efficient Unconditionally-Secure MPC with t < n/3 in Partially Synchronous Network. In: 10th International Conference on Information Theoretic Security (ICITS), NOV 29-DEC 02, 2017, Chinese Univ Hong Kong, Hong Kong, HONG KONG, pp. 83-109.

Choudhury, Sabyasachy and Murty, Narasimha M (1990) A division scheme for constructing minimal spanning trees in coordinate space. In: Pattern Recognition Letters, 11 (6). pp. 385-389.

Choudhury, Sabyasachy and Murty, Narasimha M (1990) A divisive scheme for constructing minimal spanning trees in coordinate space. In: Pattern Recognition Letters, 11 (6). pp. 385-389.

Chukka, AR and Devi, VS (2021) Detection of Malicious Binaries by Applying Machine Learning Models on Static and Dynamic Artefacts. In: 6th International Conference on Internet of Things, Big Data and Security, IoTBDS 2021, 23 - 25 April 2021, Virtual, Online, pp. 29-37.

Chukka, AR and Devi, VS (2021) Detection of Malicious Binaries by Deep Learning Methods. In: 6th International Conference on Internet of Things, Big Data and Security, IoTBDS 2021, 23 - 25 April 2021, Virtual, Online, pp. 132-139.

Cogliati, B and Ethan, J and Jha, A and Saha, SK (2023) On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing. In: IACR Transactions on Symmetric Cryptology, 2023 (4). pp. 330-364.

Cohen, A and Vechev, M and Lucia, B and Ramanathan, MK (2017) Message from the chairs. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Part F . iii.

Coiteux-Roy, X and D'Amore, F and Gajjala, R and Kuhn, F and Le Gall, F and Lievonen, H and Modanese, A and Renou, M-O and Schmid, G and Suomela, J (2024) No Distributed Quantum Advantage for Approximate Graph Coloring. In: 56th Annual ACM Symposium on Theory of Computing, STOC 2024, 24 June 2024through 28 June 2024, Vancouver, Canada, pp. 1901-1910.

Cole, Richard and Farach-Colton, Martin and Hariharan, Ramesh and Przytycka, Teresa and Thorup, Mikkel (2000) An O (n log n) algorithm for the maximum agreement subtree problem for binary trees. In: SIAM Journal on Computing, 30 (5). pp. 1385-1404.

Cole, Richard and Hariharan, Ramesh (2000) Approximate String Matching: A Simpler Faster Algorithm. In: SIAM Journal on Computing, 31 (6). pp. 1761-1782.

Cole, Richard and Hariharan, Ramesh (2005) Dynamic LCA Queries on Trees. In: SIAM Journal on Computing, 34 (4). pp. 894-923.

Cole, Richard and Hariharan, Ramesh (2003) A Fast Algorithm for Computing Steiner Edge Connectivity. In: Thirty-Fifth Annual ACM Symposium on Theory of Computing, June 9–11, 2003, San Diego, California, USA, pp. 167-176.

Cole, Richard and Hariharan, Ramesh (2003) Faster Suffix Tree Construction with Missing Suffix Links. In: SIAM Journal on Computing, 33 (1). pp. 26-42.

Cole, Richard and Hariharan, Ramesh (1997) Tighter upper bounds on the exact complexity of string matching. In: SIAM Journal on Computing, 26 (3). pp. 803-856.

Cole, Richard and Hariharan, Ramesh (2003) Tree Pattern Matching to Subset Matching in Linear Time. In: SIAM Journal on Computing, 32 (4). pp. 1056-1066.

Cole, Richard and Hariharan, Ramesh (2002) Verifying Candidate Matches in Sparse and Wildcard Matching. In: 34th Annual ACM Symposium on Theory of Computing, May 19 - 21, Montreal, Quebec, Canada, pp. 592-601.

Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) A Faster Implementation of the Goemans-Williamson Clustering Algorithm. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 17-25.

Czygrinow, Andrzej and Kamat, Vikram (2012) Tight co-degree condition for perfect matchings in 4-graphs. In: ELECTRONIC JOURNAL OF COMBINATORICS, 19 (2).

D

D'Souza, Deepak and Gopinathan, Madhu and Ramesh, S and Sampath, Prahladavaradan (2008) Conflict-Tolerant Real-Time Features. In: 5th International Conference on the Quantitative Evalutation of Systems, SEP 14-17, 2008, France.

D'Souza, Deepak and Gopinathan, Madhu and Ramesh, S and Sampath, Prahladavaradan (2009) Supervisory Control for Real-Time Systems Based on Conflict-Tolerant Controllers. In: IEEE International Conference on Automation Science and Engineering, AUG 22-25, 2009, Bangalore, pp. 555-560.

D'Souza, Deepak and Gopinathan, Madhu (2006) Computing complete test graphs for hierarchical systems. In: 4th IEEE International Conference on Software Engineering and Formal Methods, Pune, India, Sep 11-15, 2006, pp. 70-79.

D'Souza, Deepak and Gopinathan, Madhu and Ramesh, S and Sampath, Prahladavaradan (2013) Conflict-tolerant specifications for hybrid systems. In: Journal of the Indian Institute of Science, 93 (3). pp. 403-417.

D'Souza, Deepak and Lal, Akash (2017) Special issue on the 16th International Conference on Verification, Model Checking, and Abstract Interpretation. In: COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 47 (1, SI). p. 1.

D'Souza, Deepak and Sampath, Prahladavaradan and Ramesh, S and Gopinathan, Madhu (2010) Conflict-Tolerant Specifications for Hybrid Systems. IISc-CSA-TR-2010-6.

DSouza, D and Holla, R and Kulkarni, J and Raghavendra, KR and Sprick, B (2008) On the Decidability of Model Checking Information Flow Properties. In: 4th International Conference on Information Systems Security, ICISS, 16 - 20 December 2008.

DSouza, Deepak and Raj, Mohan M (2005) Eventual Timed Automata. In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, December 15-18, 2005., Hyderabad, India..

DSouza, Igneta and Singh, Prashant and Dewan, Hrishikesh and Hansdah, RC (2018) HTU : An Efficient Hash-Trie Data Structure for URL matching for Programmable Web Resources. In: 2018 IEEE 11th Conference On Service-Oriented Computing And Applications (SOCA), NOV 19-22, 2018, Paris, FRANCE, pp. 233-238.

Dalai, Deepak Kumar and Sarkar, Pinaki (2017) Key Predistribution Schemes Using Bent Functions in Distributed Sensor Networks. In: 12th International Conference on Information Security and Cryptology, INSCRYPT 2016, November 4-6, 2016, Beijing, China, pp. 367-385.

Dalai, Deepak Kumar and Sarkar, Pinaki (2017) Sensornet A Key Predistribution Scheme for Distributed Sensors using Nets. In: 6th International Conference on Sensor Networks (SENSORNETS), FEB 19-21, 2017, Porto, PORTUGAL, pp. 49-58.

Damgård, I and Ganesh, C and Khoshakhlagh, H and Orlandi, C and Siniscalchi, L (2021) Balancing Privacy and Accountability in Blockchain Identity Management. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 17 - 20 May 2021, Virtual, Online, pp. 552-576.

Danda, S and Challa, A and Sagar, BSD and Najman, L (2021) A tutorial on applications of power watershed optimization to image processing. In: European Physical Journal: Special Topics .

Dani, AM and Amrutur, B and Srikant, YN and Bhattacharyya, C (2012) TCP: thread contention predictor for parallel programs. In: 2012 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), 15-17 Feb. 2012, Garching.

Dani, AM and Amrutur, Bharadwaj S and Srikant, YN (2011) Adaptive power optimization of on-chip SNUCA cache on tiled chip multicore architecture using remap policy. In: 2011 Second Workshop on Architecture and Multi-Core Applications (WAMCA), 26-27 Oct. 2011, Vitoria, Espirito Santo.

Dani, Aparna Mandke and Srikant, YN and Amrutur, Bharadwaj (2012) Efficient Cache Exploration Method for a Tiled Chip Multiprocessor. In: 19th International Conference on High Performance Computing (HiPC), DEC 18-22, 2012, Pune, INDIA.

Dani , Aparna Mandke and Amrutur, Bharadwaj and Srikant, YN (2011) Applying Genetic Algorithms to Optimize Power in Tiled SNUCA Chip Multicore Architectures. In: Symposium on Applied Computing , March 21-25 2011, Taichung, Taiwan.

Dani , Aparna Mandke and Amrutur, Bharadwaj and Srikant, YN (2010) Applying Genetic Algorithms to Optimize Power in Tiled SNUCA Chip Multicore Architectures. UNSPECIFIED.

Dante, HM and Sarma, VVS (1979) Automatic Speaker Identification for a Large Population. In: IEEE Transactions on Acoustics, Speech, and Signal Processing, 27 (3). pp. 255-263.

Dante, HM and Sarma, VVS (1980) A Pattern Recognition Model of Voice-Based Personal Verification Systems for Forensic Applications. In: IEEE Transactions on Systems, Man and Cybernetics,, 10 (9). pp. 585-588.

Das, Abhijit and Madhavan, Veni CE (2005) On the cubic sieve method for computing discrete logarithms over prime fields. In: International Journal of Computer Mathematics, 82 (12). pp. 1481-1495.

Das, Abhijit and Madhavan, Veni CE (1999) Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. In: 10th International Symposium on Algorithms and Computation, ISAAC'99, December 1999, Chennai, India, pp. 295-306.

Das, Akash Sarma and Gujar, Sujit and Narahari, Y (2010) Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Searth Auctions. arXiv:1001.1414.

Das, Anita and Francis, Mathew C and Mathew, Rogers and Sadagopan, N (2010) Non-contractible non-edges in 2-connected graphs. In: Information Processing Letters, 110 (23). pp. 1044-1048.

Das, Gopal Chandra and Haritsa, Jayant R (2007) Robust heuristics for scalable optimization of complex SQL queries. In: IEEE 23rd International Conference on Data Engineering, APR 11-15, 2007, Istanbul.

Das, Mrinal and Bhattacharyya, Chiranjib (2018) Weight-Agnostic Hierarchical Stick-Breaking Process. In: 9th IEEE International Conference on Big Knowledge, ICBK 2018, 17 - 18th Nov. 2018, Singapore, pp. 342-349.

Das, Prem Laxman M and Rangasamy, Jothi and Kabaleeshwaran, R (2016) Refined Shacham-Waters ring signature scheme in Seo-Cheon framework. In: SECURITY AND COMMUNICATION NETWORKS, 9 (13). pp. 2122-2134.

Das, S and Sridharamurthy, R and Natarajan, V (2024) Time-varying Extremum Graphs. [Preprint]

Das, SR and Vaidya, NH and Patnaik, LM and Mathias, PC (1990) A systolic algorithm for hidden surface removal. In: Parallel Computing, 15 (1-3). pp. 277-289.

Das, Sajal Kumar and Agrawal, VK and Sarkar, Dilip and Patnaik, LM and Goel, PS (1987) Reflexive Incidence Matrx (RIM) Representation of Petr Nets. In: IEEE Transactions on Software Engineering, 13 (6). 643 -653.

Das, Sajal Kumar and Agrawal, Vinod Kumar and Sarkar, Dilip and Patnaik, Lalit M (1988) Invariant-preserving Petri net reduction and conditions for invariant-existence. In: Computers & Electrical Engineering, 14 (3-4). pp. 75-91.

Das, Sajal Kumar and Sarkar, Dilip and Agrawal, VK and Patnaik, LM (1991) Extended colored Petri net: An efficient tool for analyzing concurrent systems. In: Information Sciences, 54 (3). pp. 191-218.

Das Sharma, Akash and Gujar, Sujit and Narahari, Y (2012) Truthful multi-armed bandit mechanisms for multi-slot sponsored search auctions. In: CURRENT SCIENCE, 103 (9). pp. 1064-1077.

Dasarathy, BV (1974) Dynamics of a class of social interaction systems. In: International Journal of Systems Science, 5 (4). pp. 329-333.

Dasarathy, BV (1972) Equivalence conditions for classes of linear and non-linear distributed parameter systems. In: Journal of Sound and Vibration, 24 (1). pp. 35-40.

Dasarathy, BV (1974) Feature selection and the concept of immediate neighborhood in the context of clustering techniques. In: Proceedings of the IEEE, 62 (4). pp. 529-530.

Dasarathy, BV (1974) On a generalized dynamic model of bi-state social interaction processes. In: International Journal of Systems Science, 5 (5). pp. 499-502.

Dasarathy, BV (1975) An analytical approach to the study of a class of bi-state social interaction processes. In: International Journal of Systems Science, 6 (4). 367 -370.

Dasarathy, BV (1974) A differential transformation technique for the analysis of a class of non-linear time varying systems. In: International Journal of Systems Science, 5 (1). pp. 1-4.

Dasgupta, SS and Ray, SN and Talukdar, P (2020) Hyte: Hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, 31 Oct-4 Nov 2018, Brussels, Belgium, pp. 2001-2011.

Dash, Subhasis and Mallick, Satya Sundar and Hansdah, RC and Swain, Amulya Ratna (2015) A Distributed Approach to Construct Hierarchical Structure for Routing with Balanced Energy Consumption in WSNs. In: IEEE 29th International Conference on Advanced Information Networking and Applications (IEEE AINA), MAR 25-27, 2015, Gwangju, SOUTH KOREA, pp. 382-388.

Dathathri, Roshan and Reddy, Chandan and Ramashekar, Thejas and Bondhugula, Uday (2013) Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory. In: 22nd International Conference on Parallel Architectures and Compilation Techniques (PACT), SEP 07-11, 2013, Edinburgh, SCOTLAND, pp. 375-386.

Datta, Anindya and Dutta, Kaushik and Thomas, Helen and VanderMeer, Debra and Ramamritham, Krithi and Suresha, * (2002) A Proxy-Based Approach for Dynamic Content Acceleration on the WWW. In: Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002), 26-28 June, 2002, Newport Beach, California, USA, pp. 159-164.

Dattasharma, A and Keerthi, SS (1993) Translational motion planning for a convex polyhedron in a 3D polyhedral world using an efficient and new roadmap. In: CCCG. Proceedings of the Fifth Canadian Conference on Computational Geometry, 5-9 Aug. 1993, Waterloo, Ont., Canada, pp. 449-454.

Dattasharma, Abhi and Keerthi, Sathiya S (1995) An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles. In: Theoretical Computer Science, 140 (2). pp. 205-230.

Dattatreya, GR and Sarma, VVS (1982) An Adaptive Scheme for Learning the Probability Threshold in Pattern Recognition. In: IEEE Trans Syst Man Cybern Syst Hum, 12 (6). pp. 927-934.

Dattatreya, GR and Sarma, VVS (1981) Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, 3 (3). pp. 293-298.

Dattatreya, GR and Sarma, VVS (1984) Decision tree design and applications in speech processing. In: IEE Proceedings F Communications, Radar and Signal Processing, 131 (2). pp. 146-152.

Dave, Maulik A and Srikant, YN (1991) A parallelizing compiler for Pascal. In: Journal of the Indian Institute of Science, 71 (2). pp. 125-158.

Dayama, Pankaj and Garg, Dinesh and Narahari, Y and Zou, James (2012) Threats and trade-fffs in resource critical crowdsourcing tasks over networks. In: AAAI 2012 (Poster) International Conference of the American Association for Artificial Intelligence, 2012, Toronto, Ontario.

Dayama, Pankaj and Karnik, Aditya and Narahari, Y (2012) Optimal incentive timing strategies for product marketing on social networks. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, June 4-8, 2012, Valencia, Spain.

Dayama, Pankaj and Narahari, Y (2006) Design of Multiunit Electronic Exchanges Through Decomposition. In: IEEE Transaction on Automation Science and Engineering, 4 (1). pp. 67-74.

Dayama, Pankaj and Narahari, Y (2007) Design of multiunit electronic exchanges through decomposition. In: IEEE Transactions on Automation Science and Engineering, 4 (1). pp. 67-74.

De, Arnab and D’Souza, Deepak (2012) Scalable flow-sensitive pointer analysis for fava with strong updates. In: Proceedings of 26th European Conference, June 11-16, 2012, Beijing, China.

De, Arnab and D’Souza, Deepak and Nasre, Rupesh (2011) Dataflow analysis for data-race free programs. In: ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software, 2011, Heidelberg.

De, Arnab and Roychoudhury, Abhik and D'Souza, Deepak (2010) WOMM: A Weak Operational Memory Model. In: 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, OCT 18-21, 2010, Heraklion, GREECE, pp. 519-534.

De, Arnab and Roychoudhury, Abhik and D’Souza, Deepak (2008) Java Memory Model aware Software validation. In: PASTE '08 Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, New York, NY.

De, M and Lahiri, A (2023) Geometric dominating-set and set-cover via local-search. In: Computational Geometry: Theory and Applications, 113 .

Deb, R and Bhatnagar, S (2022) Gradient Temporal Difference with Momentum: Stability and Convergence. In: 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 22 February - 1 March 2022, Virtual, Online, pp. 6488-6496.

Deb, R and Gandhi, M and Bhatnagar, S (2022) Schedule Based Temporal Difference Algorithms. In: 58th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2022, 27 - 30 September 2022, Monticello.

Deepak, DSouza and Raghavendra, KR and Barbara, Sprick (2005) An automata based approach for verifying information flow properties. In: Tthe Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2005), 16 July, 2005, pp. 39-58.

Deepak, P and Garg, D and Shevade, S (2017) Latent space embedding for retrieval in question-answer archives. In: 2017 Conference on Empirical Methods in Natural Language Processing, EMNLP 2017, 9 - 11 September 2017, Copenhagen, pp. 855-865.

Demri, Stephane and D'Souza, Deepak and Gascon, Regis (2012) Temporal Logics of Repeating Values. In: JOURNAL OF LOGIC AND COMPUTATION, 22 (5). pp. 1059-1096.

Demri, Stephane and D’Souza, Deepak (2007) An automata-theoretic approach to constraint LTL. In: Information and Computation, 205 (3). pp. 380-415.

Demri, Stéphane and D'Souza, Deepak and Gascon, Régis (2007) A decidable temporal logic with repeating values. In: LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science, Heidelberg.

Deodhare, Dipti and Vidyasagar, M and Keerthi, Sathiya S (1998) Synthesis of Fault-Tolerant Feedforward Neural Networks Using Minimax Optimization. In: IEEE Transactions on Neural Networks, 9 (5). pp. 891-900.

Deodhare, Dipti and Vidyasagar, M and Narasimha Murty, M (2007) A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features. In: ICCTA '07. International Conference on Computing: Theory and Applications, 2007., 5-7 March 2007, Kolkata .

Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2023) Peak Demand Minimization via Sliced Strip Packing. In: Algorithmica, 85 (12). pp. 3649-3679.

Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2021) Peak demand minimization via sliced strip packing. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 Aug 2021, Seattle.

Deshmukh, Kaustubh and Shankar, Priti and Dasgupta, Amitava and Rajan, Sundar B (2000) On the Many Faces of Block Codes. In: STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science, February 2000, France, pp. 53-64.

Devaki, Pranavadatta and Kanade, Aditya (2012) Static analysis for checking data format compatibility of programs. In: FSTTCS 2012 : IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, December 15 to 17, 2012, Hyderabad, India.

Devi, B Bharathi and Sarma, VVS (1985) Estimation of fuzzy memberships from histograms. In: Information Sciences, 35 (1). pp. 43-59.

Devi, B. Bharathi and Sarma, VVS (1984) A fuzzy multistage evolutionary (FUME) clustering technique. In: Pattern Recognition Letters, 2 (3). pp. 139-145.

Devi, Prasanna S and Narahari, Y and Viswanadham, N and Kiran, Vinu S and Manivannan, S (2015) E-Mandi Implementation Based On Gale-Shapely Algorithm for Perishable Goods Supply Chain. In: IEEE International Conference on Automation Science and Engineering (CASE), AUG 24-28, 2015, Gothenburg, SWEDEN, pp. 1421-1426.

Devi, Susheela V and Akhand, Bhupesh (2016) Feature Reduction for Multi Label Classification of Discrete Data. In: 12th International Conference on Machine Learning and Data Mining (MLDM), JUL 16-21, 2016, New York, NY, pp. 630-642.

Devi, Susheela V and Murty, Narasimha M (2000) Stochastic search techniques for post-fault restoration of electrical distribution systems. In: Sadhana, 25 (1). pp. 45-56.

Dewan, H and Hansdah, R (2018) Bristrita: Namespace and metadata distribution in large-scale distributed cloud storage systems. In: 3rd IEEE International Conference on Smart Cloud, SmartCloud 2018, 21 - 23 September 2018, New York, pp. 116-124.

Dewan, H and Hansdah, R and Singh, P (2018) Sigma-tree:Design of a data structure for storing file data allocation map in a distributed file system. In: 3rd IEEE International Conference on Smart Cloud, SmartCloud 2018, 21 - 23 September 2018, New York, pp. 90-98.

Dewan, Hrishikesh and Devi, Susheela V (2012) A peer-peer particle swarm optimizer. In: 6th International Conference on Genetic and Evolutionary Computing (ICGEC), AUG 25-28, 2012, Kitakyushu, JAPAN, pp. 140-144.

Dewan, Hrishikesh and Hansdah, RC (2018) Afuronto: A six hop peer-to-peer network of zillions of Nodes. In: 32nd IEEE International Conference on Advanced Information Networking and Applications (AINA), MAY 16-18, 2018, Krakow, POLAND, pp. 1043-1052.

Dewan, Hrishikesh and Hansdah, RC (2018) Julunga: A new Large-Scale Distributed Read-Write File Storage System for Cloud Computing Environments. In: 32nd IEEE International Conference on Advanced Information Networking and Applications (AINA), MAY 16-18, 2018, Krakow, POLAND, pp. 942-951.

Dewan, Hrishikesh and Hansdah, RC (2011) A survey of cloud storage facilities. In: 2011 IEEE World Congress on Services (SERVICES), 4-9 July 2011, Washington, DC.

Dewan, Hrishikesh and Nayak, Raksha B (2014) Solving Dynamic Constraint Single Objective Functions using a Nature Inspired Technique. In: 5th International Conference on Information Science and Applications (ICISA), MAY 06-09, 2014, Seoul, SOUTH KOREA.

Dey, Atreyee and Bhaumik, Sourjya and Harish, D and Haritsa, Jayant R (2008) Efficiently Approximating Query Optimizer Plan Diagrams. In: Proc. of 34th Intl. Conf. on Very Large Data Bases (VLDB), Auckland, New Zealand, Auckland.

Dey, P (2017) Query complexity of tournament solutions. In: 31st AAAI Conference on Artificial Intelligence, AAAI 2017, 4 - 10 February 2017, San Francisco, pp. 2992-2998.

Dey, Palash and Goyal, Prachi and Misra, Neeldhara (2014) UNO Gets Easier for a Single Player. In: 7th International Conference on Fun with Algorithms, JUL 01-03, 2014, ITALY, pp. 147-157.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2017) Frugal bribery in voting. In: THEORETICAL COMPUTER SCIENCE, 676 . pp. 15-32.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2016) Kernelization complexity of possible winner and coalitional manipulation problems in voting. In: THEORETICAL COMPUTER SCIENCE, 616 . pp. 111-125.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2019) Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. In: THEORETICAL COMPUTER SCIENCE, 783 . pp. 53-70.

Dey, Sandip and Pal, Arindam (2002) A token-based distributed algorithm for total order atomic broadcast. In: Lecture Notes in Computer Science, 2571 . pp. 343-347.

Dhakad, Lucky and Das, Mrinal and Bhattacharyya, Chiranjib and Datta, Samik and Kale, Mihir and Mehta, Vivek (2017) SOPER: Discovering the Influence of Fashion and the Many Faces of User from Session Logs using Stick Breaking Process. In: ACM Conference on Information and Knowledge Management (CIKM), NOV 06-10, 2017, Singapore, SINGAPORE, pp. 1609-1618.

Dhamal, Swapnil and Bhat, Satyanath and Anoop, KR and Embar, Varun R (2011) Pattern clustering using cooperative game theory. In: Proceedings of Centenary Conference Department of Electrical Engineering, 2011, Bangalore, India.

Dhamal, Swapnil and Narahari, Y (2012) Forming Networks of Strategic Agents with Desired Topologies. In: The 8th International Conference on Internet & Network Economics (WINE 2012), December 9-12, 2012, Liverpool, UK.

Dhamal, Swapnil and Narahari, Y (2013) Scalable Preference Aggregation in Social Networks. In: The First AAAI Conference on Human Computation and Crowdsourcing (HCOMP 2013), November 6-9, 2013, Palm Springs, California, USA. (In Press)

Dhamal, Swapnil and Narahari, Y (2012) Sufficient conditions for formation of a network topology by self-interested agents. In: Proceedings of the 8th International Workshop, WINE 2012, December 10-12, 2012, Liverpool, UK.

Dhamal, Swapnil and Prabuchandran, KJ and Narahari, Y (2015) A Multi-phase Approach for Improving Information Diffusion in Social Networks. In: The 14th International Conference on Autonomous Agents & Multiagent Systems (AAMAS 2015), May 4-8, 2015, Istanbul, Turkey.

Dharmadeep, MC and Gopinath, K (2006) Proactive leader election in asynchronous shared memory systems. In: Lecture Notes In Computer Science (4218). pp. 384-398.

Dharmavaram, A and Riemer, M and Bhatnagar, S (2020) Hierarchical Average Reward Policy Gradient Algorithms. In: 34th AAAI Conference on Artificial Intelligence, AAAI 2020, 7-12 Feb 2020, New York, pp. 13777-13778.

Dhok, Monika and Ramanathan, Murali Krishna (2016) Directed Test Generation to Detect Loop Inefficiencies. In: 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), NOV 13-18, 2016, Seattle, WA, pp. 895-907.

Dhole, H and Susheela Devi, V and Aparna, R and Raj, R (2022) Multilabel Image classification using optimized ensemble deep learning. In: 2022 IEEE World Conference on Applied Intelligence and Computing, AIC 2022, 17 - 19 June 2022, Sonbhadra, pp. 732-738.

Diddigi, RB and Jain, P and Prabuchandran, JK and Bhatnagar, S (2022) Neural Network Compatible Off-Policy Natural Actor-Critic Algorithm. In: 2022 International Joint Conference on Neural Networks, IJCNN 2022, 18 - 23 July 2022, Padua.

Diddigi, RB and Prabuchandran, KJ and Sai Koti Reddy, D and Bhatnagar, S (2019) Actor-critic algorithms for constrained multi-agent reinforcement learning. In: 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019, 13 May 2019through 17 May 2019, Montreal, pp. 1931-1933.

Diddigi, Raghuram Bharadwaj and Prabuchandran, KJ and Bhatnagar, Shalahh (2018) Novel Sensor Scheduling Scheme for Intruder Tracking in Energy Efficient Sensor Networks. In: IEEE WIRELESS COMMUNICATIONS LETTERS, 7 (5). pp. 712-715.

Dikshit, Devansh and Yadati, Narahari (2009) Truthful and Quality Conscious Query Incentive Networks. In: 5th International Workshop on Internet and Network Economics, DEC 14-18, 2009, Sapienza Univ, Dept Comp & Syst Sci, Rome, ITALY, pp. 386-397.

Dillard, Scott E and Natarajan, Vijay and Weber, , Gunther H and Pascucci, Valerio and Hamann, Bernd (2009) Topology-Guided Tessellation Of Quadratic Elements. In: 17th International Symposium on Algorithms and Computation (ISAAC 2006), DEC 18-20, 2006, Calcutta,India, pp. 195-211.

Dinesh Ram Kumar, T and Bhatia, A and Hansdah, RC (2020) Exploiting Multiple Paths in Multi-hop Co-operative Ad-Hoc Networks for Providing Security without Trusted Third Party. In: Advances in Intelligent Systems and Computing, 27 - 29 March 2019, Matsue, pp. 1254-1265.

Dinesha, Vijeth and Adabala, Neeharika and Natarajan, Vijay (2012) Uncertainty visualization using HDR volume rendering. In: Visual Computer, The, 28 (3). pp. 265-278.

Divakaran, Sumesh and Mohan, Raj M (2010) Conflict-Tolerant Real-Time Specifications in Metric Temporal Logic. In: 2010 17th International Symposium on Temporal Representation and Reasoning (TIME), 6-8 Sept. 2010, Paris.

Dohare, Deepti and Devi, Susheela S (2011) Combination of similarity measures for time series classification using genetic algorithms. In: 2011 IEEE Congress on Evolutionary Computation (CEC), 5-8 June 2011, New Orleans, LA.

Doraiswamy, Harish and Natarajan, Vijay (2008) Efficient Output-Sensitive Construction of Reeb Graphs. [Book Chapter]

Doraiswamy, H and Kalagi, V and Ramachandra, K and Haritsa, JR (2023) A Case for Graphics-driven Query Processing. In: 49th International Conference on Very Large Data Bases, VLDB 2023, 28 August - 1 September 2023, Vancouver, pp. 2499-2511.

Doraiswamy, Harish and Natarajan, Vijay (2013) Computing Reeb Graphs as a Union of Contour Trees. In: IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 19 (2). pp. 249-262.

Doraiswamy, Harish and Natarajan, Vijay (2009) Efficient algorithms for computing Reeb graphs. In: Computational Geometry, 42 (6-7). pp. 606-616.

Doraiswamy, Harish and Natarajan, Vijay (2012) Output-Sensitive Construction of Reeb Graphs. In: IEEE Transactions on Visualization and Computer Graphics, 18 (1). pp. 146-159.

Doraiswamy, Harish and Natarajan, Vijay and Nanjundiah, Ravi S (2013) An exploration framework to identify and track movement of cloud systems. In: IEEE Transactions on Visualization and Computer Graphics, 19 (12). pp. 2896-2905.

Doraiswamy, Harish and Shivashankar, Nithin and Natarajan, Vijay and Wang, Yusu (2013) Topological saliency. In: COMPUTERS & GRAPHICS-UK, 37 (7). pp. 787-799.

Doraiswamy, Harish and Sood, Aneesh and Natarajan, Vijay (2010) Constructing Reeb Graphs using Cylinder Maps. In: 26th Annual Symposium on Computational Geometry, JUN 13-16, 2010, Snowbird, pp. 111-112.

Drineas, P and Frieze, A and Kannan, R and Vempala, S and Vinay, V (2004) Clustering Large Graphs via the Singular Value Decomposition. In: Machine Learning, 56 (1-3). pp. 9-33.

Duan, Kaibo and Keerthi, Sathiya S and Chu, Wei and Shevade, Shirish Krishnaj and Poo, Aun Neow (2003) Multi-category classification by soft-max combination of binary classifiers. In: 4th International Workshop, June 11-13, 2003, Guilford, England, pp. 125-134.

Dubey, Avinava and Chakrabarti, Soumen and Bhattacharyya, Chiranjib (2011) Diversity in ranking via resistive graph centers. In: KDD '11 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011, New York, NY, USA.

Dukkipati, A and Bhatnagar, S and Murty, MN (2007) Gelfand-Yaglom-Perez theorem for generalized relative entropy functionals. In: Information Sciences, 177 (24). pp. 5707-5714.

Dukkipati, A and Banerjee, R and Ayyagari, RS and Udaybhai, DP (2022) Learning Skills to Navigate without a Master: A Sequential Multi-Policy Reinforcement Learning Algorithm. In: IEEE International Conference on Intelligent Robots and Systems, 23 - 27 October 2022, Kyoto, pp. 2483-2489.

Dukkipati, Ambedkar (2012) On maximum entropy and minimum KL-divergence optimization by Grobner basis methods. In: APPLIED MATHEMATICS AND COMPUTATION, 218 (23). pp. 11674-11687.

Dukkipati, Ambedkar and Bhatnagar, Shalabh and Murty, Narasimha M (2007) On measure-theoretic aspects of nonextensive entropy functionals and corresponding maximum entropy prescriptions. In: Physica A: Statistical Mechanics and its Applications, 384 (2). pp. 758-774.

Dukkipati, Ambedkar and Manathara, Joel George (2010) An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models. In: 12th CASC International Workshop, SEP 06-12, 2010, Tsakhkadzor, ARMENIA, pp. 85-96.

Dukkipati, Ambedkar and Murty, Narasimha M (2002) Selection by Parts: 'Selection in Two Episodes' in Evolutionary Algorithms. In: 2002 Congress on Evolutionary Computation. CEC '02, 12-17 May, Honolulu,Hawaii, Vol.1, 657 -662.

Dukkipati, Ambedkar and Murty, Narasimha M and Bhatnagar, Shalabh (2004) Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms. In: 2004 Congress on Evolutionary Computation. CEC2004, 19-23 June, Portland,Origon, Vol.1, 55-62.

Dukkipati, Ambedkar and Murty, Narasimha M and Bhatnagar, Shalabh (2005) Information theoretic justification of Boltzmann selection and its generalization to Tsallis case. In: IEEE Congress on Evolutionary Computation, 2-5 Sept, 2005, Monterey, CA, United States, pp. 1667-1674.

Dukkipati, Ambedkar and Murty, Narasimha M and Bhatnagar, Shalabh (2006) Nonextensive triangle equality and other properties of Tsallis relative-entropy minimization. In: Physica A-Statistical Mechanics And Its Applications, 361 (1). pp. 124-138.

Dukkipati, Ambedkar and Murty, Narasimha M and Bhatnagar, Shalabh (2003) Quotient Evolutionary Space: Abstraction of Evolutionary process w.r.t macroscopic properties. In: The 2003 Congress on Evolutionary Computation – CEC 2003, 8-12 December 2003, Canberra, Australia, pp. 846-853.

Dukkipati, Ambedkar and Palimar, Sushma (2017) Primes of the form x(2) + dy(2) with x 0(mod N) or y O (mod N). In: PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 127 (1). pp. 35-43.

Dukkipati, Ambedkar and Pandey, Gaurav and Ghoshdastidar, Debarghya and Koley, Paramita and Sriram, Satya DMV (2013) Generative Maximum Entropy Learning for Multiclass Classification. In: IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA . pp. 141-150.

Duseja, T and Annervaz, KM and Duggani, J and Zacharia, S and Free, M and Dukkipati, A (2024) Learning to Switch off, Switch on, and Integrate Modalities in Large Pre-trained Transformers. In: 7th IEEE International Conference on Multimedia Information Processing and Retrieval, MIPR 2024, 7 August 2024through 9 August 2024, San Jose, pp. 403-409.

Dutt, Anshuman and Haritsa, Jayant R (2016) Plan Bouquets: A Fragrant Approach to Robust Query Processing. In: ACM TRANSACTIONS ON DATABASE SYSTEMS, 41 (2).

Dutta, M and Ganesh, C and Jawalkar, N (2024) Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting. In: 27th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2024, 15 April 2024through 17 April 2024, Sydney, pp. 305-336.

Dutta, P and Mayilvaghanan, K and Sinha, P and Dukkipati, A (2023) Deep Representation Learning for Prediction of Temporal Event Sets in the Continuous Time Domain. In: 15th Asian Conference on Machine Learning, ACML 2023, 11 November 2023 through 14 November 2023, Istanbul, pp. 343-358.

D’Souza, Deepak and Gopinathan, Madhu (2008) Conflict-Tolerant Features. In: 20th International Conference on Computer Aided Verification, JUL 07, 2008, Princeton, pp. 227-239.

D’Souza, Deepak and Holla, R and Kulkarni, J and Raghavendra, KR and Sprick, Barbara (2008) On the Decidability of Model-Checking Information Flow Properties. In: ICISS 2008, Hyderabad, 16 - 20 December 2008, Hyderabad.

D’Souza, Deepak and Matteplackel, Raj Mohan (2012) Compositional hierarchical monitoring automaton construction for LTL. In: Proceedings of 9th International Colloquium, September 24-27, 2012, Bangalore, India, pp. 16-29.

D’Souza, Deepak and Raghavendra, KR (2012) Model-checking bisimulation-based information flow properties for infinite state sstems. In: Proceedings of 17th European Symposium on Research in Computer Security, September 10-12, 2012, Pisa, Italy.

E

Ehrlich, M and Boll, W and Van Oijen, A and Hariharan, R and Chandran, K and Nibert, ML and Kirchhausen, T (2004) Endocytosis by random initiation and stabilization of clathrin-coatedpits. In: Cell, 118 (5). pp. 591-605.

Epstein, D and Golumbic, MC and Lahiri, A and Morgenstern, G (2020) Hardness and approximation for L-EPG and B1-EPG graphs. In: Discrete Applied Mathematics, 281 . pp. 224-228.

Eshwar, SR and Felipe, LL and Reiffers-Masson, A and Menasche, DS and Thoppe, G (2024) Online Learning of Weakly Coupled MDP Policies for Load Balancing and Auto Scaling. In: 23rd International Federation for Information Processing on Networking Conference, IFIP Networking 2024, 3 June 2024 through 6 June 2024, Thessaloniki, Greece., pp. 496-501.

Ezudheen, P and Afzal, ZR and Prabhakar, P and D'Souza, D and D'Souza, M (2020) Verifying Band Convergence for Sampled Control Systems. In: 12th International Symposium on NASA Formal Methods, NFM 2020, 11-15, May 2020, Moffett Field; United States, pp. 329-349.

Ezudheen, P and Neider, D and D'Souza, D and Garg, P and Madhusudan, P (2018) Horn-ice learning for synthesizing invariants and contracts. In: Proceedings of the ACM on Programming Languages, 2 (OOPSLA).

F

Fischer, Carl and Sukumar, Poorna Talkad and Hazas, Mike (2013) Tutorial: implementing a pedestrian tracker using inertial sensors. In: IEEE Pervasive Computing, 12 (2). pp. 17-27.

Fomin, Fedor V and Saurabh, Saket and Misra, Neeldhara (2015) Graph Modification Problems: A Modern Perspective. In: 9th International Frontiers of Algorithmics Workshop (FAW), JUL 03-05, 2015, Guilin, PEOPLES R CHINA, pp. 3-6.

Francis, Maria and Dukkipati, Ambedkar (2018) On Grobner bases and Krull dimension of residue class rings of polynomial rings over integral domains. In: JOURNAL OF SYMBOLIC COMPUTATION, 86 . pp. 1-19.

Francis, Maria and Dukkipati, Ambedkar (2018) On ideal lattices, Grobner bases and generalized hash functions. In: JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 17 (6).

Francis, Maria and Dukkipati, Ambedkar (2014) Reduced Grobner bases and Macaulay-Buchberger Basis Theorem over Noetherian rings. In: JOURNAL OF SYMBOLIC COMPUTATION, 65 . pp. 1-14.

Francis, Mathew C and Lahiri, Abhiruk (2016) VPG and EPG bend-numbers of Halin graphs. In: DISCRETE APPLIED MATHEMATICS, 215 . pp. 95-105.

Fu, Xiao and Huang, Kejun and Papalexakis, Evangelos E and Song, Hyun Ah and Talukdar, Partha and Sidiropoulos, Nicholas D and Faloutsos, Christos and Mitchell, Tom (2019) Efficient and Distributed Generalized Canonical Correlation Analysis for Big Multiview Data. In: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 31 (12). pp. 2304-2318.

Fung, Wai-Shing and Hariharan, Ramesh and Harvey, Nicholas J A and Panigrahi, Debmalya (2019) A GENERAL FRAMEWORK FOR GRAPH SPARSIFICATION. In: SIAM JOURNAL ON COMPUTING, 48 (4). pp. 1196-1223.

G

Gabrani, Naveen and Shankar, Priti (1992) A note on the reconstruction of a binary tree from its traversals. In: Information Processing Letters, 42 (2). 117 -119.

Galvez, W and Grandoni, F and Ameli, AJ and Jansen, K and Khan, A and Rau, M (2023) A Tight (3 / 2 + ε) -Approximation for Skewed Strip Packing. In: Algorithmica .

Galvez, W and Khan, A and Mari, M and Mömke, T and Pittu, MR and Wiese, A (2022) A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 9 January 2022 through 12 January 2022, Alexander, pp. 894-905.

Ganesan, Sashikumaar and Srivastava, Shweta (2017) ALE-SUPG finite element method for convection-diffusion problems in time-dependent domains: Conservative form. In: APPLIED MATHEMATICS AND COMPUTATION, 303 . pp. 128-145.

Ganesh, C and Kanukurthi, B and Shankar, G (2022) Secure Auctions in the Presence of Rational Adversaries. In: ACM SIGSAC Conference on Computer and Communications Security (CCS ’22), 7 - 11 November 2022, Los Angeles, pp. 1173-1186.

Ganesh, C and Khoshakhlagh, H and Kohlweiss, M and Nitulescu, A and ZajÄ c, M (2022) What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable? In: 13th International Conference on Security and Cryptography for Networks, SCN 2022, 12 - 14 September 2022, Amalfi, pp. 735-760.

Ganesh, C and Khoshakhlagh, H and Parisella, R (2022) NIWI and New Notions of Extraction for Algebraic Languages. In: 13th International Conference on Security and Cryptography for Networks, SCN 2022, 12 - 14 September 2022, Amalfi, pp. 687-710.

Ganesh, C and Magri, B and Venturi, D (2020) Cryptographic reverse firewalls for interactive proof systems. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 8-11, July 2020, Germany.

Ganesh, C and Nitulescu, A and Soria-Vazquez, E (2023) Rinocchio: SNARKs for Ring Arithmetic. In: Journal of Cryptology, 36 (4).

Ganesh, C and Orlandi, C and Pancholi, M and Takahashi, A and Tschudi, D (2022) Fiat–Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). In: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, 30 May - 3 June 2022, Trondheim, pp. 397-426.

Ganesh, C and Orlandi, C and Tschudi, D and Zohar, A (2022) Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. In: 16th International Workshop on Data Privacy Management, DPM 2021, and 5th International Workshop on Cryptocurrencies and Blockchain Technology, CBT 2021 held in conjunction with ESORICS 2021, 8 October 2021, Virtual, Online, pp. 173-191.

Ganesh, C and Patra, A (2020) Optimal extension protocols for byzantine broadcast and agreement. In: Distributed Computing .

Ganesh, Chaya and Kondi, Yashvanth and Patra, Arpita and Sarkar, Pratik (2018) Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. In: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC), MAR 25-29, 2018, Rio de Janeiro, BRAZIL.

Ganesh, Chaya and Patra, Arpita (2016) Broadcast Extensions with Optimal Communication and Round Complexity. In: 35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), JUL 25-28, 2016, Chicago, IL, pp. 371-380.

Ganesh, S and Deb, R and Thoppe, G and Budhiraja, A (2023) Does Momentum Help in Stochastic Optimization? A Sample Complexity Analysis. In: 39th Conference on Uncertainty in Artificial Intelligence, UAI 2023, 31 July - 4 August 2023, Pittsburgh, pp. 602-612.

Ganesh, S and Reiffers-Masson, A and Thoppe, G (2023) Online Learning with Adversaries: A Differential-Inclusion Analysis. In: UNSPECIFIED, pp. 1288-1293.

Garg, Dinesh and Narahari, Y and Gujar, Sujit (2008) Foundations of mechanism design: A tutorial Part 2 - Advanced concepts and results. In: SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 33 (2). pp. 131-174.

Garg, Vikas K and Murty, MN (2009) RACK: RApid Clustering using K-means algorithm. In: IEEE International Conference on Automation Science and Engineering. CASE 2009, AUG 22-25, 2009, Bangalore, pp. 621-626.

Garg, A and Gupta, N and Kayal, N and Saha, C (2019) Determinant equivalence test over finite fields and over q. In: 46th International Colloquium on Automata, Languages, and Programming, 7 July 2019 - 12 July 2019, Patras.

Garg, A and Kayal, N and Saha, C (2020) Learning sums of powers of low-degree polynomials in the non-degenerate case. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, 16-19 Nov 2020, Durham; United States, pp. 889-899.

Garg, D and Narahari, Y and Foster, Earnest and Kulkarni, Devadatta and Tew, Jeffrey D. (2005) A Groves Mechanism Approach to Decentralized Design of Supply Chains. In: Seventh IEEE International Conference on E-Commerce Technology, 2005. CEC 2005, 19-22 July, Munich,Germany, 330 -337.

Garg, D and Narahari, Y and Viswanadham, N (2006) Achieving sharp deliveries in supply chains through variance pool allocation. In: European Journal of Operational Research, 171 (1). pp. 227-254.

Garg, D and Narahari, Y and Viswanadham, N (2004) Design of six sigma supply chains. In: IEEE Transactions on Automation Science and Engineering, 1 (1). pp. 38-57.

Garg, Dinesh and Bhattacharya, Sourangshu and Sundararajan, S and Shevade, Shirish (2012) Mechanism design for cost optimal PAC learning in the presence of strategic noisy annotators. In: UAI 2012 : 28th Conference on Uncertainty in Artificial Intelligence, August 15-17, 2012, Catalina Island, USA.

Garg, Dinesh and Jain, Kamal and Talwar, Kunal and Vazirani, Vijay V (2007) A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. In: Theoretical Computer Science, 378 (2). pp. 143-152.

Garg, Dinesh and Manjunath, D and Borkar, VS (2005) Network pricing for QoS: A 'Regulation' approach. In: Advances in Control, Communication Networks, and Transportation Systems, JUN 05-07, 2005, Berkeley, CA.

Garg, Dinesh and Narahari, Y (2008) Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design. In: IEEE Transactions on Automation Science and Engineering, 5 (3). pp. 377-393.

Garg, Dinesh and Narahari, Y (2009) An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms. In: IEEE Transactions on Automation Science and Engineering, 6 (4). pp. 641-657. (In Press)

Garg, Dinesh and Narahari, Y and Gujar, Sujit (2008) Foundations of mechanism design: A tutorial Part 1 - Key concepts and classical results. In: Sadhana, 33 (2). pp. 83-130.

Garg, Dinesh and Narahari, Y and Reddy, Siva Sankar (2007) Design of an optimal auction for sponsored search auctions. In: 9th IEEE International Conference on E-Commerce Technology/4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, JUL 23-26, 2007, Tokyo.

Garg, Dinesh and Narahari, Y and Viswanadham, N (2002) Achieving Sharp Deliveries in Supply Chains Through Variance Pool Allocation. In: IEEE International Conference on Robotics and Automation, 2002. ICRA '02, 11-15 May, Washington, Vol.3, 2345-2350.

Garg, Dinesh and Narahari, Y and Viswanadham, N (2003) Design of Six Sigma Supply Chains. In: 2003 IEEE International Conference on Robotics and Automation, ICRA '03, 14-19 September, Tsipei,Taiwan, Vol.2, 1737 -1742.

Garg, Dinesh and Narahari, Y and Viswanadham, N (2003) A New Approach to Achieving Sharp and Timely Deliveries in Supply Chain Networks. In: 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003), 27-31 October, Las Vegas,Nevada, Vol.3, 2315 -2320.

Garg, Dinesh and Narahari, Yadati (2005) Price of Anarchy of Network Routing Games with Incomplete Information. [Book Chapter]

Garg, Dinesh and Sundararajan, Sellamanickam and Shevade, Shirish (2011) A game theoretic approach for feature clustering and its application to feature selection. In: Advances in Knowledge Discovery and Data Mining, 2011, Heidelberg.

Garg, M and Kar, D and Khan, A (2024) Random-Order Online Independent Set of Intervals and Hyperrectangles. In: Leibniz International Proceedings in Informatics, LIPIcs -32nd Annual European Symposium on Algorithms, ESA 2024, 2 September 2024- 4 September 2024, London.

Garg, Vikas K and Narahari, Y and Murty, Narasimha M (2013) Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory. In: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 25 (5). pp. 1070-1082.

Gaspers, Serge and Misra, Neeldhara and Ordyniak, Sebastian and Szeider, Stefan and Zivny, Stanislav (2017) Backdoors into heterogeneous classes of SAT and CSP. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 85 . pp. 38-56.

Gautam, Raghav Kumar and Hemachandra, N and Narahari, Y and Prakash, Hastagiri (2007) Optimal auctions for multi-unit procurement with volume discount bids. In: 9th IEEE International Conference on E-Commerce Technology/4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, UL 23-26, 2007, Tokyo.

Gehlot, Vijay and Srikantb, YN (1986) An interpreter for slips-An applicative language based on LAMBDA-Calculus. In: Computer Languages, 11 (1). pp. 1-13.

Ghalme, G and Dhamal, S and Jain, S and Gujar, S and Narahari, Y (2021) Ballooning Multi-Armed Bandits. In: ALA 2020 - Adaptive and Learning Agents Workshop at AAMAS 2020 .

Ghalme, G and Dhamal, S and Jain, S and Gujar, S and Narahari, Y (2020) Ballooning multi-armed bandits. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 13-19 May 2020, Virtual, Auckland, pp. 1849-1851.

Ghalme, G and Gujar, S and Jain, S and Narahari, Y (2017) Thompson sampling based mechanisms for stochastic multi-Armed bandit problems. In: 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017, 8 May 2017-12 May 2017, Sao paulo, pp. 87-95.

Ghalme, G and Nair, V and Patil, V and Zhou, Y (2022) Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, 9 - 13 May 2022, Virtual, Online at Auckland, pp. 525-533.

Ghalme, Ganesh and Gujar, Sujit and Kumar, Amleshwar and Jain, Shweta and Narahari, Y (2018) Design of Coalition Resistant Credit Score Functions for Online Discussion Forums. In: 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018, 10-15 Jul 2018, Stockholm; Sweden, pp. 95-103.

Ghosal, Dipak and Patnaik, L M (1986) Parallel polygon scan conversion algorithms: Performance evaluation on a shared bus architecture. In: Computers & Graphics, 10 (1). pp. 7-25.

Ghosal, Dipak and Patnaik, LM (1987) SHAMP: An experimental shared memory multimicroprocessor system for performance evaluation of parallel algorithms. In: Microprocessing and Microprogramming, 19 (3). pp. 179-192.

Ghosal, R and Chatterjee, S (2018) Privacy Preserving Multi-server k-means Computation over Horizontally Partitioned Data. In: 14th International Conference on Information Systems Security, ICISS 2018, 17 - 19 December 2018, Bangalore, pp. 189-208.

Ghosdastidar, Debarghya and Dukkipati, Ambedkar (2017) Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques. In: JOURNAL OF MACHINE LEARNING RESEARCH, 18 . pp. 1-41.

Ghose, D and Dam, B and Prasad, UR (1989) A Spread Acceleration Guidance Scheme for Command Guided Surface-To-Air Missiles. In: IEEE 1989 National Aerospace and Electronics Conference. NAECON 1989, 22-26 May, Dayton,OH, Vol.1, 202-208.

Ghose, D and Prasad, UR (1993) Determination of rational strategies for players in two-target games. In: Computers & Mathematics with Applications, 26 (6 ). pp. 1-11.

Ghose, D and Prasad, UR (1989) Multicriterion differential games with applications to combat problems. In: Computers & Mathematics with Applications, 18 (1-3). pp. 117-126.

Ghose, D and Prasad, UR (1991) Qualitative Analysis of Secured Outcome Regions for Two-Target Games. In: Journal of Optimization Theory and Applications, 68 (2). pp. 233-255.

Ghose, D and Prasad, UR (1991) Solution concepts in continuous-kernel multicriteria games. In: Journal of Optimization Theory and Applications, 69 (3). pp. 543-553.

Ghose, D and Prasad, UR (1989) Solution concepts in two-person multicriteria games. In: Journal of Optimization Theory and Applications, 63 (2). pp. 167-189.

Ghose, D and Prasad, UR and Guruprasad, K (1993) Missile battery placement for air defense: A dynamic programming approach. In: Applied Mathematical Modelling, 17 (9). pp. 450-458.

Ghosh, Ashish and Das, Mrinal Kanti (2008) Non-dominated Rank based Sorting Genetic Algorithms. In: Fundamenta Informaticae, 83 (3). pp. 231-252.

Ghosh, A and Kumar, H and Sastry, PS (2017) Robust loss functions under label noise for deep neural networks. In: 31st AAAI Conference on Artificial Intelligence, AAAI 2017, 4 - 10 February 2017, San Francisco, pp. 1919-1925.

Ghosh, S and Gupta, S and Li, L (2024) Bisimulation in model-changing modal logics: An algorithmic study. In: Journal of Logic and Computation, 34 (2). pp. 399-427.

Ghosh, Subir Kumar and Maheshwari, Anil and Pal, Sudebkumar Prasant and Saluja, Sanjeev and Madhavan, Veni CE (1993) Characterizing and recognizing weak visibility polygons. In: Computational Geometry, 3 (4). pp. 213-233.

Ghoshal, S and Louis, A (2022) Approximating CSPs with Outliers. In: 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022, 19 - 21 September 2022, Virtual, Urbana-Champaign.

Ghoshal, S and Louis, A and Raychaudhury, R (2019) Approximation algorithms for partially colorable graphs. In: 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019, 20 - 22 September 2019, Cambridge.

Ghoshdastidar, Debarghya and Adsul, Ajay P and Dukkipati, Ambedkar (2016) Learning With Jensen-Tsallis Kernels. In: IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 27 (10). pp. 2108-2119.

Ghoshdastidar, Debarghya and Dukkipati, Ambedkar (2017) CONSISTENCY OF SPECTRAL HYPERGRAPH PARTITIONING UNDER PLANTED PARTITION MODEL. In: ANNALS OF STATISTICS, 45 (1). pp. 289-315.

Ghoshdastidar, Debarghya and Dukkipati, Ambedkar and Adsul, Ajay P and Vijayan, Aparna S (2014) Spectral Clustering with Jensen-type kernels and their multi-point extensions. In: 27th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), JUN 23-28, 2014, Columbus, OH, pp. 1472-1477.

Ghoshdastidar, Debarghya and Dukkipati, Ambedkar and Bhatnagar, Shalabh (2014) Newton-based stochastic optimization using q-Gaussian smoothed functional algorithms. In: AUTOMATICA, 50 (10). pp. 2606-2614.

Ghoshdastidar, Debarghya and Dukkipati, Ambedkar and Bhatnagar, Shalabh (2014) Smoothed Functional Algorithms for Stochastic Optimization Using q-Gaussian Distributions. In: ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 24 (3).

Ghoshdastidar, Debarghya and Dukkipati, Ambedkar and Bhatnagar, Shalabh (2012) q-Gaussian based Smoothed Functional Algorithms for Stochastic Optimization. In: IEEE International Symposium on Information Theory, JUL 01-06, 2012 , Cambridge, MA .

Gibbons, AN and Srikant, YN (1989) A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation. In: Information Processing Letters, 32 (6). pp. 305-311.

Gilesh, MP and Hansdah, RC (2011) An adaptive reliable transport protocol based on automatic reSend reQuest(ASQ) technique for wireless sensor networks. In: 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications (WAINA), 22-25 March 2011, Biopolis.

Girish, BC and Govindarajan, R (2008) Improving Performance of Result Caches in Network Processors. In: HiPC'08 Proceedings of the 15th international conference on High performance computing, Berlin, Heidelberg.

Gondane, Rajhans and Devi, Susheela V (2015) Classification using Probabilistic Random Forest. In: IEEE Symposium Series Computational Intelligence, DEC 07-10, 2015, Cape Town, SOUTH AFRICA, pp. 174-179.

Gopal, B and Manohar, S (1994) VLSI architecture for the Winograd Fourier Transform algorithm. In: Microprocessing & Microprogramming, 40 (9). pp. 605-616.

Gopal, Kalyani and Sarma, VVS (2006) Power System Fault Diagnosis using Belief Networks. In: National Conference on Computational Intelligence to Emerging Power Systems,, September 2006, Pondicherry.

Gopal , Kalyani and Sarma, VVS (2006) Requirements for Decision Support in Knowledge-based operation of Southern Power Grid in India. In: IEEE Conf. on Power Technology,, February 2006, New Delhi.

Gopalakrishna, V and Viswanadham, N and Pattipati, KR (1994) Sensitivity Analysis of Failure-prone Flexible Manufacturing Systems. In: 1994 IEEE International Conference on Robotics and Automation, 1994. Proceedings, 8-13 May 1994, San Diego, CA, USA, Vol.1, 181-186.

Gopalakrishna, V and Viswanadham, N (1995) Simulation based performability analysis of flexible manufacturing systems. In: 3rd International Conference on Computer Integrated Manufacturing, 11-14 July 1995, Singapore, Vol.2, 861-868.

Gopalakrishna, V and Viswanadham, N and Pattipati, Krishna R (1994) Sensitivity Analysis of Failure-prone Fexible Manufacturing Systems. In: 1994 IEEE International Conference on Robotics and Automation, 8-13 May, San Diego,CA, vol.1, 181 -186.

Gopalakrishnan, M and Patnaik, LM (1986) Integrating voice and data on SALAN: an experimental local area network. In: Computer Communications, 9 (4). pp. 186-194.

Gopalakrishnan, M and Patnaik, LM (1988) Medium access control schemes for local area networks with multiple priority function. In: Computer Journal, The, 31 (3). pp. 209-219.

Gopalakrishnan, M and Patnaik, LM (1984) Salan: A microprocessor-based medium speed experimental local area network. In: Interfaces in Computing, 2 (3). pp. 229-240.

Gopi, Meenakshi Sundaram and Manohar, Swami (1994) VLSI architectures for the computation of uniform B-spline curves. In: Microprocessing & Microprogramming, 40 (9). pp. 617-626.

Gopi, Meenaxhi Sundaram and Swami, Manohar (1995) A Parallel Architecture for the Computation of Uniform Rational B-Spline Patches. In: Journal of Parallel and Distributed Computing, 30 (1). pp. 91-98.

Gopinath, K and Muppalaneni, N and Kumar, NS and Risbood, P (2000) A 3-tier RAID storage system with RAID1, RAID5 and compressed RAID5 for Linux. In: Proceedings of the FREENIX Track. 2000 USENIX Annual Technical Conference, 18-23 June 2000, San Diego, CA, USA, pp. 21-34.

Gopinath, K and Nandakumar, KS (1999) Combining conditional constant propagation and interprocedural alias analysis. In: Proceedings of 6th International Conference on High Performance Computing (HiPC'99) - Mobile Computing for this Millenium, 17-20 Dec. 1999, Calcutta, India, pp. 13-20.

Gopinath, K and Rao, Manohara R (1994) Verification of the DASH cache consistency protocols. In: Computer Systems and Education. Proceedings of the International Conference on Computer Systems and Education in Honour of Prof. V. Rajaraman, 22-25 June 1994, Bangalore, India, pp. 16-31.

Gopinath, K (2006) Access Control in Communication Systems. In: First International Conference on Communication System Software and Middleware, 2006. Comsware 2006., 2006, New Delhi .

Gopinath, K and Bhutkar, Aniruddha P (1996) Program Analysis for Page Size Selection. In: 3rd International Conference on High Performance Computing, 1996, 19-22 December, Trivandrum,India, 189 -194.

Gopinath, K and Narasimhan, KMK and Lim, BH and Agarwal, A (1994) Performance of switch blocking on multithreaded architectures. In: of 23rd Annual International Conference on Parallel Processing, 15-19 Aug. 1994, Raleigh, NC, USA, pp. 275-284.

Gopinath, K and Pugalia, Anil K and Naidu, KVM (2004) Formal Proof of Impossibility of Reliability in Crashing Protocols. In: 6th International Workshop on Distributed Computing:IWDC 2004 (Lecture Notes in Computer Science), December 27-30, 2004, Kolkata, India, Vol.3326, 347-352.

Gopinath, K and Seshadri, R (1997) Alias Analysis for Fortran90 Array Slices. In: 11th International Parallel Processing Symposium, 1997, 1-5 April, Genva, 628 -632.

Gopinath, KN and Bhagwat, Pravin and Gopinath, K (2006) An Empirical Analysis of Heterogeneity in IEEE 802.11 MAC Protocol Implementations and its Implications. In: WiNTECH '06 Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation & characterization , Sep'2006, Los Angeles.

Gopinathan, Madhu and Rajamani, Sriram K (2008) Runtime Monitoring of Object Invariants with Guarantee. [Book Chapter]

Gopinathan, Madhu and Rajamani, Sriram K (2008) Enforcing Object Protocols by Combining Static and Runtime Analysis. In: ACM Singplan Notice, 43 (10). pp. 245-260.

Gorantla, S and Bhansali, E and Deshpande, A and Louis, A (2024) Optimizing Learning-to-Rank Models for Ex-Post Fair Relevance. In: 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2024, 14 July 2024through 18 July 2024, Washington, USA, pp. 1525-1534.

Gorantla, S and Deshpande, A and Louis, A (2023) Sampling Ex-Post Group-Fair Rankings. In: International Joint Conference on Artificial Intelligence, IJCAI 2023, 19-25 August 2023, Macao, pp. 409-417.

Gorantla, S and Gowda, KN and Deshpande, A and Louis, A (2023) Socially Fair Center-Based and Linear Subspace Clustering. In: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2023, 18-22 September 2023, Turin, pp. 727-742.

Goswami, AK and Patnaik, LM (1984) Functional programming systems revisited. In: Lecture Notes in Computer Science, 181 . pp. 44-59.

Goswami, AK and Patnaik, LM (1990) A functional style of programming with CSP-like communication mechanisms. In: New Generation Computing, 7 (4). pp. 341-364.

Goswami, Prashant and Srividya, * (1996) A novel neural network design for long range prediction of rainfall pattern. In: Current Science (Bangalore), 70 (6). pp. 447-457.

Govind, S and Govindarajan, R and Kuri, Joy (2007) Packet Reordering in Network Processors. In: IEEE International Parallel and Distributed Processing Symposium, 2007. IPDPS 2007., 26-30 March 2007 , Long Beach, CA.

Govindarajan, R and Kumar, R and Kumar, D and Patnaik, LM (1989) PROMIDS: A PROtotype multi-rIng data flow system for functional programming languages. In: Microprocessing and Microprogramming, 26 (3). pp. 161-173.

Govindarajan, R and Altman, Erik R and Gao, Guang R (1996) A Framework for Resource-Constrained Rate-Optimal Software Pipelining. UNSPECIFIED.

Govindarajan, R and Patnaik, LM (1990) Lenient Execution and Concurrent Execution of Re-entrant Routines: Efficient Implementation in Data Flow Systems. In: Computer Journal, The, 33 (2). pp. 185-187.

Govindarajan, R and Yang, Hongbo and Amaral, JN and Zhang, Chihong and Gao, Guang R (2003) Minimum Register Instruction Sequencing to Reduce Register Spills in Out-of-Order Issue Superscalar Architectures. In: IEEE Transactions on Computers, 52 (1). pp. 4-20.

Govindarajan, S and Maheshwari, A (2020) Preface: CALDAM 2016. In: Discrete Applied Mathematics, 280 . p. 1.

Govindarajan, Sathish and Khopkar, Abhijeet (2015) On Locally Gabriel Geometric Graphs. In: GRAPHS AND COMBINATORICS, 31 (5). pp. 1437-1452.

Govindarajan, Sathish and Nivasch, Gabriel (2015) A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane. In: DISCRETE & COMPUTATIONAL GEOMETRY, 54 (3). pp. 637-646.

Gowda, K Chidananda and Krishna, G (1979) Learning with a mutualistic teacher. In: Pattern Recognition, 11 (5-6). pp. 383-390.

Gowda, Shreyank N (2017) An intelligent fibonacci approach to image steganography. In: 2017 IEEE International Symposium on Technologies for Smart Cities, TENSYMP 2017, 14 - 16 July 2017, Kochi, Kerala, pp. 1-4.

Goyal, Prachi and Kamat, Vikram and Misra, Neeldhara (2013) On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), AUG 26-30, 2013, IST Austria, Klosterneuburg, AUSTRIA, pp. 492-503.

Goyal, Prachi and Misra, Neeldhara and Panolan, Fahad and Zehavi, Meirav (2015) DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS. In: SIAM JOURNAL ON DISCRETE MATHEMATICS, 29 (4). pp. 1815-1836.

Gracious, T and Gupta, S and Kanthali, A and Castro, RM and Dukkipati, A (2021) Neural Latent Space Model for Dynamic Networks and Temporal Knowledge Graphs. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021, 2 - 9 February 2021, Virtual, Online, pp. 4054-4062.

Gudivada, Ravi Babu and Hansdah, RC (2018) Energy Efficient Secure Communication in Wireless Sensor Networks. In: 32nd IEEE International Conference on Advanced Information Networking and Applications (AINA, MAY 16-18, 2018, Krakow, POLAND, pp. 311-319.

Guha, Ashwin and Dukkipati, Ambedkar (2015) An Algorithmic Characterization of Polynomial Functions over Z(pn). In: ALGORITHMICA, 71 (1). pp. 201-218.

Guha, Ashwin and Dukkipati, Ashwin (2015) A faster algorithm for testing polynomial representability of functions over finite integer rings. In: THEORETICAL COMPUTER SCIENCE, 579 . pp. 88-99.

Guin, S and Bhatnagar, S (2023) A Policy Gradient Approach for Finite Horizon Constrained Markov Decision Processes. In: UNSPECIFIED, pp. 3353-3359.

Gujar, Sujit and Yadati, Narahari (2008) Redistribution of VCG Payments in Assignment of Heterogeneous Objects. In: 4th International Workshop on Internet and Network Economics, DEC 17-20, 2008, Shanghai, Peoples republic china, pp. 438-445.

Gujar, Sujit and Narahari, Y (2011) Redistribution Mechanisms for Assignment of Heterogeneous Objects. In: Journal of Artificial Intelligence Research (JAIR), 41 . pp. 131-154.

Gujraniya, Deepak and Murty, Narsimha M (2012) Efficient classification using phrases generated by topic models. In: 21st International Conference on Pattern Recognition (ICPR 2012), 11-15 Nov. 2012, Tsukuba, Japan.

Gulur, Nagendra and Manikantan, R and Govindarajan, Ramaswamy and Mehendale, Mahesh M (2011) Row-buffer reorganization: simultaneously improving performance and reducing energy in DRAMs. In: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT), 10-14 Oct. 2011, Galveston, TX.

Gulur, Nagendra Dwarakanath and Manikantan, R and Mehendale, Mahesh and Govindarajan, R (2012) Multiple sub-row buffers in DRAM: unlocking performance and energy improvement opportunities. In: ICS '12 Proceedings of the 26th ACM International Conference on Supercomputing, 2012, New York, NY, USA.

Gupta, A and Roy, A and Saha, A and Ray, SS (2020) Flocking of active particles in a turbulent flow. In: Physical Review Fluids, 5 (5).

Gupta, Hari S and D'Souza, Deepak and Komondoor, Raghavan and Rama, Girish M (2010) A Case Study in Matching Service Descriptions to Implementations in an Existing System. In: International Conference on Software Maintenance, SEP 12-18, 2010 , Timisoara, ROMANIA.

Gupta, N and Saha, C and Thankey, B (2023) Equivalence Test for Read-Once Arithmetic Formulas. In: 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 22-25 January 2023, Florence, Italy, pp. 4205-4272.

Gupta, N and Saha, C and Thankey, B (2020) A super-quadratic lower bound for depth four arithmetic circuits. In: Leibniz International Proceedings in Informatics, LIPIcs, 28 July - 31 July 2020, Virtual, Online.

Gupta, R and Kanade, A and Shevade, S (2019) Deep reinforcement learning for syntactic error repair in student programs. In: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 27 January - 1 February 2019, Honolulu, pp. 930-937.

Gupta, R and Kanade, A and Shevade, S (2019) Neural attribution for semantic bug-localization in student programs. In: 33rd Annual Conference on Neural Information Processing Systems, NeurIPS 2019, 8-14 December 2019, Vancouver; Canada.

Gupta, R and Pal, S and Kanade, A and Shevade, S (2017) DeepFix: Fixing Common C language errors by deep learning. In: 31st AAAI Conference on Artificial Intelligence, AAAI 2017, 4 - 10 February 2017, San Francisco, pp. 1345-1351.

Gupta, S and Dukkipati, A (2020) Winning an election: On emergent strategic communication in multi-agent networks. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 13-19 May 2020, Virtual, Auckland, pp. 1861-1863.

Gupta, S and Sharma, G and Dukkipati, A (2019) A generative model for dynamic networks with applications. In: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence,, 27 January 2019 - 1 February 2019, Honolulu, pp. 7842-7849.

Gupta, Shubham and K, Gururaj and Dukkipati, Ambedkar and Castro, Rui M (2022) Equipping SBMs with RBMs: an interpretable approach for analysis of networks with covariates. In: Journal of Complex Networks, 10 (2). ISSN 2051-1310

Gupta, VH and Gopinath, K (2007) G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage. In: Fourth International IEEE Security In Storage Workshop, 27, San Diego, pp. 22-33.

Gupta, VH and Gopinath, K (2006) An extended verifiable secret redistribution protocol for archival systems. In: 1st International Conference on Availability, Reliability and Security,, APR 20-22, 2006, Vienna, AUSTRIA, pp. 100-107.

Gutta, Sreedevi and Kadimesetty, Venkata Suryanarayana and Kalva, Sandeep Kumar and Pramanik, Manojit and Ganapathy, Sriram and Yalavarthy, Phaneendra K (2017) Deep neural network-based bandwidth enhancement of photoacoustic data. In: JOURNAL OF BIOMEDICAL OPTICS, 22 (11).

Gálvez, W and Grandoni, F and Khan, A and Ramírez-Romero, D and Wiese, A (2021) Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple L-shapes, spirals, and more. In: 37th International Symposium on Computational Geometry (SoCG 2021), June 7-11, 2021.

H

Habeeb, P and D'Souza, D and Lodaya, K and Prabhakar, P (2024) Interval Image Abstraction for Verification of Camera-Based Autonomous Systems. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 43 (11). pp. 4310-4321.

Habeeb, P and Gupta, L and Prabhakar, P (2024) Approximate Conformance Checking for Closed-Loop Systems With Neural Network Controllers. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 43 (11). pp. 4322-4333.

Hada, DV and M, V and Shevade, SK (2021) ReXPlug: Explainable Recommendation using Plug-and-Play Language Model. In: 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2021, 11-15 Jul 2021, pp. 81-91.

Hadimani, Vijayalakshmi and Hansdah, RC (2005) An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks. In: 1st International Conference on Distributed Computing and Internet Technology, DEC 22-24, 2004, Bhubaneswar, INDIA.

Haeupler, Bernhard and Kavitha, Telikepalli and Mathew, Rogers and Sen, Siddhartha (2008) Faster Algorithms for Incremental Topological Ordering.Robert Tarjan. In: ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I, Berlin, Heidelberg.

Haeupler, Bernhard and Kavitha, Telikepalli and Mathew, Rogers and Sen, Siddhartha and Tarjan, Robert E (2012) Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. In: ACM TRANSACTIONS ON ALGORITHMS, 8 (1).

Haghighi, Rezvan Ravanfar and Chatterjee, S and Tabin, Milo and Sharma, Sanjiv and Jagia, Priya and Ray, Ruma and Singh, Rishi P and Yadav, Rakesh and Sharma, Munish and Krishna, Karthik and Vani, VC and Lakshmi, R and Mandal, Susama R and Kumar, Pratik and Arava, Sudhir (2015) DECT evaluation of noncalc fied coronary artery plaque. In: MEDICAL PHYSICS, 42 (10). pp. 5945-5954.

Haldar, S and Subramanian, DK (1991) Fairness in processor scheduling in time sharing systems. In: ACM SIGOPS Operating Systems Review, 25 (1). pp. 4-18.

Haldar, Chandan and Patnaik, LM (1990) Oracle complexities for computational geometry of semi-algebraic sets and Voronoi diagrams. In: Information Processing Letters, 36 (2). pp. 95-102.

Haldar, S and Subramanian, DK (1991) A Dynamic Granularity Locking Protocol for Tree-structured Databases. In: 1991 Symposium on Applied Computing, 3-5 April, Kansas City,MO, pp. 372-380.

Haldar, S and Subramanian, DK (1988) Ring Based Termination Detection Algorithm for Distributed Computations. In: Information Processing Letters, 29 (3). pp. 149-153.

Haldar, S and Subramanian, DK (1993) An affinity-based dynamic load balancing protocol for distributed transaction processing systems. In: Performance Evaluation, 17 (1). pp. 53-71.

Hansdah, RC and Gantait, Nilanjan and Dey, Sandip (2002) A fault-tolerant distributed deadlock detection algorithm. In: Lecture Notes in Computer Science, 2571 . pp. 78-87.

Hansdah, RC and Khanna, Prashant (2006) Locant: A nature inspired location service for ad hoc networks. In: 8th International Conference on Distributed Computing and Networking,, Dec 27-30, 2006, Guwahati, India, pp. 239-244.

Hansdah, RC and Patnaik, LM (1987) Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols. In: Lecture Notes in Computer Science, 287 . 265 -281.

Hansdah, RC and Ravi, Deepak and Sidram, Sahebrao Baiger and Swain, Amulya Ratna (2010) Design and Implementation of a Flexible and Memory Efficient Operating System for Sensor Nodes. IISc-CSA-TR-2010-5.

Hansen, Kristoffer Arnsfelt and Miltersen, Peter Bro and Vinay, V (2006) Circuits on cylinders. In: Computational Complexity, 15 (1). 62 - 81.

Hansen, Kristoffer Arnsfelt and Miltersen, Peter Bro and Vinay, V (2003) Circuits on cylinders. In: Lecture Notes in Computer Science, 2751 . pp. 171-182.

Haque, I and DâSouza, D and Habeeb, P and Kundu, A and Babu, G (2020) Verification of a Generative Separation Kernel. In: 18th International Symposium on Automated Technology for Verification and Analysis, ATVA 2020, 19-23 October 2020, Hanoi; Viet Nam, pp. 305-322.

Har-Peled, S and Jones, M and Rahul, S (2020) Active learning a convex body in low dimensions. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 8-11, July 2020, Germany.

Hargreaves, E and Agosti, C and Menasché, D and Neglia, G and Reiffers-Masson, A and Altman, E (2019) Fairness in online social network timelines: Measurements, models and mechanism design. In: Performance Evaluation, 129 . pp. 15-39. ISSN 01665316

Haribabu, G.N. and Jegadeesan, J.T. and Bhattacharya, C. and Basu, B. (2023) A deep adversarial approach for the generation of synthetic titanium alloy microstructures with limited training data. In: Computational Materials Science, 230 .

Hariharan, R and Memon, KAP (1979) A Hydraulic Micromanipulator. In: IEEE Transactions on Biomedical Engineering, 26 (1). pp. 56-58.

Hariharan, R and Rao, SN (1974) Biquadratic pulse transmission networks. In: India, IEE-IERE Proceedings - , 12 (4). pp. 136-138.

Hariharan, Ramesh (1997) Optimal Parallel Suffix Tree Construction. In: Journal of Computer and System Sciences, 55 (1). pp. 44-69.

Hariharan, Ramesh (2014) Turing and animal coat patterns. In: CURRENT SCIENCE, 106 (12). pp. 1681-1686.

Hariharan, Ramesh and Bhaskar, Majumdar S (1978) Moiré Displacement Transducer for N/C Systems. In: Transactions on Instrumentation and Measurement, 27 (1). pp. 8-10.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2008) Faster Algorithms for Minimum Cycle Basis in Directed Graphs. In: SIAM JOURNAL ON COMPUTING, 38 (4). pp. 1430-1447.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2006) A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: 33rd ICALP 2006, 10 July 2006, Venice, Italy, pp. 250-261.

Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems. In: SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA.

Hariharan, Ramesh and Kulkarni, VD (1982) A Microprocessor-Based Pulse-Height Analyzer. In: IEEE Micro Magazine, 2 (3). pp. 86-91.

Hariharan, S and Shankar, Priti (2006) Evaluating the role of context in syntax directed compression of XML documents. In: Data Compression Conference, Mar 28-30, 2006, Snowbird, UT,, p. 453.

Haripriyan, HK and Srikant, YN and Shankar, Priti (1988) A compiler writing system based on affix grammars. In: Computer Languages, 13 (1). pp. 1-11.

Harish, D and Darera, Pooja N and Haritsa, Jayant R (2008) Identifying Robust Plans through Plan Diagram Reduction. In: Proc. of 34th Intl. Conf. on Very Large Data Bases (VLDB), Auckland, New Zealand, Auckland.

Harish, D and Darera, Pooja N and Haritsa, Jayant R (2007) On the Production of Anorexic Plan Diagrams. In: VLDB '07 Proceedings of the 33rd international conference on Very large data bases, September 2007.

Haritsa, Jayant R (2011) Professor Priti Shankar: In Memoriam (September 1947 – October 2011). In: (Submitted)

Haritsa, Jayant R and Sudarshan, S (2019) Turbocharging Database Query Processing and Testing. In: COMMUNICATIONS OF THE ACM, 62 (11). pp. 48-49.

Harsola, Shrutendra K and Deshpande, Prasad M and Haritsa, Jayant R (2012) IceCube: efficient targeted mining in data cubes. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), 10-December 13, Brussels, Belgium, pp. 894-899.

Hazarika, D and Poria, S and Gorantla, S and Cambria, E and Zimmermann, R and Mihalcea, R (2018) CASCADE: Contextual sarcasm detection in online discussion forums. In: 27th International Conference on Computational Linguistics, COLING 2018, 20 - 26 August 2018, Santa Fe, pp. 1837-1848.

Hazarika, Devamanyu and Gorantla, Sruthi and Poria, Soujanya and Zimmermann, Roger (2018) Self-Attentive Feature-level Fusion for Multimodal Emotion Detection. In: IEEE Conference on Multimedia Information Processing and Retrieval 2018, 10-12 April 2018, Miami, FL, USA, pp. 196-201.

Hazay, Carmit and Patra, Arpita (2017) Efficient One-Sided Adaptively Secure Computation. In: JOURNAL OF CRYPTOLOGY, 30 (1). pp. 321-371.

Heemels, W P M H and Kundu, A and Daafouz, J (2017) On Lyapunov-Metzler Inequalities and S-Procedure Characterizations for the Stabilization of Switched Linear Systems. In: IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 62 (9). pp. 4593-4597.

Hegde, A and Koti, N and Kukkala, VB and Patil, S and Patra, A and Paul, P (2022) Attaining GOD Beyond Honest Majority with Friends and Foes. In: 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2022, 5 - 9 December 2022, Taipei, pp. 556-587.

Heggernes, Pinar and van't Hof, Pim and Marx, Daniel and Misra, Neeldhara and Villanger, Yngve (2015) On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. In: ALGORITHMICA, 72 (3). pp. 687-713.

Hemachandra, N and Narahari, Y (2000) A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems. In: Queueing Systems, 36 (4). 443-461.

Holla, R and Deka, N and DSouza, D (2021) On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics. In: Leibniz International Proceedings in Informatics, LIPIcs, 213 .

Hooker, JN and Rago, G and Chandru, V and Shrivastava, A (2002) Partial instantiation methods for inference in first-order logic. In: Journal of Automated Reasoning, 28 (4). pp. 371-396.

Hoque, SJ and Kumar, P (2021) THEORETICAL ESTIMATION of MINIMUM and MAXIMUM ALLOWABLE ROTATIONAL SPEED of SUPERCRITICAL CO2 INWARD FLOW RADIAL TURBINE. In: ASME 2021 Gas Turbine India Conference, 2-3 Dec 2021, Virtual, Online.

Huang, Chien-Chung and Kavitha, Telikepalli and Michail, Dimitrios and Nasre, Meghana (2011) Bounded Unpopularity Matchings. In: Algorithmica, 61 (3). pp. 738-757.

Hughes, J and Plaut, E and Wang, F and Von Briesen, E and Brown, C and Cross, G and Kumar, V and Myers, P (2020) Global and Local Agendas of Computing Ethics Education. In: Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE, 15-06-2020, Trondheim, pp. 239-245.

I

Indrani, AV and Sarma, VVS (2007) Autonomous On-board Mission Planning in a Petri-net framework. In: Workshop on AI in Space Applications, IJCAI-2007 conference, Hyderabad, January 2007, Hyderabad.

Indrani, AV and Sarma, VVS (2007) Knowledge modeling using Petri nets for autonomous on-board mission-planning. In: CASST 2007 Conference on Advances in Space Science & technology, IISc., Bangalore, January 29-31, 2007, Bangalore.

Ishai, Y and Patra, A and Patranabis, S and Ravi, D and Srinivasan, A (2022) Fully-Secure MPC with Minimal Trust. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7 - 10 November 2022, Chicago, pp. 470-501.

Iyengar, SS and Parameshwaran, N and Fuller, J (1982) A measure of logical complexity of programs. In: Computer Languages, 7 (3-4). pp. 147-160.

Iyengar, SS and Wu, Hsiao-Chun and Balakrishnan, N and Chang, Shih Yu (2007) Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks. In: Systems Journal, IEEE, 1 (1). pp. 29-37.

Iyer, K Viswanathan and Patnaik, LM (1986) Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems using SIMULA. In: Computer Journal, 29 (2). 118 -126.

J

J, PK and Penubothula, S and Kamanchi, C and Bhatnagar, S (2020) Novel First Order Bayesian Optimization with an Application to Reinforcement Learning. In: Applied Intelligence .

Jadhao, Vinod and Murty, Narasimha M (2012) Hybrid online non-negative matrix factorization for clustering of documents. In: ICONIP 2012 19th International Conference, November 12-15, 2012, Doha, Qatar.

Jagadish, N and Kumar, Mohan J and Patnaik, LM (1989) An Efficient Scheme for Interprocessor Communication Using Dual-Ported RAMs. In: IEEE Micro, 9 (5). pp. 10-19.

Jagarlapudi, Saketha Nath and Ben-Tal, Aharon and Bhattacharyya, Chiranjib (2013) Robust formulations for clustering-based large-scale classification. In: Optimization and Engineering, 14 (2). pp. 225-250.

Jagatap, A and Purokayastha, S and Jain, H and Sridharan, D (2021) Neurally-constrained modeling of human gaze strategies in a change blindness task. In: PLoS Computational Biology, 17 (8).

Jaggi, Neeraj and Gopinath, K (2001) Verification of a Leader Election Algorithm in Timed Asynchronous Systems. In: 21st Conference on Foundations of Software Technology and Theoretical Computer Science, 13-15 December, 2001, pp. 207-218.

Jain, AK and Murty, MN and Flynn, PJ (1999) Data Clustering: A Review. In: ACM Computing Surveys, 31 (3). pp. 264-323.

Jain, Anoop and Sarda, Parag and Haritsa, Jayant R (2004) Providing Diversity in K-Nearest Neighbor Query Results. In: 8th Pacific-Asia Conference:PAKDD 2004(Lecture Notes in Computer Science), May 26-28, 2004, Sydney, Australia, Vol.3056, 404-413.

Jain, Divya and Lakshmi, K Vasanta and Shankar, Priti (2008) Deep Packet Inspection Using Message Passing Networks. In: Lecture Notes in Computer Science, 5230 . pp. 419-420.

Jain, Kamal Kumar and Jacob, James and Srinivas, MK (1991) ATPG With Efficient Testability Measures and Partial Fault Simulation. In: 1991 Fourth CSI/IEEE International Symposium on VLSI Design, 4-8 January, New Delhi,India, pp. 35-40.

Jain, Kamal Kumar and Rajaraman, V (1994) Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. In: IEEE Transactions on Parallel and Distributed Systems, 5 (8). pp. 879-886.

Jain, Kamal Kumar and Rajaraman, V (1994) Parallelism measures of task graphs for multiprocessors. In: Microprocessing & Microprogramming, 40 (4). pp. 249-259.

Jain, Manjari and Diwakar, Swati and Bahuleyan, Jimmy and Deb, Rittik and Balakrishnan, Rohini (2014) A rain forest dusk chorus: cacophony or sounds of silence? In: EVOLUTIONARY ECOLOGY, 28 (1). pp. 1-22.

Jain, Pradeep and Jain, Yogesh and Gopinath, K (2002) A Region Based Framework for Combined Register Allocation and Instruction Scheduling for EPIC Architectures. IISc-­CSA-­2002-­4.

Jain, Shweta and Bhat, Satyanath and Ghalme, Ganesh and Padmanabhan, Divya and Narahari, Y (2016) MECHANISMS WITH LEARNING FOR STOCHASTIC MULTI-ARMED BANDIT PROBLEMS. In: INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 47 (2). pp. 229-272.

Jain, Shweta and Gujar, Sujit and Bhat, Satyanath and Zoeter, Onno and Narahari, Y (2017) A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing. In: ARTIFICIAL INTELLIGENCE, 254 . pp. 44-63.

Jambhulkar, PJ and Maity, Soumyadev and Hansdah , Ramesh C (2013) A Multicast Authentication Protocol (MAP) for Dynamic Multicast Groups in Wireless Networks. In: International Symposium on Security in Computing and Communications (SSCC), August 22-24, Mysore, India.

Janaki Ramanan, V and Govindarajan, R (1999) Resource usage models for instruction scheduling: two new models and a classification. In: Proceedings of the 13th Association for Computer Machinery International Conference on Supercomputing, 20-25 June 1999, Rhodes, Greece, pp. 417-424.

Jangda, A and Bondhugula, U (2020) An effective fusion and tile size model for polyMage. In: ACM Transactions on Programming Languages and Systems, 42 (3).

Jangda, Abhinav and Bondhugula, Uday (2018) An Effective Fusion and Tile Size Model for Optimizing Image Processing Pipelines. In: ACM SIGPLAN NOTICES, 53 (1). pp. 261-275.

Jansen, K and Khan, A and Lira, M and Sreenivas, KVN (2022) A PTAS for Packing Hypercubes into a Knapsack. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Jasmeer, KA and Srikant, YN and Chidambara, MR (1991) A graphic simulation environment for robotics applications. In: Proceedings of the SPIE - The International Society for Optical Engineering, 2-5 Jan. 1991, Bangalore, India, pp. 654-665.

Jayadevan, Anoop and Patnaik, LM (1999) Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes. In: International Journal of High Speed Computing, 10 (1). pp. 1-17.

Jayaram, Rajeev and Patnaik, LM (1996) A Formalism to Model Task Execution in Distributed Systems. In: Information Sciences, 88 (1-4). pp. 113-129.

Jeevithashree, D and Saluja, Kamalpreet Singh and Biswas, Pradipta (2018) Gaze Controlled Interface For Limited Mobility Environment. In: Designing Interactive Systems Conference, DIS 2018., 9 - 13 June, 2018, Hong Kong, pp. 319-322.

Jethava, Vinay and Bhattacharyya, Chiranjib and Dubhashi, Devdatt and Vemuri, Goutham N (2011) NETGEM: Network Embedded Temporal GEnerative Model for gene expression data. In: BMC Bioinformatics, 12 .

Jethava, Vinay and Calderón-Benavides, Liliana and Baeza-Yates, Ricardo and Bhattacharyya, Chiranjib and Dubhashi, Devdatt (2011) Scalable multi-dimensional user intent identification using tree structured distributions. In: SIGIR '11 Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval, 2011, New York, NY, USA.

Jethava, Vinay and Martinsson, Anders and Bhattacharyya, Chiranjib and Dubhashi, Devdatt (2013) Lovasz theta function, SVMs and Finding Dense Subgraphs. In: JOURNAL OF MACHINE LEARNING RESEARCH, 14 . pp. 3495-3536.

Jethava, Vinay and Martinsson, Anders and Bhattacharyya, Chiranjib and Dubhashi, Devdatt (2012) The Lovasz θ function, SVMs and finding large dense subgraphs. In: Neural Information Processing Systems (NIPS) 2012, December 03, 2012, Nevada, United States.

Jillani, Rashad and Kalva, Hari and Joshi, Urvang and Bhattacharya, Chiranjib and Ramakrishnan, RK (2010) Video coding mode decision as a classification problem. In: Visual Information Processing and Communication, Tuesday 19 January 2010, San Jose, California, USA.

John, I and Bhatnagar, S (2020) Deep Reinforcement Learning with Successive Over-Relaxation and its Application in Autoscaling Cloud Resources. In: Proceedings of the International Joint Conference on Neural Networks, 19-24 July 2020, Virtual, Glasgow.

John, I and Kamanchi, C and Bhatnagar, S (2020) Generalized Speedy Q-Learning. In: IEEE Control Systems Letters, 4 (3). pp. 524-529.

John, I and Karumanchi, R and Bhatnagar, S (2019) Predictive and prescriptive analytics for performance optimization: Framework and a case study on a large-scale enterprise system. In: Proceedings-18th IEEE International Conference on Machine Learning and Applications, ICMLA 2019, 16-19, December 2019, United States, pp. 876-881.

John, I and Sreekantan, A and Bhatnagar, S (2019) Auto-scaling Resources for Cloud Applications using Reinforcement learning. In: 2019 Grace Hopper Celebration India (GHCI), 6-8 Nov. 2019, Bangalore, India.

John, I and Sreekantan, A and Bhatnagar, S (2019) Efficient adaptive resource provisioning for cloud applications using reinforcement learning. In: 4th IEEE International Workshops on Foundations and Applications of Self* Systems, FAS*W 2019, 16 June 2019 - 20 June 2019, Umea, pp. 271-272.

Joseph, A and Yadav, N and Ganapathy, V and Behl, D (2023) A Contributory Public-Event Recording and Querying System. In: UNSPECIFIED, pp. 185-198.

Joseph, A and Yadav, N and Ganapathy, V and Behl, D and Jayachandran, P (2023) Data Protection in Permissioned Blockchains using Privilege Separation. In: 5th International Conference on COMmunication Systems and NETworkS, COMSNETS 2023, 3-8 January 2023, Bangalore, pp. 748-756.

Joseph, AG and Bhatnagar, S (2019) An Adaptive Sampling Algorithm for Policy Evaluation. In: 5th Indian Control Conference, ICC 2019, 9 January 2019- 11 January 2019, Delhi, pp. 2-7.

Joseph, AG and Bhatnagar, S (2019) An Incremental Algorithm for Estimating Extreme Quantiles. In: 2019 Sixth Indian Control Conference (ICC)Proceedings, 18-20 Dec. 2019, Hyderabad, India, pp. 286-291.

Joseph, AG and Bhatnagar, S (2019) Stochastic Approximation Trackers for Model-Based Search. In: 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019, 24 -27 September 2019, Monticello, IL, USA, USA, pp. 741-748.

Joseph, AW and Jeevitha Shree, DV and Saluja, KPS and Mukhopadhyay, A and Murugesh, R and Biswas, P (2021) Eye Tracking to Understand Impact of Aging on Mobile Phone Applications. In: Smart Innovation, Systems and Technologies, 7 January - 10 January 2021, Virtual, Online, pp. 315-326.

Joseph, Ajin George and Bhatnagar, Shalabh (2017) An Incremental Fast Policy Search Using a Single Sample Path. In: PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2017, DEC 05-08, 2017, Kolkata, INDIA, pp. 3-10.

Joseph, Ajin George and Bhatnagar, Shalabh (2016) A RANDOMIZED ALGORITHM FOR CONTINUOUS OPTIMIZATION. In: Winter Simulation Conference (WSC), DEC 11-14, 2016, Arlington, VA, pp. 907-918.

Joseph, Ajin George and Bhatnagar, Shalabh (2016) Revisiting the Cross Entropy Method with Applications in Stochastic Global Optimization and Reinforcement Learning. In: 22nd European Conference on Artificial Intelligence (ECAI), AUG 29-SEP 02, 2016, Hague, NETHERLANDS, pp. 1026-1034.

Joseph, Ajin George and Bhatnagar, Shalabh (2016) A Stochastic Approximation Algorithm for Quantile Estimation. In: 22nd International Conference on Neural Information Processing (ICONIP), NOV 09-12, 2015, Istanbul, TURKEY, pp. 311-319.

Joseph, Ajin George and Bhatnagar, Shalabh (2018) An incremental off-policy search in a model-free Markov decision process using a single sample path. In: MACHINE LEARNING, 107 (6). pp. 969-1011.

Joseph, Ajin George and Bhatnagar, Shalabh (2018) An online prediction algorithm for reinforcement learning with linear function approximation using cross entropy method. In: MACHINE LEARNING, 107 (8-10, ). pp. 1385-1429.

Joseph, FC and Gurrala, G (2022) Homotopy Based Error Estimator for Adaptive Modified Euler in Transient Stability Simulations. In: 2022 IEEE International Conference on Electrical, Computer, and Energy Technologies, ICECET 2022, 20 July - 22 July 2022, Prague.

Joseph, PJ and Jacob, Matthew T (2003) Analysis of Control Flow Patterns in the Execution of SPEC CPU2000 Benchmark Programs. In: Conference on Convergent Technologies for the Asia-Pacific Region: IEEE TENCON 2003, 15-17 October, 2003, Bangalore, India, Vol.3 1143-1147.

Joseph, PJ and Vajapeyam, Sriram (1996) Program-Level Control of Network Delay for Parallel Asynchronous Iterative Applications. In: 3rd International Conference on High Performance Computing, 1996, 19-22 December, Trivandrum,India, pp. 88-93.

Joseph, PJ and Vaswani, Kapil and Thazhuthaveetil, Matthew J (2006) Construction and use of linear regression models for processor performance analysis. In: 12th International Symposium on High-Performance Computer Architecture,, Feb 11-15, 2006, Austin,TX,, pp. 99-108.

Joseph, PJ and Vaswani, Kapil and Thazhuthaveetil, Matthew J (2006) A Predictive Perfomance Model for Superscalar Processors. In: 39th Annual IEEE/ACM International Symposium on Microarchitecture, 2006. MICRO-39., Dec. 2006 , Orlando, FL .

Joshi, K and Yogananda, CS (1999) A remark on product of Dirichlet L-functions. In: Acta Arithmetica, 91 (4). pp. 325-327.

Joshi, U and Rahul, S and Thoppil, JJ (2022) A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. In: Leibniz International Proceedings in Informatics, LIPIcs, 18 - 20 December 2022, Chennai.

Joshi, Urvang and Jillani, Rashad and Bhattacharya, Chiranjib and Kalva, Hari and Ramakrishnan, KR (2010) Speedup Macroblock Mode Decision in H.264/SVC Encoding Using Cost-Sensitive Learning. In: IEEE International Conference on Consumer Electronics, JAN 09-13, 2010 , Las Vegas, NV.

K

Kadlag, Abhijit and Wanjari, Amol V and Freire, Juliana and Haritsa, Jayant R (2004) Supporting Exploratory Queries in Databases. In: 9th International Conference on Database Systems for Advanced Applications:DASFAA 2004(Lecture Notes in Computer Science), 17-19 March, Jeju Island, Korea, Vol.2973, 594-605.

Kakkar, Vishal and Shevade, Shirish and Sundararajan, S and Garg, Dinesh (2017) A Sparse Nonlinear Classifier Design Using AUC Optimization. In: 17th SIAM International Conference on Data Mining, SDM 2017, 27 - 29 April 2017, Houston, pp. 291-299.

Kaleeswaran, Shalini and Santhiar, Anirudh and Kanade, Aditya and Gulwani, Sumit (2016) Semi-supervised Verified Feedback Generation. In: 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), NOV 13-18, 2016, Seattle, WA, pp. 739-750.

Kamakshidasan, A and Natarajan, V (2021) Mergemaps: Treemaps for Scientific Data. In: 8th Workshop on Topological Methods in Data Analysis and Visualization, TopoInVis 2019, 17 - 19 June 2019, Nyköping, pp. 19-38.

Kamanchi, C and Diddigi, RB and Prabuchandran, KJ and Bhatnagar, S (2019) An Online Sample-Based Method for Mode Estimation Using ODE Analysis of Stochastic Approximation Algorithms. In: IEEE Control Systems Letters, 3 (3). pp. 697-702.

Kamat, Vikram and Misra, Neeldhara (2015) Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. In: 9th International Conference on Algorithms and Complexity (CIAC), MAY 20-22, 2015, Univ Paris Dauphine, Paris, FRANCE, pp. 249-260.

Kamath, AK and Basu, A (2021) IGUARD: In-GPU Advanced Race Detection. In: 28th ACM Symposium on Operating Systems Principles, SOSP 2021, 26-29 Oct 2021, pp. 49-65.

Kamath, AK and George, AA and Basu, A (2020) ScoRD: A Scoped Race Detector for GPUs. In: Proceedings - International Symposium on Computer Architecture, 30 May-3 June 2020, Virtual, Online; Spain, pp. 1036-1049.

Kameshwaran, S and Narahar, Y (2003) e-Procurement using goal programming. In: E Commerce and Web Technologies Proceedings, 2738 . 06-15.

Kameshwaran, S and Narahari, Y (2009) Nonconvex piecewise linear knapsack problems. In: European Journal Of Operational Research, 192 (1). pp. 56-68.

Kameshwaran, S and Narahari, Y (2002) A new approach to the design of electronic exchanges. In: Lecture Notes in Computer Science, 2455 . 27-36 .

Kameshwaran, S and Narahari, Y and Rosa, Charles H and Kulkarni, Devadatta M and Tew, Jeffrey D (2007) Multiattribute electronic procurement using goal programming. In: European Journal of Operational Research, 179 (2). pp. 518-536.

Kameshwari, R and Gopinath, K (2003) Space & Compute Requirements of PPM* for Migration within the Secondary Storage. In: Conference on Convergent Technologies for the Asia-Pacific Region: IEEE TENCON 2003, 15-17 October, 2003, Bangalore, India, Vol.3 1167-1171.

Kanade, A and Maniatis, P and Balakrishnan, G and Shi, K (2020) Learning and Evaluating Contextual Embedding of Source Code. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, pp. 5066-5077.

Kanade, Aditya (2019) Event-Based Concurrency: Applications, Abstractions, and Analyses. In: ADVANCES IN COMPUTERS, 112 . pp. 379-412.

Kanchana, B and Sarma, VVS (1999) Software Quality Enhancement Through Software Process Optimization Using Taguchi Methods. In: IEEE Conference and Workshop on Engineering of Computer-Based Systems, 1999. ECBS '99, 7-12 March, Nashville,Tennessee, 188 -193.

Kancherla, Bhargava K and Narayan, Ganesh M and Gopinath, K (2007) Performance Evaluation of Multiple TCP connections in iSCSI. In: 24th IEEE Conference on Mass Storage Systems and Technologies, September 2007, San Diego, California, USA, 239 -244.

Kandasamy, S and Bhattacharyya, A and Honavar, VG (2019) Minimum intervention cover of a causal graph. In: Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 27 January - 1 February 2019, Hilton Hawaii Village Honolulu; United States, pp. 2876-2885.

Kande, NA and Dakhane, R and Dukkipati, A and Yalavarthy, PK (2021) SiameseGAN: A Generative Model for Denoising of Spectral Domain Optical Coherence Tomography Images. In: IEEE Transactions on Medical Imaging, 40 (1). pp. 180-192.

Kankanala, Laxmi and Narasimha Murty, M (2007) Hybrid approaches for clustering. In: Proceedings of Pattern Recognition and Machine Intelligence (PREMI 2007), Lecture Notes in Computer Science, LNCS 4815, Springer.

Kannan, R and Venkateswaran, H and Vinay, V and Yao, AC (1993) A Circuit-Based Proof of Toda′s Theorem. In: Information and Computation, 104 (2). pp. 271-276.

Kannan, Ramakrishnan and Garg, Dinesh and Subbian, Karthik and Narahari, Y (2008) A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids. In: 4th IEEE Conference on Automation Science and Engineering Key Bridge Marriott, Washington DC, USA, 23-26 Aug. 2008, Arlington, VA .

Kanukurthi, B and Bhavana Obbattu, SL and Sekar, S and Tomy, J (2021) Locally reconstructable non-malleable secret sharing. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021, 23 - 26 July 2021, Virtual, Bertinoro.

Kanukurthi, B and Obbattu, SLB and Sekar, S (2018) Non-malleable randomness encoders and their applications. In: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018, 29 April 2018 through 3 May 2018, Tel Aviv, pp. 589-617.

Kanukurthi, Bhavana and Obbattu, Sai Lakshmi Bhavana and Sekar, Sruthi (2019) Four-State Non-malleable Codes with Explicit Constant Rate. In: JOURNAL OF CRYPTOLOGY .

Kapaleaswaran, TN and Rajaraman, V (1990) Parallel search methods of a document database in a distributed computer system: a case study. In: Journal of Information Science, 16 (5). pp. 291-298.

Kapoor, S and Ramesh, H (2000) An Algorithm for enumerating All Spanning Trees of a Directed Graph. In: Algorithmica, 27 (2). pp. 120-130.

Kar, D and Khan, A and Wiese, A (2022) Approximation Algorithms for Round-UFP and Round-SAP. In: 30th Annual European Symposium on Algorithms, ESA 2022, 5 - 9 September 2022, Berlin/Potsdam.

Karmakar, Prasenjit and Bhatnagar, Shalabh (2018) Two Time-Scale Stochastic Approximation with Controlled Markov Noise and Off-Policy Temporal-Difference Learning. In: MATHEMATICS OF OPERATIONS RESEARCH, 43 (1). pp. 130-151.

Karmeshu, * and Bhatnagar, Shalabh and Mishra, Vivek Kumar (2011) An Optimized SDE Model for Slotted Aloha. In: IEEE Transactions on Communications, 59 (6). pp. 1502-1508.

Karmeshu, Karmeshu and Patel, Sanjeev and Bhatnagar, Shalabh (2017) Adaptive mean queue size and its rate of change: queue management with random dropping. In: Telecommunication Systems, 65 (2). pp. 281-295. ISSN 1018-4864

Karnik, Aditya and Dayama, Pankaj (2015) Optimal Scheduling of Campaigns on On-line Forums. In: IEEE International Conference on Automation Science and Engineering (CASE), AUG 24-28, 2015, Gothenburg, SWEDEN, pp. 775-780.

Karthik, S and Haritsa, JR and Kenkre, S and Pandit, V (2018) A concave path to lowoverhead robust query processing. In: 44th International Conference on Very Large Data Bases, VLDB 2018, 27 - 31 August 2018, Rio de Janeiro, pp. 2183-2195.

Karthik, S and Haritsa, JR and Kenkre, S and Pandit, V and Krishnan, L (2019) Platform-Independent Robust Query Processing. In: IEEE Transactions on Knowledge and Data Engineering, 31 (1). pp. 17-31.

Karumanchi, SH and Diddigi, RB and Prabuchandran, KJ and Bhatnagar, S (2023) Autonomous UAV Navigation in Complex Environments using Human Feedback. In: UNSPECIFIED, pp. 499-506.

Kasinikota, Anusha and Balamurugan, P and Shevade, Shirish (2018) Modeling Label Interactions in Multi-label Classification: A Multi-structure SVM Perspective. In: 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), JUN 03-06, 2018, Deakin Univ, Melbourne, AUSTRALIA, pp. 43-55.

Katti, SK (1983) Pole placement in multi-input systems via elementary transformations. In: International Journal of Control, 37 (2). pp. 315-347.

Katti, SK (1983) Pole placement in multi-input systems via elementary transformations. In: International Journal of Control, 37 (2). pp. 315-347.

Katti, S and Narasimhamurthy, M and Krishna, G (1986) On the sufficient conditions for the equality of the unassignable polynomial and Davison's fixed polynomial of strongly connected systems. In: IEEE Transactions on Automatic Control, 31 (5). 443-445.

Katti, SK (1982) Comments on "Decentralization, Stabilization, and Estimation of Large Scale Linear Systems". In: IEEE Transactions on Automatic Control, 27 (3). pp. 747-748.

Katti, SK (1981) Comments on a decentralized control of linear multivariable systems. In: Automatica, 17 (4). p. 665.

Katti, SK (1981) Decentralized control of linear multivariable systems. In: Automatica, 17 (4). p. 665.

Kavitha, T (2005) An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph. In: 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), JUL 11-15, 2005, Lisbon, PORTUGAL.

Kavitha, Telikepalli (2008) Dynamic matrix rank with partial lookahead. In: Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008, 05.12.2008.

Kavitha, Telikepalli (2007) Faster algorithms for all-pairs small stretch distances in weighted graphs. In: Proceedings of Foundations of Software Software Technology and Theoretical Computer Science FSTTCS 2007.

Kavitha, Telikepalli (2007) Linear time algorithms for Abelian group isomorphism and related problems. In: Journal of Computer and System Sciences, 73 (6). pp. 986-996.

Kavitha, Telikepalli (2008) On a Special Co-cycle Basis of Graphs. In: 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), JUL 02-04, 2008, Gothenburg.

Kavitha, Telikepalli (2005) An $\~{O}(m^2n)$ randomized algorithm to compute a minimum cycle basis of a directed graph. In: ICALP, Jul 11-15 2005, Lisbon, Portugal, pp. 273-284.

Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Algorithms to Compute Minimum Cycle Basis in Directed Graphs. In: Theory of Computing Systems, 40 (4). pp. 485-505.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2011) New Approximation Algorithms for Minimum Cycle Bases of Graphs. In: Algorithmica, 59 (4). pp. 471-488.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2007) New approximation algorithms for minimum cycle bases of graphs. In: 24th Annual Symposium on Theoretical Aspects of Computer Science, FEB 22-24, 2007, Aachen.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E (2008) An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs. In: Algorithmica, 52 (3). pp. 333-349.

Kavitha, Telikepalli and Mestre, Julian (2009) Max-Coloring Paths: Tight Bounds and Extensions. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), DEC 16-18, 2009, Honolulu, pp. 87-96.

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2009) Popular Mixed Matchings. [Book Chapter]

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2011) Popular mixed matchings. In: Theoretical Computer Science, 412 (24). pp. 2679-2690.

Kavitha, Telikepalli and Nasre, Meghana (2009) Optimal popular matchings. In: Discrete Applied Mathematics, 157 (14). pp. 3181-3186.

Kavitha, Telikepalli and Nasre, Meghana (2009) Popular Matchings with Variable Job Capacities. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), DEC 16-18, 2009, Honolulu, pp. 423-433.

Kavitha, Telikepalli and Nasre, Meghana (2011) Popular matchings with variable item copies. In: Theoretical Computer Science, 412 (12-14). pp. 1263-1274.

Kavitha, Telikepalli and Shah, Chintan D (2006) Efficient algorithms for weighted rank-maximal matchings and related problems. [Book Chapter]

Kayal, N and Nair, V and Saha, C (2020) Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits. In: ACM Transactions on Computation Theory, 12 (1).

Kayal, N and Nair, V and Saha, C and Tavenas, S (2017) Reconstruction of full rank algebraic branching programs. In: Leibniz International Proceedings in Informatics, LIPIcs, 79 (1).

Kayal, N and Nair, V and Saha, C and Tavenas, S (2018) Reconstruction of full rank algebraic branching programs. In: ACM Transactions on Computation Theory, 11 (1).

Kayal, N and Saha, C and Tavenas, S (2018) On the size of homogeneous and of depth-four formulas with low individual degree. In: Theory of Computing, 14 .

Kayal, Neeraj and Koiran, Pascal and Pecatte, Timothee and Saha, Chandan (2015) Lower Bounds for Sums of Powers of Low Degree Univariates. In: 42nd International Colloquium on Automata, Languages and Programming (ICALP), JUL 06-10, 2015, Kyoto, JAPAN, pp. 810-821.

Kayal, Neeraj and Limaye, Nutan and Saha, Chandan and Srinivasan, Srikanth (2017) AN EXPONENTIAL LOWER BOUND FOR HOMOGENEOUS DEPTH FOUR ARITHMETIC FORMULAS. In: SIAM JOURNAL ON COMPUTING, 46 (1, SI). pp. 307-335.

Kayal, Neeraj and Limaye, Nutan and Saha, Chandan and Srinivasan, Srikanth (2014) An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), OCT 18-21, 2014, Microsoft Res New England, Philadelphia, PA, pp. 61-70.

Kayal, Neeraj and Nair, Vineet and Saha, Chandan (2019) Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. In: COMPUTATIONAL COMPLEXITY, 28 (4). pp. 749-828.

Kayal, Neeraj and Saha, Chandan (2016) LOWER BOUNDS FOR DEPTH-THREE ARITHMETIC CIRCUITS WITH SMALL BOTTOM FANIN. In: COMPUTATIONAL COMPLEXITY, 25 (2). pp. 419-454.

Kayal, Neeraj and Saha, Chandan (2017) Multi-k-ic Depth Three Circuit Lower Bound. In: THEORY OF COMPUTING SYSTEMS, 61 (4, SI). pp. 1237-1251.

Kayal, Neeraj and Saha, Chandan and Tavenas, Sebastien (2018) On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. In: THEORY OF COMPUTING, 14 .

Keerthi, SS and Sridharan, K (1991) Measures of intensity of collision between convex objects and their efficient computation. In: Proceedings of the SPIE - The International Society for Optical Engineering, 2-5 Jan. 1991, Bangalore, India, pp. 266-275.

Keerthi, S and Ravindran, B (1994) A tutorial survey of reinforcement learning. In: Sadhana : academy proceedings in engineering sciences, 19 (Part 6). 851 -889.

Keerthi, SS and Duan, KB and Shevade, SK and Poo, AN (2005) A fast dual algorithm for kernel logistic regression. In: Machine Learning, 61 (1-3). pp. 151-165.

Keerthi, SS and Ong, CJ and Huang, E and Gilbert, EG (1999) EquiDistance Diagram - A New Roadmap Method for Path Planning. In: 1999 IEEE International Conference on Robotics and Automation, 10-15 May, Detroit,Michigan, Vol.1, 682-687.

Keerthi, SS and Sancheti, NK and Dattasharma, A (1992) Transversality theorem : A Useful Tool for Establishing Genericity. In: 31st IEEE Conference on Decision and Control, 1992, 16-18 December, Tucson, AZ, Vol.1, 96-101.

Keerthi, SS and Shevade, SK and Bhattacharyya, C and Murthy, KRK (2000) A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design. In: IEEE Transactions on Neural Networks, 11 (1). pp. 124-136.

Keerthi, SS and Shevade, SK and Bhattacharyya, C and Murthy, KRK (2001) Improvements to Platt's SMO algorithm for SVM classifier design. In: Neural Computation, 13 (3). pp. 637-649.

Keerthi, SS and Sridharan, K (1990) Solution of parametrized linear inequalities by fourier elimination and its applications. In: Journal of Optimization Theory and Applications, 65 (1). pp. 161-169.

Keerthi, SS and Sudarsan, R and Sancheti, NK (1992) A New Approach to the Numerical Solution of Constrained Mechanical System Dynamics. In: IEEE International Conference on Robotics and Automation, 1992., 12-14 May, Nice,France, Vol.1, 293 -298.

Keerthi, Sathiya S and Phatak, Makarand S (1995) Regional Pole Placement of Multivariable Systems Under Control Structure Constraints. In: IEEE Transactions on Automatic Control, 40 (2). pp. 272-276.

Keerthi, Sathiya S and Shevade, Shirish (2007) A Fast Tracking Algorithm for Generalized LARS/LASSO. In: IEEE Transactions on Neural Networks, 18 (6). pp. 1826-1830.

Keerthi , SS and Gilbert, EG (1988) Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations. In: Journal of Optimization Theory and Applications, 57 (2). 265 -293.

Keerthikumar, Shivakumar and Bhadra, Sahely and Kandasamy, Kumaran and Raju, Rajesh and Ramachandra, YL and Bhattacharyya, Chiranjib and Imai, Kohsuke and Ohara, Osamu and Mohan, Sujatha and Pandey, Akhilesh (2009) Prediction of Candidate Primary Immunodeficiency Disease Genes Using a Support Vector Machine Learning Approach. In: DNA Research, 16 (6). pp. 345-351.

Keerthikumar, Shivakumar and Raju, Rajesh and Kandasamy, Kumaran and Hijikata, Atsushi and Ramabadran, Subhashri and Balakrishnan, Lavanya and Ahmed, Mukhtar and Rani, Sandhya and Selvan, Lakshmi Dhevi N and Somanathan, Devi S and Ray, Somak and Bhattacharjee, Mitali and Gollapudi, Sashikanth and Ramachandra, YL and Bhadra, Sahely and Bhattacharyya, Chiranjib and Imai, Kohsuke and Nonoyama, Shigeaki and Kanegane, Hirokazu and Miyawaki, Toshio and Pandey, Akhilesh and Ohara, Osamu and Mohan, Sujatha (2009) RAPID: Resource of Asian Primary Immunodeficiency Diseases. In: Nucleic Acids Research, 37 (Sp. Is). D863-D867.

Kesarwani, M and Kaul, A and Singh, G and Deshpande, PM and Haritsa, JR (2018) Collusion-Resistant Processing of SQL Range Predicates. In: Data Science and Engineering, 3 (4). pp. 323-340.

Kesarwani, M and Kaul, A and Singh, G and Deshpande, PM and Haritsa, JR (2018) Collusion-resistant processing of SQL range predicates. In: 23rd International Conference on Database Systems for Advanced Applications, DASFAA 2018, 21 - 24 May 2018, Gold Coast, pp. 211-227.

Khan, A and Lonkar, A and Maiti, A and Sharma, A and Wiese, A (2022) Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Khan, A and Maiti, A and Sharma, A and Wiese, A (2021) On guillotine separable packings for the two-dimensional geometric knapsack problem. In: 37th International Symposium on Computational Geometry, SoCG 2021, 7-11, June 2021, Virtual, Buffalo.

Khan, A and Pittu, MR (2020) On guillotine separability of squares and rectangles. In: Leibniz International Proceedings in Informatics, LIPIcs, 17-19 August 2020, Virtual, Online.

Khan, A and Sharma, E (2023) Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. In: Algorithmica, 85 (9). pp. 2735-2778.

Khan, A and Sharma, E (2021) Tight approximation algorithms for geometric bin packing with skewed items. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 aug 2021, Seattle.

Khan, A and Sharma, E and Sreenivas, KVN (2022) Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. In: Leibniz International Proceedings in Informatics, LIPIcs, 18 - 20 December 2022, Chennai.

Khan, A and Subramanian, A and Wiese, A (2024) A PTAS for the horizontal rectangle stabbing problem. In: Mathematical Programming .

Khanna, Munish and Chaudhary, Achint and Toofani, Abhishek and Pawar, Anil (2019) Performance Comparison of Multi-objective Algorithms for Test Case Prioritization During Web Application Testing. In: ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 44 (11). pp. 9599-9625.

Khanna, Y and Louis, A and Paul, R (2021) Independent Sets in Semi-random Hypergraphs. In: Lecture Notes in Computer Science, 9 August - 11 August 2021, Virtual, Online, pp. 528-542.

Khopkar, Abhijeet and Govindarajan, Sathish (2012) Hardness results for computing optimal locally Gabriel graphs. In: 24th Canadian Conference on Computational Geometry, August 8-10, 2012, Charlottetown, Prince Edward Island, Canada.

Khurana, K and Haritsa, JR (2020) UNMASQUE: A Hidden SQL Query Extractor. In: Proceedings of the VLDB Endowment, 13 (12). pp. 2809-2812.

Kim, Hansoo and Gopinath, K (2002) Efficient Register Allocation Through Region-based Compilation for EPIC Architectures. IISc­-CSA-­2002- ­3.

Kiran, Satya MNV and Jayram, MN and Rao, Pradeep and Nandy, SK (2003) A complexity effective communication model for behavioral modeling of signal processing applications. In: Annual ACM IEEE Design Automation Conference, June 02 - 06, 2003, Anaheim, CA, USA, pp. 412-415.

Kishore, JK and Patnaik, LM and Mani, V and Agrawal, VK (2001) Genetic programming based pattern classification with feature space partitioning. In: Information Sciences, 131 (1-4). pp. 65-86.

Kodandapani, KL (1973) Rectangular universal cellular array. In: Electronics Letters, 9 (13). pp. 286-287.

Kodandapani, KL and Setlur, RV (1975) Reed-Muller Canonical Forms in Multivalued Logic. In: IEEE Transactions on Computers, C24 (6). 628 -636.

Kodandapani, KL (1974) A Note on Easily Testable Realizations for Logic Functions. In: IEEE Transactions on Computers, C23 (3). pp. 332-333.

Kodandapani, KL and Setlur, RV (1977) A Note on Minimal Reed-Muller Canonical Forms of Switching Functions. In: IEEE Transection on Computers, 26 (3). pp. 310-313.

Kodipalli, A and Devi, S (2021) Prediction of PCOS and Mental Health Using Fuzzy Inference and SVM. In: Frontiers in Public Health, 9 .

Kodipalli, A and Devi, S and Dasar, S (2023) Semantic segmentation and classification of polycystic ovarian disease using attention UNet, Pyspark, and ensemble learning model. In: Expert Systems .

Kodipalli, A and Devi, S and Dasar, S and Ismail, T (2022) Segmentation and classification of ovarian cancer based on conditional adversarial image to image translation approach. In: Expert Systems .

Kodipalli, A and Devi, SV and Dasar, S and Ismail, T (2023) A novel variant of deep convolutional neural network for classification of ovarian tumors using CT images. In: Computers and Electrical Engineering, 109 .

Kolathaya, S (2021) PD Tracking for a Class of Underactuated Robotic Systems with Kinetic Symmetry. In: IEEE Control Systems Letters, 5 (3). pp. 809-814.

Kolavali, Sudha Rani and Bhatnagar, Shalabh (2009) Ant Colony Optimization Algorithms for Shortest Path Problems. [Book Chapter]

Kolipaka, Parikshit and Govindarajan, Sathish (2013) Two player game variant of the Erdos-Szekeres problem. In: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 15 (3). pp. 73-100.

Komondoor, R (2020) A Report on the PhD Symposium Track: ISEC 2020. In: 13th Innovations in Software Engineering Conference, 27-29 February 2020, IIITDM JabalpurJabalpur, India.

Komondoor, Raghavan (2013) Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation. In: 20th International Static Analysis Symposium (SAS), JUN 20-22, 2013, Seattle, WA, pp. 259-282.

Komondoor, Raghavan and Bhattacharya, Indrajit and D'Souza, Deepak and Kale, Sachin (2013) Using Relationships for Matching Textual Domain Models with Existing Code. In: 20th Working Conference on Reverse Engineering, OCT 14-17, 2013, Univ Koblenz, Koblenz, GERMANY, pp. 371-380.

Komondoor, Raghavan and Lakshmi, Vasanta K and Seetharam, Deva P and Balodia, Sudha (2012) Packet flow analysis in IP networks using data-flow analysis. In: ISEC '12 Proceedings of the 5th India Software Engineering Conference, Feb, 2012, Kanpur, UP, India.

Komondoor, Raghavan and Nandivada, Krishna V and Sinha, Saurabh and Field, John (2012) Identifying services from Legacy batch applications. In: ISEC '12 Proceedings of the 5th India Software Engineering Conference, Feb, 2012, Kanpur, UP, India.

Kondi, Yashvanth and Patra, Arpita (2017) Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. In: 37th Annual International Cryptology Conference (Crypto), AUG 20-24, 2017, Univ Calif, Santa Barbara, CA, pp. 188-222.

Kong, Martin and Pop, Antoniu and Pouchet, Louis-Noel and Govindarajan, R and Cohen, Albert and Sadayappan, P (2014) Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs. In: ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 11 (4).

Koriem, Samir M (1993) Composite Performance and Reliability Analysis for Hypercube Systems. In: 1993 International Conference on Parallel Processing, AUG 16-20, 1993, SYRACUSE UNIV, SYRACUSE, NY.

Koriem, Samir M and Patnaik, LM (1993) Fault-Tolerance Analysis of Hypercube Systems Using Petri Net Theory. In: Journal of Systems and Software, 21 (1). pp. 71-88.

Koriem, Samir M and Patnaik, LM (1992) Performability Studies of Hypercube Architectures. In: Sixth International Proceedings Parallel Processing Symposium, 1992, 23-26 March, Beverly Hills, CA, 488 -495.

Koriem, Samir M and Patnaik, LM (1994) Performance of the node/link behaviour of multicomputer networks with input buffer limiting and channel contention. In: Computer Communications, 17 (9). pp. 647-656.

Koriem, Samir M and Patnaik, LM (1997) A generalized stochastic high-level Petri net model for performance analysis. In: Journal of Systems and Software, 36 (3). pp. 247-265.

Koti, N and Kukkala, VB and Patra, A and Raj Gopal, B (2022) PentaGOD: Stepping beyond Traditional GOD with Five Parties. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (CCS ’22), November 7– 11, 2022, Los Angeles, pp. 1843-1856.

Koti, N and Kukkala, VB and Patra, A and Raj Gopal, B (2023) Shield: Secure Allegation Escrow System with Stronger Guarantees. In: 2023 World Wide Web Conference, WWW 2023, 30 April - 4 May 2023, Austin, pp. 2252-2262.

Koti, N and Kukkala, VB and Patra, A and Raj Gopal, B (2023) Shield: Secure Allegation Escrow System with Stronger Guarantees. In: World Wide Web Conference, WWW 202, 30 April - 4 May 2023, Austin, pp. 2252-2262.

Koti, N and Patil, S and Patra, A and Suresh, A (2022) Poster MPClan:: Protocol Suite for Privacy-Conscious Computations. In: Proceedings of the ACM Conference on Computer and Communications Security, 7-11 November 2022, Los Angeles, pp. 3379-3381.

Kotni, S and Nayak, A and Ganapathy, V and Basu, A (2021) Faastlane: Accelerating function-as-a-service workflows. In: 2021 USENIX Annual Technical Conference, 14-16 Jul 2021, pp. 957-971.

Krishna, G (1995) Cognitive science: The mind-body problem. In: Current Science (Bangalore), 68 (2). 197-199 .

Krishna, G (1995) The goals of cognitive science. In: Current Science (Bangalore), 68 (2). pp. 199-201.

Krishna, L and Castillo, GA and Mishra, UA and Hereid, A and Kolathaya, S (2022) Linear Policies are Sufficient to Realize Robust Bipedal Walking on Challenging Terrains. In: IEEE Robotics and Automation Letters, 7 (2). pp. 2047-2054.

Krishna Kumar, KP and Hansdah, RC (2006) An efficient and scalable checkpointing and recovery algorithm for distributed systems. In: 8th International Conference on Distributed Computing and Networking,, Dec 27-30, 2006, Guwahati, India, pp. 94-99.

Krishnamurthy, EV and Komissar, C (1973) Authors' Reply. In: IEEE Transactions on Reliability, R-22 (2). pp. 109-110.

Krishnamurthy, EV and Komissar, G (1972) Computer-Aided Reliability Analysis of Complicated Networks. In: IEEE Transactions on Reliability, R21 (2). pp. 86-89.

Krishnamurthy, EV and Komissar, G (1972) Computer-Aided Reliability Analysis of Complicated Networks. In: IEEE Transactions on Reliability, R-21 (2). pp. 86-89.

Krishnamurthy, EV and Ramachandran, Vijaya (1980) A cryptographic system based on finite field transforms. In: Proceedings Mathematical Sciences, 89 (2). 0973 -7685.

Krishnamurthy, R and Lakshmanan, KB and Krishnamurthy, EV (1973) Linear description of electrical networks for computer analysis. In: Proceedings of the IEEE, 61 (9). 1367 -1367.

Krishnan, Murali K and Shankar, Priti (2006) Approximate linear time ML decoding on tail-biting trellises in two rounds. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 2245-2249.

Krishnan, Murali K and Shankar, Priti (2006) On the complexity of finding stopping set size in Tanner Graphs. In: 40th Annual Conference on Information Sciences and Systems (CISS),, Mar 22-24, 2006, Princeton, NJ, pp. 157-158.

Krishnan, R and Krishna, G and Deekshatulu, BL (1976) Location of concentrators in a computer communication network: a stochastic automation search method. In: International Journal of Systems Science, 7 (11). pp. 1201-1207.

Krishnan, D and Patnaik, LM (1986) GEODERM: geometric shape design system using an entity-relationship model. In: Computer-Aided Design, 18 (4). pp. 207-218.

Krishnan, Murali K and Chandran, Sunil L (2006) Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs. In: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science,, Dec 13-15, 2006, Calcutta, India, pp. 69-80.

Krishnan, Murali K and Shankar, Priti (2007) Computing the Stopping Distance of a Tanner Graph is NP-hard. In: IEEE Transactions on Information Theory, 53 (6). pp. 2278-2280.

Krishnan, S and Bhattacharyya, Chiranjib and Hariharan, Ramesh and Genomics, Strand (2007) A Randomized Algorithm for Large Scale Support Vector Learning. In: Proceedings of 21st Annual Conference on Neural Information Processing Systems (NIPS), June 2007.

Krupa, Datta R and Roy, Aniket Basu and De, Minati and Govindarajan, Sathish (2017) Demand Hitting and Covering of Intervals. In: 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), FEB 16-18, 2017, Sancoale, INDIA, pp. 267-280.

Kudlur, Manjunath and Govindarajan, R (2004) Performance analysis of methods that overcome false sharing effects in software DSMs. In: Journal of Parallel and Distributed Computing, 64 (8). pp. 887-907.

Kulkarni, RK and Srikant, YN (1994) C2G2: a Complete Code Generator Generator. In: Computer Systems and Education. Proceedings of the International Conference on Computer Systems and Education in Honour of Prof. V. Rajaraman, 22-25 June 1994, Bangalore, India, pp. 47-57.

Kulkarni, Niraj and Gopinath, K (2013) Quick recovery in transactional flash. In: IEEE International Conference on Electronics, Computing and Communication Technologies, JAN 17-19, 2013, Bangalore, INDIA.

Kulkarni, Sulekha R and Shankar, Priti (1996) Linear time parsers for classes of non context free languages. In: Theoretical Computer Science, 165 (2). pp. 355-390.

Kumar, MP Subodh and Srikant, YN (1986) Graphical simulation of Petri Nets. In: Computers & Graphics, 10 (3). 225 -228.

Kumar, Mohan J and Patnaik, LM (1991) Performance studies of a transputer-based extended hypercube. In: Journal of the Indian Institute of Science, 71 (2). pp. 117-123.

Kumar, PP and Madhavan, CEV (1993) Shortest watchman tours in weak visibility polygons. In: CCCG. Proceedings of the Fifth Canadian Conference on Computational Geometry, 5-9 Aug. 1993, Waterloo, Ont., Canada, pp. 91-96.

Kumar, A and Balaji, V and Chandrashekar, MA and Dukkipati, A and Vadhiyar, S (2022) Graph Convolutional Neural Networks for Alzheimer's Classification with Transfer Learning and HPC Methods. In: 36th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022, 30 May 2022 through 3 June 2022, pp. 186-195.

Kumar, A and Bhattamishra, S and Bhandari, M and Talukdar, P (2019) Submodular optimization-based diverse paraphrasing and its effectiveness in data augmentation. In: 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2019, 2-7 June 2019, Minneapolis; United States, pp. 3609-3619.

Kumar, A and Biswas, A and Sanyal, S (2018) Ecommercegan: A generative adversarial network for e-commerce. In: 6th International Conference on Learning Representations, ICLR 2018, 30-3 May 2018, Vancouver; Canada.

Kumar, A and Louis, A and Tulsiani, M (2018) Finding pseudorandom colorings of pseudorandom graphs. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), 12 - 14 December 2017, Kanpur.

Kumar, Anil VS and Arya, Sunil and Ramesh, H (2000) Hardness of set cover with intersection 1. In: Automata Languages and Programming, 1853 . pp. 624-635.

Kumar, Anil VS and Ramesh, H (2001) Coupling vs. conductance for the Jerrum-Sinclair chain. In: Random Structures and Algorithms, 18 (1). pp. 1-17.

Kumar, Anil VS and Ramesh, H (2003) Covering Rectilinear Polygons with Axis-Parallel Rectangles. In: SIAM Journal on Computing, 32 (6). pp. 1509-1541.

Kumar, Anil VS and Ramesh, H (1999) Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. In: 40th Annual Symposium on Foundations of Computer Science,1999, 17-19 October, New York, 241 -251.

Kumar, Bharath M and Lakshminarayanan, R and Srikant, YN (2000) A Study of Automatic Migration of Programs Across the Java Event Models. In: ACM SIGSOFT Software Engineering Notes, 25 (3). pp. 24-29.

Kumar, Bharath M and Srikant, YN (2004) The Best Nurturers in Computer Science Research. IISc-CSA-TR-2004-10.

Kumar, Bharath M and Srikant, YN and Lakshminarayanan, R (2002) On the use of connector libraries in distributed software architectures. In: Software Engineering Notes, 27 (1). pp. 45-52.

Kumar, Binod and Jindal, Ankit and Tudu, Jaynarayan and Pandey, Brajesh and Singh, Virendra (2017) Revisiting Random Access Scan for Effective hnhancement of Post-silicon Observability. In: 23rd IEEE International Symposium on On-Line Testing and Robust System Design (IOLTS), JUL 03-05, 2017, Thessaloniki, GREECE, pp. 132-137.

Kumar, Binod and Nehru, Boda and Pandey, Brajesh and Singh, Virendra and Tudu, Jaynarayan (2017) A Technique for Low Power, Stuck-at Fault Diagnosable and Reconfigurable Scan Architecture. In: IEEE East-West Design and Test Symposium (EWDTS), OCT 14-17, 2016, Yerevan, ARMENIA.

Kumar, Binod and Nehru, Boda and Pandey, Brajesh and Tudu, Jaynarayan (2017) Skip-scan: A methodology for test time reduction. In: ter Science and Automation, Indian Institute of Science, Bangalore, India, 24-27 May 2016, Guwahati, India, pp. 1-6.

Kumar, Deepak C and Sarma, VVS (1996) Towards building an intelligent decision support system for project management. In: Sadhana : Academy Proceedings in Engineering Sciences, 21 (part 3). pp. 327-343.

Kumar, Dinesh A and Dukkipati, Ambedkar (2012) A Two Stage Selective Averaging LDPC Decoding. In: IEEE International Symposium on Information Theory, JUL 01-06, 2012 , Cambridge, MA.

Kumar, JM and Patnaik, LM and Das, A (1994) Load balancing algorithms for an extended hypercube. In: IEE Proceedings Computers and Digital Techniques, 141 (5). pp. 298-306.

Kumar, JSS and Komondoor, R (2023) Controller Synthesis for Reactive Systems with Communication Delay by Formula Translation. In: UNSPECIFIED, pp. 292-311.

Kumar, MJ and Patnaik, LM and Nag, B (1998) Fault-tolerant message routing in the extended hypercube. In: Journal of Systems Architecture, 44 (9-10). pp. 691-702.

Kumar, MJ and Venkatesh, S and Kieronska, D and Patnaik, LM (1995) Hierarchical Directory-Based Shared Memory Architecture. In: Computer Journal, The, 38 (3). pp. 207-216.

Kumar, Mohan J and Patnaik, LM (1991) Efficient Implementation of Bidirectional Associative Memories on the Extended Hypercube. In: 1991 IEEE International Joint Conference on Neural Networks, 18-21 November, Singapore, Vol.3, 2253-2258.

Kumar, Mohan J and Patnaik, LM and Prasad, Divya K (1990) A transputer-based extended hypercube. In: Microprocessing and Microprogramming, 29 (4). pp. 225-236.

Kumar, Narendra and Rajagopalan, Padmini and Pankajakshan, Praveen and Bhattacharyya, Arnab and Sanyal, Suchismita and Balachandran, Janakiraman and Waghmare, Umesh V (2019) Machine Learning Constrained with Dimensional Analysis and Scaling Laws: Simple, Transferable, and Interpretable Models of Materials from Small Datasets. In: CHEMISTRY OF MATERIALS, 31 (2). pp. 314-321.

Kumar, Naresh and Hansdah, RC and Maity, Soumyadev (2017) A design and classification framework for routing protocols in MANETs. In: International Journal of Wireless and Mobile Computing, 12 (4). pp. 364-383. ISSN 1741-1084

Kumar, P and Ansari, MH and Sharma, A (2020) MBC-CA: Multithreshold binary conversion based salt-and-pepper noise removal using cellular automata. In: Communications in Computer and Information Science, 27-29 September 2019, Springer, Singapore, pp. 195-204.

Kumar, P and Sahoo, S and Shah, V and Kondameedi, V and Jain, A and Verma, A and Bhattacharyya, C and Viswanathan, V (2021) DSLR: Dynamic to Static LiDAR Scan Reconstruction Using Adversarially Trained Autoencoder. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021, 2 February 2021 through 9 February 2021, Virtual, pp. 1836-1844.

Kumar, P Sreenivasa and Madhavan, C E Veni (1998) Minimal vertex separators of chordal graphs. In: Discrete Applied Mathematics, 89 (1-3). pp. 155-168.

Kumar, PP and Ansari, MH and Sharma, AM (2020) MBC-CA: Multithreshold binary conversion based salt-and-pepper noise removal using cellular automata. In: International Conference on Computer Vision and Image Processing, 27 Sept. 29 2019, Jaipur, pp. 195-204.

Kumar, PS and Madhavan, CEV (2002) Clique tree generalization and new subclasses of chordal graphs. In: Discrete Applied Mathematics, 117 (1-3). pp. 109-131.

Kumar, Prem G and Babu, Phanendra G (1994) Optimal network partitioning for fault-tolerant network management using evolutionary programming. In: Information Processing Letters, 50 (3). pp. 145-149.

Kumar, S and Sreenivasan, V and Talukdar, P and Pestilli, F and Sridharan, D (2019) ReAl-life: Accelerating the discovery of individualized brain connectomes on GPUs. In: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, 27 January 2019through 1 February 2019, Honolulu, pp. 630-638.

Kumar, Sandeep and Gopinath, K and Rocchi, Laura and Sukumar, Poorna Talkad and Sampath, Jayanth and Kulkarni, Suyameendra (2018) Towards a Portable Human Gait Analysis & Monitoring System. In: 2018 INTERNATIONAL CONFERENCE ON SIGNALS AND SYSTEMS (ICSIGSYS), MAY 01-03, 2018, Bali, INDONESIA, pp. 174-180.

Kumar, Sandeep and Padakandla, Sindhu and Chandrashekar, L and Parihar, Priyank and Gopinath, K and Bhatnagar, Shalabh (2017) Scalable Performance Tuning of Hadoop MapReduce: A Noisy Gradient Approach. In: 10th IEEE International Conference on Cloud Computing (CLOUD), JUN 25-30, 2017, Honolulu, HI, pp. 375-382.

Kumar, Santhosh V and Nanjundiah, R and Thazhuthaveetil, MJ and Govindarajan, R (2008) Impact of message compression on the scalability of an atmospheric modeling application on clusters. In: Parallel Computing, 34 (1). pp. 1-16.

Kumar, Santhosh V and Thazhuthaveetil, MJ and Govindarajan, R (2006) Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters. In: 20th International Parallel and Distributed Processing Symposium, 2006. IPDPS 2006., 25-29 April 2006, Rhodes Island.

Kumar, Santhosh V and Thazhuthaveetil, MJ and Govindarajan, R (2005) Offloading Bloom Filter Operations to Network Processor for Parallel Query Processing in Cluster of Workstations. [Book Chapter]

Kumar, V (2022) Privately Executable Examples. In: 27th ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE 2022, 8 - 13 July 2022, Dublin, pp. 283-289.

Kumar, Vinodh R and Narayanan, Lakshmi B and Govindarajan, R (2002) Dynamic path profile aided recompilation in a JAVA just-in-time compiler. In: Lecture Notes in Computer Science, 2552 . pp. 495-505.

Kumaran, A (2004) MIRA: Multilingual Information Processing on Relational Architecture. In: Workshop on Current Trends in Database Technology: EDBT04 (Lecture Notes in Computer Science), March 14-18, 2004, Heraklion, Crete, Greece, Vol. 3268, 12-23.

Kumaran, A and Chowdary, Pavan K and Haritsa, Jayant R (2006) On Pushing Multilingual Query Operators into Relational Engines. In: Proceedings of the 22nd International Conference on Data Engineering, 2006. ICDE '06., 03-07 April 2006 , Atlanta, USA.

Kumaran, A and Haritsa, Jayant R (2004) LexEQUAL: Supporting Multiscript Matching in Database Systems. [Book Chapter]

Kumaran, A and Haritsa, Jayant R (2004) LexEQUAL:Supporting Multilexical Queries in SQL. In: 20th International Conference on Data Engineering, 2004, 30 March-2 April, Massachusetts,USA, 845 -845.

Kumaran, A and Haritsa, Jayant R (2004) On Semantic Matching of Multilingual Attributes in Relational Systems. In: thirteenth ACM international conference on Information and knowledge management, 8-13 November 2004, Washington, D.C., USA, pp. 230-231.

Kumaran, A and Haritsa, Jayant R (2005) SemEQUAL: Multilingual Semantic Matching in Relational Systems. [Book Chapter]

Kundu, Achintya and Tankasali, Vikram and Bhattacharyya, Chiranjib and Ben-Tal, Aharon (2010) Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions. In: International Conference on Neural Information Processing Systems, NIPS, 2010, Bangalore.

Kundu, JN and Kulkarni, A and Singh, A and Jampani, V and Babu, RV (2021) Generalize then Adapt: Source-Free Domain Adaptive Semantic Segmentation. In: 18th IEEE/CVF International Conference on Computer Vision, ICCV 2021, 1 - 17 October 2021, Virtual, Online, pp. 7026-7036.

L

Lahiri, A and Mukherjee, J and Subramanian, CR (2021) On approximating MIS over B1-VPG graphs. In: Discrete Mathematics, Algorithms and Applications .

Lahiri, Abhiruk and Mukherjee, Joydeep and Subramanian, CR (2015) Maximum Independent Set on B-1-VPG Graphs. In: 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA), DEC 18-20, 2015, Houston, TX, pp. 633-646.

Lakkaraju, Himabindu and Bhattacharya, Indrajit and Bhattacharyya, Chiranjib (2012) Dynamic multi-relational Chinese restaurant process for analyzing influences on users in social media. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), 10-13 Dec. 2012, Brussels.

Lakkaraju, Himabindu and Bhattacharyya, Chiranjib and Bhattacharya, Indrajit and Merugu, Srujana (2011) Exploiting coherence for the simultaneous discovery of latent facets and associated sentiments. In: 2011 SIAM International Conference on Data Mining, April 28-30, 2011, Mesa, Arizona, USA.

Lakshmanan, VS and Chandrasekaran, N and Madhavan, CEV (1984) Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes. In: Lecture Notes In Computer Science, 181 . pp. 344-366.

Lakshmanan, VS and Madhavan, CEV (1985) The Implication Problem for Functional and Multivalued Dependencies. In: Lecture Notes in Computer Science, 206 . pp. 303-328.

Lakshmanan, VS and Madhavan, Veni CE (1986) Binary decompositions and acyclic schemes. In: Lecture Notes in Computer Science, 241 . pp. 214-238.

Lakshmanan, K and Bhatnagar, Shalabh (2017) Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization. In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 66 (3). pp. 533-556.

Lakshmanan, K and Bhatnagar, Shalabh (2011) Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints. In: ICDCIT'11 Proceedings of the 7th international conference on Distributed Computing and Internet Technology, 2011, Heidelberg.

Lakshmanan, K and Bhatnagar, Shalabh (2012) A novel Q-learning algorithm with function approximation for constrained Markov decision processes. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 1-5 Oct. 2012 , Monticello, IL, USA.

Lakshmanan, VS (1988) Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers. In: Theoretical Computer Science, 62 (1-2). pp. 105-122.

Lakshmanan, VS and Madhavan, Veni CE (1987) An algebraic theory of functional and multivalued dependencies in relational databases. In: Theoretical Computer Science, 54 (1). pp. 103-128.

Lakshmi, K Vasanta and Sreedhar, Deepak and Raman, Easwaran and Shankar, Priti (2005) Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework. In: 12th International Conference, December 18-21, 2005., Goa, India.

Lakshmi, Vasanta K (2016) Memory Efficient Deep Packet Inspection Using Transition Functions. In: 8th International Conference on Communication Systems and Networks (COMSNETS), JAN 05-10, 2016, Bangalore, INDIA.

Lakshmi, Vasanta K and Acharya, Aravind and Komondoor, Raghavan (2014) Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis. In: 19th International Symposium on Formal Methods (FM), MAY 12-16, 2014, Natl Univ Singapore, Singapore, SINGAPORE, pp. 335-350.

Lakshminarasimhan, AL and Dasarathy, BV (1975) Multi-state-choice automata model for expedient learning in random environment. In: Information Sciences, 9 (2). pp. 91-98.

Lakshminarayanan, Chandrashekar and Bhatnagar, Shalabh (2017) A stability criterion for two timescale stochastic approximation schemes. In: AUTOMATICA, 79 . pp. 108-114.

Lakshminarayanan, S and Rao, NJ (2022) Improving Integrity in CS1 Course Using Formative Assessment and Version Control Tools. In: Higher Education for the Future, 9 (1). pp. 30-44.

Lakshminarayanan, S and Rao, NJ (2021) Types and time of interaction for teaching introductory programming using instruction method of extreme apprenticeship. In: Cogent Education, 8 (1).

Lakshminarayanan, S and Rao, NJ and Meghana, GK (2021) Transformative Learning in Mastery-Oriented CS0 Course. In: Higher Education for the Future, 8 (2). pp. 162-179.

Lakshmish, MR and Manohar, S and Chandru, V (1999) Wavelets for volume fusion. In: Proceedings of International Conference on Visual Computing, 23-26 Feb. 1999, Goa, India, pp. 168-177.

Leela, Krishna P and Tolani, Pankaj M and Haritsa, Jayant R (2004) On Incorporating Iceberg Queries in Query Processors. In: 9th International Conference on Database Systems for Advanced Applications:DASFAA 2004, (Lecture Notes in Computer Science), March 17-19, 2003, Jeju Island, Korea, Vol.2973, 431-442.

Lele, Sharad M (1987) Improved Algorithms for Reservoir Capacity Calculation Incorporating Storage-Dependent Losses and Reliability Norm. In: Water Resources Research, 23 (10). pp. 1819-1823.

Lele, Sharad M and Norgaard, Richard B and Subramanian, DK (1988) Hydropower Project Design Incorporating Submergence Costs. In: Journal of Environmental Management, 27 (3). 307 -323.

Lele, Sharad M and Subramanian, DK (1988) A hydro-wood net-energy approach to hydro project design. In: Energy, 13 (4). pp. 367-381.

Levit, Maxwell and Chandran, Sunil L and Cheriyan, Joseph (2018) On Eulerian orientations of even-degree hypercubes. In: OPERATIONS RESEARCH LETTERS, 46 (5). pp. 553-556.

Li, Xueliang and Liu, Sujuan and Chandran, Sunil L and Mathew, Rogers and Rajendraprasad, Deepak (2012) Rainbow Connection Number and Connectivity. In: Electronic Journal of Combinatorics, 19 (1).

Louis, A and Nasre, M and Nimbhorkar, P and Sankar, GS (2023) Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. In: UNSPECIFIED, pp. 1601-1608.

Louis, A and Paul, R and Ray, A (2024) Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. In: Scandinavian Symposium on Algorithm Theory, SWAT 2024, 12-14 June 2024, Helsinki.

Louis, A and Venkat, R (2019) Planted models for k-way edge and vertex expansion. In: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, 11-13 December 2019, Institute of Technology BombayBombay; India.

Louis, A and Venkat, R (2018) Semi-random graphs with planted sparse vertex cuts: Algorithms for exact and approximate recovery. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9 - 13 July 2018, Prague.

M

Maadasamy, Senthilnathan and Doraiswamy, Harish and Natarajan, Vijay (2012) A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology. In: 19th International Conference on High Performance Computing (HiPC), DEC 18-22, 2012, Pune, INDIA.

Madhavan, CEV (1984) Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Lecture Notes in Computer Science, 181 . pp. 381-392.

Madhavan, CE Veni (1984) Secondary attribute retrieval using tree data structures. In: Theoretical Computer Science, 33 (1). pp. 107-116.

Madhavan, CE Veni and Srikanth, Ch and Swamy, HV Kumar (2019) VSK Chains: Integrated Content and Currency Transaction Blockchains. In: 23rd Annual Conference on Advanced Computing and Communications, ADCOM 2017, 8 - 10 September 2017, Bangalore, pp. 18-26.

Madhavan, CEV (2018) Message from general chair. In: 2017 International Conference on Public Key Infrastructure and its Applications, PKIA 2017 - Proceedings, 2018 . p. 1.

Madhavan, CEV and Iyengar, S Sitharama and Madhavan, Veni CE (1985) A comparative study of multiple attribute tree and inverted file structures for large bibliographic files. In: Information Processing & Management, 21 (5). pp. 433-442.

Madhavan, Maya and Shankar, Priti (1998) Optimal regular tree pattern matching using pushdown automata. In: 18th Conference on Foundations of Software Technology and Theoretical Computer Science, December 17-19, 1998, Chennai, India, pp. 122-133.

Madhavan, Maya and Shankar, Priti and Rai, Siddartha and Ramakrishnan, U (2000) Extending Graham-Glanville Techniques for Optimal Code Generation. In: ACM Transactions on Programming Languages and Systems, 22 (06). pp. 973-1001.

Madhavan, Ravichandhran and Komondoor, Raghavan (2011) Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis. In: ACM Sigplan Notices, 46 (10). pp. 1033-1052.

Madhavan, Veni CE (2005) Mathematics and Computer Science: The Interplay. In: Current Science, 88 (3). pp. 397-404.

Madhavan, Veni CE and Viswanathan, J (1976) Stochastic Differential Equations for Linear Smoothing Problems. In: IEEE Transactions on Automatic Control, 21 (2). pp. 269-271.

Madhukar, Budagavi and Patnaik, LM and Murthy, ISN (1992) Improved Parametric Models and DPCM Techniques for ECG Data Compression. In: Annual International Conference of the IEEE on Engineering in Medicine and Biology Society, 1992, 29th October-1st November, Paris,France, Vol.2, 612-613.

Madhukar, Budagavi and Patnaik, LM and Murthy, ISN (2011) Improved parametric models and DPCM techniques for EGG data compiression. In: 1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Oct. 29 1992-Nov. 1 1992, Paris, France.

Madhukara, K and Kumara, Pavan D and Rangana, Pandu C and Sundarb, R (1995) Systematic design of an algorithm for biconnected components. In: Science of Computer Programming, 25 (1). pp. 63-77.

Mahadevan, Indu and Patnaik, LM (1992) Performance evaluation of bidirectional associative memory on a transputer-based parallel system. In: Parallel Computing, 18 (4). pp. 401-413.

Mahadevan, Indu and Patnaik, LM (1991) Transputer-Based Parallel Systems for Performance Evaluation of Bidirectional Associative Memory. In: 1991 IEEE International Joint Conference on Neural Networks, 18-21 November, Singapore, Vol.1, 2478-2483.

Mahajan, Meena and Subramanya, PR and Vinay, V (2004) The combinatorial approach yields an NC algorithm for computing Pfaffians. In: Discrete Applied Mathematics, 143 (1-3). pp. 1-16.

Mahajan, M and Vinay, V (1998) Determinant: Old algorithms, new insights (Extended Abstract). In: 6th Scandinavian Workshop on Algorithm Theory (SWAT 98), JUL 08-10, 1998, Stockholm, Sweden.

Mahajan, Meena and Vinay, V (1999) Determinant: old algorithms, new insights. In: SIAM Journal on Discrete Mathematics, 12 (4). pp. 474-490.

Mahajan, Sanjeev and Ramesh, H (1996) Derandomizing approximation algorithms based on semidefinite programming. In: SIAM Journal on Computing, 28 (5). pp. 1641-1663.

Mahapatra, Ipsita Biswas and Agarwal, Utkarsh and Nandy, SK (2018) DFG partitioning algorithms for coarse grained reconfigurable array assisted RTL simulation accelerators. In: IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), MAR 16-17, 2018, Bangalore, INDIA. (In Press)

Mahesh, N and Manohar, S (1997) Parallel Interactive Virtual Machining on Shared Memory Multiprocessors. In: Fourth International Conference on High Performance Computing, 1997, 18-21 December, Bangalore,India, pp. 54-59.

Maiti, A and Patil, V and Khan, A (2021) Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. In: 35th Conference on Neural Information Processing Systems, NeurIPS 2021, 6 December 2021 through 14 December 2021, Virtual, Online, pp. 19553-19565.

Maity, Raj Kumar and Lakshminarayanan, Chandrashekar and Padakandla, Sindhu and Bhatnagar, Shalabh (2016) Shaping Proto-Value Functions Using Rewards. In: 22nd European Conference on Artificial Intelligence (ECAI), AUG 29-SEP 02, 2016, Hague, NETHERLANDS, pp. 1690-1691.

Maity, Soumyadev and Hansdah, R C (2017) Security and performance analysis of the SEAP authentication protocol in MANETs. In: INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 25 (3). pp. 183-203.

Maity, Soumyadev and Hansdah, RC (2012) Certificate-less on-demand public key management (CLPKM) for self-organized MANETs. In: Proceedings of ICISS 2012 the 8th International Conference, December 15-19, 2012, Guwahati, India.

Maity, Soumyadev and Hansdah, RC (2012) Membership models and the design of authentication protocols for MANETs. In: 2012 26th International Conference on Advanced Information Networking and Applications Workshops (WAINA), 26-29 March 2012, Fukuoka.

Maity, Soumyadev and Hansdah, RC (2013) A Secure and Efficient Authentication Protocol (SEAP) for MANETs with Membership Revocation. In: IEEE . pp. 363-370.

Maity, Soumyadev and Hansdah, RC (2014) Self-organized public key management in MANETs with enhanced security and without certificate-chains. In: COMPUTER NETWORKS, 65 . pp. 183-211.

Maiya, Pallavi and Kanade, Aditya and Majumdar, Rupak (2014) Race Detection for Android Applications. In: ACM SIGPLAN NOTICES, 49 (6). pp. 316-325.

Majhi, Ananta K and Agrawal, Vishwani D and Jacob, James and Patnaik, Lalit M (2000) Line coverage of path delay faults. In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 8 (5). pp. 610-614.

Majumder, Biswanath and Baraneedharan, Ulaganathan and Thiyagarajan, Saravanan and Radhakrishnan, Padhma and Narasimhan, Harikrishna and Dhandapani, Muthu and Brijwani, Nilesh and Pinto, Dency D and Prasath, Arun and Shanthappa, Basavaraja U and Thayakumar, Allen and Surendran, Rajagopalan and Babu, Govind K and Shenoy, Ashok M and Kuriakose, Moni A and Bergthold, Guillaume and Horowitz, Peleg and Loda, Massimo and Beroukhim, Rameen and Agarwal, Shivani and Sengupta, Shiladitya and Sundaram, Mallikarjun and Majumder, Pradip K (2015) Predicting clinical response to anticancer drugs using an ex vivo platform that captures tumour heterogeneity. In: NATURE COMMUNICATIONS, 6 .

Malakar, Peeti and George, Thomas and Kumar, Sameer and Mittal, Rashmi and Natarajan, Vijay and Sabharwal, Yogish and Saxena, Vaibhav and Vadhiyar, Sathish S (2012) A divide and conquer strategy for scaling weather simulations with multiple regions of interest. In: SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, Monday, October 14, 2013, Los Alamitos, CA, USA.

Malakar, Preeti and Natarajan, Vijay and Vadhiyar, Sathish S (2011) INST: An Integrated Steering Framework for Critical Weather Applications. In: International Conference on Computational Science (ICCS) on the Ascent of Computational Excellence, 2011, Campus Nanyang Technolog Univ, Singapore, SINGAPORE.

Malakar, Preeti and Natarajan, Vijay and Vadhiyar, Sathish S (2011) InSt: an integrated steering framework for critical weather applications. In: International Conference on Computational Science, ICCS 2011, june 1-3, 2011, Nanyang Technological University, Singapore's.

Malakar, Preeti and Natarajan, Vijay and Vadhiyar, Sathish S (2012) Integrated parallelization of computations and visualization for large-scale applications. In: 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) , MAY 21-25, 2012, Shanghai Jiao Tong Univ, Shanghai, PEOPLES R CHINA, pp. 2510-2513.

Malakar, Preeti and Natarajan, Vijay and Vadhiyar, Sathish S and Nanjundiah, Ravi S (2013) A Diffusion-Based Processor Reallocation Strategy for Tracking Multiple Dynamically Varying Weather Phenomena. In: 42nd Annual International Conference on Parallel Processing (ICPP), OCT 01-04, 2013, Lyon, France, pp. 50-59.

Malhotra, K and Bansal, S and Ganapathy, S (2019) Active learning methods for low resource end-to-end speech recognition. In: 20th Annual Conference of the International Speech Communication Association: Crossroads of Speech and Language, INTERSPEECH 2019, 15 - 19 September 2019, Graz, pp. 2215-2219.

Mall, R and Patnaik, LM (1992) A Force Directed Hill-Climbing Placement Algorithm. In: The Fifth International Conference on VLSI Design, 1992, 4-7 January, Bangalore,India, pp. 251-254.

Mall, R and Patnaik, LM (1991) Formal Timing Analysis of Distributed Systems. In: International Journal of Parallel Programming, 20 (2). pp. 75-94.

Mall, R and Patnaik, LM (1991) A New Approach to Specify Real-time Behavior of Distributed Systems. In: Pacific Rim International Symposium on Fault Tolerant Systems, 1991, 26-27 September, Kawasaki,Japan, pp. 194-198.

Mall, R and Patnaik, LM (1991) Parallel maze routing on hypercube computers. In: Computer-Aided Design, 23 (6). pp. 454-459.

Mall, R and Patnaik, LM (1990) Specification and Verification of Timing Properties of Distributed Real-Time Systems. In: 1990 IEEE Region 10 Conference on Computer and Communication Systems. TENCON 90, 24-27 September, Hong Kong, Vol.1, 274-278.

Mall, R and Patnaik, LM (1991) A Temporal Logic over Partial Orders for Analysis of Real-Time Properties of Distributed Programs. In: 1991 IEEE Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems. TENCON '91, 28-30 August, New Delhi,India, Vol.2, 335-339.

Mall, R and Patnaik, LM and Raman, Srilata (1991) Simulated Annealing-Based Channel Routing on Hypercube Computers. In: 1991 Fourth CSI/IEEE International Symposium on VLSI Design, 4-8 January, New Delhi,India, pp. 75-81.

Mani, V and Sarma, VVS (1984) Queuing Network Models for Aircraft Availability and Spares Management. In: IEEE Transactions on Reliability, R-33 (3). pp. 257-262.

Manikantan, R and Govindarajan, R and Rajan, Kaushik (2011) Extended histories: improving regularity and performance in correlation prefetchers. In: HiPEAC '11 Proceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers, 2011, New York, NY, USA.

Manikantan, R and Rajan, Kaushik and Govindarajan, R (2012) Probabilistic Shared Cache Management (PriSM). In: 39th Annual International Symposium on Computer Architecture (ISCA), JUN 09-13, 2012 , Portland, OR, USA, pp. 428-439.

Manikantan, R and Rajan, Kaushik and Govindarajan, Ramaswamy (2011) NUcache: an efficient multicore cache organization based on next-use distance. In: 2011 IEEE 17th International Symposium on High Performance Computer Architecture (HPCA), 12-16 Feb. 2011, San Antonio, TX.

Manikantan, R. and Govindarajan, R. (2008) Focused Prefetching: Performance Oriented Prefetching Based On Commit Stalls. In: International Conference on Supercomputing (ICS 2008), JUN 07-12, 2006, Island of Kos, Greece, pp. 339-348.

Manish Kumar, C and Gopinath, K (2007) Recovery from DoS Attacks in MIPv6: Modelling and Validation. In: Fifth IEEE International Conference on Software Engineering and Formal Methods, 10-14 Sept. 2007 , London .

Manjunath, Geetha and Murty, Narasimha M and Sitaram, Dinkar (2013) Combining heterogeneous classifiers for relational databases. In: Pattern Recognition, 46 (1). pp. 317-324.

Mannan, Ashraf U and Singh, Jaya and Lakshmikeshava, Ravikiran and Thota, Nishita and Singh, Suhasini and Sowmya, TS and Mishra, Avshesh and Sinha, Aditi and Deshwal, Shivani and Soni, Megha R and Chandrasekar, Anbukayalvizhi and Ramesh, Bhargavi and Ramamurthy, Bharat and Padhi, Shila and Manek, Payal and Ramalingam, Ravi and Kapoor, Suman and Ghosh, Mithua and Sankaran, Satish and Ghosh, Arunabha and Veeramachaneni, Vamsi and Ramamoorthy, Preveen and Hariharan, Ramesh and Subramanian, Kalyanasundaram (2016) Detection of high frequency of mutations in a breast and/or ovarian cancer cohort: implications of embracing a multi-gene panel in molecular diagnosis in India. In: JOURNAL OF HUMAN GENETICS, 61 (6). pp. 515-522.

Mannarswamy, SS and Govindarajan, Ramaswamy (2008) Variable Granularity Access Tracking Scheme for Improving the Performance of Software Transactional Memory. In: 2011 IEEE International Parallel & Distributed Processing Symposium (IPDPS), 16-20 May 2011, Anchorage, AK.

Mannarswamy, Sandya S and Govindarjan, R (2012) Reconciling transactional conflicts with compiler's help. In: CGO '12 Proceedings of the Tenth International Symposium on Code Generation and Optimization, 2012, New York, NY, USA.

Manohar, M (1985) Space and time efficiency of the forest-of-quadtrees representation. In: Image and Vision Computing, 3 (2). pp. 63-70.

Manohar, Swami (1999) Advances in volume graphics. In: Computers & Graphics, 23 (1). pp. 73-84.

Manoj, NP and Manjunath, KV and Govindarajan, R (2004) CAS-DSM: A Compiler Assisted Software Distributed Shared Memory. In: International Journal of Parallel Programming, 32 (2). pp. 77-122.

Margoor, Amogh and Komondoor, Raghavan (2015) Two techniques to improve the precision of a demand-driven null-dereference verification approach. In: SCIENCE OF COMPUTER PROGRAMMING, 98 (4). pp. 645-679.

Mariyam, F and Mehfuz, S and Sadiq, M and Mehfuz E-Mail:, S (2021) Classification and evaluation of goal-oriented requirements analysis methods. In: International Conference on Applied Soft Computing and Communication Networks, ACN 2020, 14 - 17 Oct 2020, Virtual, Online, pp. 313-322.

Masood, TB and Natarajan, V and Rosen, P and Tierny, J (2022) Message from the TopoInVis 2022 Chairs. In: Proceedings - 2022 IEEE Workshop on Topological Data Analysis and Visualization, TopoInVis 2022 . VII.

Masood, TB and Ray, T and Natarajan, V (2020) Parallel computation of alpha complexes for biomolecules. In: Computational Geometry: Theory and Applications, 90 .

Masood, TB and Thygesen, SS and Linares, M and Abrikosov, AI and Natarajan, V and Hotz, I (2021) Visual Analysis of Electronic Densities and Transitions in Molecules. In: Computer Graphics Forum, 40 (3). pp. 287-298.

Mathias, Nisha and Gopal, Venkatesh (2001) Small worlds: How and why. In: Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 63 (2). 021117/1-12.

Mathias, PC and Patnaik, LM (1990) Systolic Evaluation of Polynomial Expressions. In: IEEE Transactions on Computers, 39 (5). pp. 653-665.

Mathias, PC and Patnaik, LM (1988) A systolic evaluator for linear, quadratic, and cubic expressions. In: Journal of Parallel and Distributed Computing, 5 (6). 729 -740.

Mathirajan, M and Sivakumar, AI and Chandru, V (2004) Scheduling algorithms for heterogeneous batch processors with incompatible job-families. In: Journal Of Inteligent Manufacturing, 15 (6). pp. 787-803.

Medicherla, RK and Komondoor, R and Roychoudhury, A (2020) Fitness Guided Vulnerability Detection with Greybox Fuzzing. In: Proceedings - 2020 IEEE/ACM 42nd International Conference on Software Engineering Workshops, ICSEW 2020, 27 June - 19 July 2020, Seoul, pp. 513-520.

Medicherla, Raveendra Kumar and Komondoor, Raghavan (2015) Precision vs. Scalability: Context Sensitive Analysis with Prefix Approximation. In: International Conference on Software Analysis, Evolution, and Reengineering (SANER), MAR 02-06, 2015, Montreal, CANADA, pp. 281-290.

Medicherla, Raveendra Kumar and Komondoor, Raghavan and Narendran, S (2015) Program Specialization and Verification using File Format Specifications. In: IEEE 31st International Conference on Software Maintenance and Evolution (ICSME), SEP 29-OCT 01, 2015, Bremen, GERMANY, pp. 191-200.

Meduri, D and Sharma, M and Natarajan, V (2024) Jacobi set simplification for tracking topological features in time-varying scalar fields. In: Visual Computer, 40 (7).

Meena, Jaswant and Devi, Susheela V (2015) Overlapping Community Detection in Social Network Using Disjoint Community Detection. In: IEEE Symposium Series Computational Intelligence, DEC 07-10, 2015, Cape Town, SOUTH AFRICA, pp. 764-771.

Meghashyam, P and Susheela Devi, V (2019) Community based node embeddings for networks. In: 26th International Conference on Neural Information Processing,, 12 - 15 December 2019, Sydney, pp. 380-387.

Meher, Saroj K and Murty, MN (2013) Efficient method of moving shadow detection and vehicle classification. In: AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 67 (8). pp. 665-670.

Mehlhorn, K and Sundar, R and Uhrig, C (1997) Maintaining dynamic sequences under equality tests in polylogarithmic time. In: Algorithmica, 17 (2). pp. 183-198.

Menon, KAP and Hariharan, R (1979) A New Liquid Level Sensor for Process-Control Applications. In: Transactions on Instrumentation and Measurement, 28 (2). pp. 155-158.

Menon, Sreejith K and Shankar, Priti (2008) COMPASS – A tool for evaluation of compression strategies for embedded processors. In: Journal of Systems Architecture, 54 (10). pp. 995-1003.

Menon, Sreejith K and Shankar, Priti (2005) An Instruction Set Architecture Based Code Compression Scheme for Embedded Processors. In: DCC 2005 Data Compression Conference, 2005, 29-31 March, Utah, p. 470.

Mishra, Vivek and Bhatnagar, Shalabh and Hemachandra, N (2007) Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times. In: 46th IEEE Conference on Decision and Control, DEC 12-14, 2007, New Orleans, LA.

Mishra, A and Shekhar, S and Singh, AK and Chakraborty, A (2019) OCR-VQA: Visual question answering by reading text in images. In: 15th IAPR International Conference on Document Analysis and Recognition, ICDAR 2019, 20 - 25 September 2019, Sydney, pp. 947-952.

Mishra, Ashish and Kanade, Aditya and Srikant, Y N (2016) Asynchrony-Aware Static Analysis of Android Applications. In: 14th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE), NOV 18-20, 2016, Kanpur, INDIA, pp. 163-172.

Mishra, Debasis and Veeramani, Dharmaraj (2007) Vickrey–Dutch procurement auction for multiple items. In: European Journal of Operational Research, 180 (2). pp. 617-629.

Mishra, SK and Sarma, IG and Swamy, KN (1994) Performance evaluation of two fuzzy-logic-based homing guidance schemes. In: Journal of Guidance, Control, and Dynamics, 17 (6). pp. 1389-1391.

Mishra, UA and Samineni, SR and Goel, P and Kunjeti, C and Lodha, H and Singh, A and Sagi, A and Bhatnagar, S and Kolathaya, S (2022) Dynamic Mirror Descent based Model Predictive Control for Accelerating Robot Learning. In: 39th IEEE International Conference on Robotics and Automation, ICRA 2022, 23 - 27 May 2022, Philadelphia, pp. 1631-1637.