Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarArpita Patra
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j11]Arpita Patra, Divya Ravi:
On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Information Theory 64(6): 4207-4227 (2018)- [c55]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. ACM Conference on Computer and Communications Security 2018: 677-694 - [c54]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. CRYPTO (2) 2018: 425-458 - [c53]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Public Key Cryptography (2) 2018: 499-529 - [c52]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC 2018: 295-304 - [c51]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO 2018: 55-71 - [i44]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. IACR Cryptology ePrint Archive 2018: 43 (2018) - [i43]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. IACR Cryptology ePrint Archive 2018: 394 (2018) - [i42]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptology ePrint Archive 2018: 436 (2018) - [i41]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptology ePrint Archive 2018: 481 (2018) - [i40]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. IACR Cryptology ePrint Archive 2018: 710 (2018) - 2017
- [j10]Carmit Hazay, Arpita Patra:
Efficient One-Sided Adaptively Secure Computation. J. Cryptology 30(1): 321-371 (2017) - [j9]Ashish Choudhury, Arpita Patra:
An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Information Theory 63(1): 428-468 (2017) - [c50]Yashvanth Kondi, Arpita Patra:
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO (1) 2017: 188-222 - [c49]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. ICITS 2017: 83-109 - [c48]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. NDSS 2017 - [c47]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - [e1]Arpita Patra, Nigel P. Smart:
Progress in Cryptology - INDOCRYPT 2017 - 18th International Conference on Cryptology in India, Chennai, India, December 10-13, 2017, Proceedings. Lecture Notes in Computer Science 10698, Springer 2017, ISBN 978-3-319-71666-4 [contents] - [i39]Chaya Ganesh, Arpita Patra:
Optimal Extension Protocols for Byzantine Broadcast and Agreement. IACR Cryptology ePrint Archive 2017: 63 (2017) - [i38]Yashvanth Kondi, Arpita Patra:
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. IACR Cryptology ePrint Archive 2017: 561 (2017) - [i37]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. IACR Cryptology ePrint Archive 2017: 1006 (2017) - [i36]Megha Byali, Arpita Patra, Divya Ravi, Pratik Sarkar:
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. IACR Cryptology ePrint Archive 2017: 1165 (2017) - 2016
- [c46]Chaya Ganesh, Arpita Patra:
Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016: 371-380 - [c45]Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN 2016: 147-168 - [i35]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. IACR Cryptology ePrint Archive 2016: 940 (2016) - 2015
- [j8]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. J. Cryptology 28(1): 49-109 (2015) - [c44]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. ASIACRYPT (1) 2015: 443-469 - [c43]Ashish Choudhury, Arpita Patra:
Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015: 5:1-5:10 - [c42]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. PODC 2015: 291-300 - [i34]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. IACR Cryptology ePrint Archive 2015: 450 (2015) - [i33]Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Robust MPC with Honest Majority Using Preprocessing. IACR Cryptology ePrint Archive 2015: 705 (2015) - [i32]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. IACR Cryptology ePrint Archive 2015: 860 (2015) - 2014
- [j7]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Asynchronous Byzantine Agreement with optimal resilience. Distributed Computing 27(2): 111-146 (2014) - [c41]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. LATINCRYPT 2014: 219-236 - [c40]Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of MPC over a Large Population. SCN 2014: 197-217 - [c39]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. SCN 2014: 476-493 - [c38]
- [i31]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. IACR Cryptology ePrint Archive 2014: 73 (2014) - [i30]Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of Cloud MPC. IACR Cryptology ePrint Archive 2014: 105 (2014) - [i29]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. IACR Cryptology ePrint Archive 2014: 107 (2014) - 2013
- [c37]Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating between MPC and FHE. ASIACRYPT (2) 2013: 221-240 - [c36]Ashish Choudhury, Martin Hirt, Arpita Patra:
Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013: 388-402 - [i28]Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating Between MPC and FHE. IACR Cryptology ePrint Archive 2013: 85 (2013) - [i27]Carmit Hazay, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. IACR Cryptology ePrint Archive 2013: 593 (2013) - 2012
- [j6]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan:
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM 59(5): 22:1-22:35 (2012) - [c35]Ashish Choudhury, Arpita Patra:
Brief announcement: efficient optimally resilient statistical AVSS and its applications. PODC 2012: 103-104 - [i26]Ashish Choudhury, Martin Hirt, Arpita Patra:
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. IACR Cryptology ePrint Archive 2012: 517 (2012) - 2011
- [j5]Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71(8): 1067-1074 (2011) - [c34]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011: 292-308 - [c33]Michael Backes, Aniket Kate, Arpita Patra:
Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011: 590-609 - [c32]Ashish Choudhury, Arpita Patra:
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. ICISC 2011: 450-466 - [c31]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
The Round Complexity of Perfectly Secure General VSS. ICITS 2011: 143-162 - [c30]Arpita Patra, C. Pandu Rangan:
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience. ICITS 2011: 206-226 - [c29]Arpita Patra:
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. OPODIS 2011: 34-49 - [i25]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. IACR Cryptology ePrint Archive 2011: 27 (2011) - [i24]Ashish Choudhury, Arpita Patra:
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. IACR Cryptology ePrint Archive 2011: 31 (2011) - [i23]Michael Backes, Aniket Kate, Arpita Patra:
Computational Verifiable Secret Sharing Revisited. IACR Cryptology ePrint Archive 2011: 281 (2011) - [i22]Ashish Choudhury, Arpita Patra:
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. IACR Cryptology ePrint Archive 2011: 288 (2011) - [i21]Arpita Patra:
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. IACR Cryptology ePrint Archive 2011: 313 (2011) - 2010
- [j4]Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan:
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. IJACT 2(2): 159-197 (2010) - [c28]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010: 184-202 - [c27]Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010: 431-447 - [c26]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
On Communication Complexity of Secure Message Transmission in Directed Networks. ICDCN 2010: 42-53 - [c25]Arpita Patra, C. Pandu Rangan:
Communication Optimal Multi-valued Asynchronous Broadcast Protocol. LATINCRYPT 2010: 162-177 - [c24]Arpita Patra, C. Pandu Rangan:
Brief announcement: communication efficient asynchronous byzantine agreement. PODC 2010: 243-244 - [c23]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. PODC 2010: 245-246 - [i20]Arpita Patra, C. Pandu Rangan:
Communication and Round Efficient Information Checking Protocol. CoRR abs/1004.3504 (2010) - [i19]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. IACR Cryptology ePrint Archive 2010: 7 (2010) - [i18]Arpita Patra:
Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation. IACR Cryptology ePrint Archive 2010: 280 (2010) - [i17]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
The Round Complexity of General VSS. IACR Cryptology ePrint Archive 2010: 609 (2010)
2000 – 2009
- 2009
- [j3]Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra:
Perfectly reliable and secure message transmission tolerating mobile adversary. IJACT 1(3): 200-224 (2009) - [c22]G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. CANS 2009: 21-40 - [c21]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. AsiaCCS 2009: 171-182 - [c20]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. Inscrypt 2009: 179-197 - [c19]Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009: 487-504 - [c18]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162 - [c17]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. ICITS 2009: 74-92 - [c16]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. INDOCRYPT 2009: 398-417 - [c15]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Simple and efficient asynchronous byzantine agreement with optimal resilience. PODC 2009: 92-101 - [c14]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Brief announcement: perfectly secure message transmission in directed networks re-visited. PODC 2009: 278-279 - [c13]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Information Theoretically Secure Multi Party Set Intersection Re-visited. Selected Areas in Cryptography 2009: 71-91 - [i16]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Information Theoretically Secure Multi Party Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2009: 116 (2009) - [i15]G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. IACR Cryptology ePrint Archive 2009: 311 (2009) - [i14]Arpita Patra, C. Pandu Rangan:
Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptology ePrint Archive 2009: 433 (2009) - [i13]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2009: 470 (2009) - [i12]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2009: 492 (2009) - 2008
- [j2]Arpita Patra, Sukhendu Das:
Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry. Pattern Recognition 41(7): 2298-2308 (2008) - [c12]Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan:
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186 - [c11]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Reliable Message Transmission in Directed Hypergraphs. CANS 2008: 285-303 - [c10]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan:
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155 - [c9]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Round Efficient Unconditionally Secure Multiparty Computation Protocol. INDOCRYPT 2008: 185-199 - [c8]B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan:
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. PODC 2008: 115-124 - [c7]Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan:
Efficient single phase unconditionally secure message transmission with optimum communication complexity. PODC 2008: 457 - [c6]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008: 309-326 - [i11]Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan:
Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. IACR Cryptology ePrint Archive 2008: 86 (2008) - [i10]Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan:
Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. IACR Cryptology ePrint Archive 2008: 141 (2008) - [i9]Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. IACR Cryptology ePrint Archive 2008: 172 (2008) - [i8]Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptology ePrint Archive 2008: 232 (2008) - [i7]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Statistically Reliable and Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2008: 262 (2008) - [i6]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Reliable Message Transmission in Directed Hypergraphs. IACR Cryptology ePrint Archive 2008: 371 (2008) - [i5]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Round Efficient Unconditionally Secure Multiparty Computation Protocol. IACR Cryptology ePrint Archive 2008: 399 (2008) - [i4]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 424 (2008) - [i3]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 425 (2008) - [i2]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Secure Multiparty Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2008: 462 (2008) - [i1]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. IACR Cryptology ePrint Archive 2008: 506 (2008) - 2007
- [j1]Lalit Gupta, Vinod Pathangay, Arpita Patra, A. Dyana, Sukhendu Das:
Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network. EURASIP J. Adv. Sig. Proc. 2007 (2007) - [c5]Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan:
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. CANS 2007: 80-101 - [c4]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007: 101-122 - [c3]Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan:
Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007: 322-323 - [c2]Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan:
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007: 496-498 - 2006
- [c1]Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan:
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006: 221-235
Coauthor Index
Ashish Choudhury
aka: Ashish Choudhary
aka: Ashish Choudhary
[c52] [c51] [i43] [i42] [j9] [c49] [c47] [i37] [c45] [j8] [c43] [i33] [j7] [c40] [i30] [c37] [c36] [i28] [j6] [c35] [i26] [j5] [c34] [c32] [c31] [i25] [i24] [i22] [j4] [c28] [c26] [c23] [i19] [i17] [j3] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [i16] [i15] [i13] [i12] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [i3] [i2] [i1] [c5] [c4] [c3] [c2] [c1]
C. Pandu Rangan
aka: Chandrasekaran Pandu Rangan
aka: Chandrasekaran Pandu Rangan
K. Srinathan
aka: Kannan Srinathan
aka: Kannan Srinathan
maintained by 
, founded at 
, founded at 
last updated on 2018-12-01 22:35 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
