default search action
Ashish Choudhury
Ashish Choudhary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Ashish Choudhury
:
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience. Theor. Comput. Sci. 995: 114492 (2024) - [c66]Nidhish Bhimrajka
Network-Agnostic Multi-party Computation Revisited (Extended Abstract). Public Key Cryptography (2) 2024: 171-204 - 2023
- [j20]Ashish Choudhury, Arpita Patra:
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. J. Cryptol. 36(2): 13 (2023) - [j19]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries. J. Cryptol. 36(3): 16 (2023) - [j18]Ananya Appan
Perfectly-Secure Synchronous MPC With Asynchronous Fallback Guarantees. IEEE Trans. Inf. Theory 69(8): 5386-5425 (2023) - [c65]Ashish Choudhury
Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience ✱. ICDCN 2023: 167-176 - [c64]Nidhish Bhimrajka
Network-Agnostic Perfectly Secure Message Transmission Revisited. INDOCRYPT (2) 2023: 25-44 - [c63]Nidhish Bhimrajka
Privacy-Preserving Plagiarism Checking. INDOCRYPT (2) 2023: 105-125 - [c62]Ananya Appan
Network Agnostic MPC with Statistical Security. TCC (2) 2023: 63-93 - [c61]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Network Agnostic Perfectly Secure MPC Against General Adversaries. DISC 2023: 3:1-3:19 - [i45]Ananya Appan, Ashish Choudhury:
Network Agnostic MPC with Statistical Security. CoRR abs/2306.01401 (2023) - [i44]Ananya Appan, Ashish Choudhury:
Network Agnostic MPC with Statistical Security. IACR Cryptol. ePrint Arch. 2023: 820 (2023) - 2022
- [j17]Anirudh Chandramouli
A Survey on Perfectly Secure Verifiable Secret-sharing. ACM Comput. Surv. 54(11s): 232:1-232:36 (2022) - [c60]Ananya Appan, Anirudh Chandramouli
Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. INDOCRYPT 2022: 223-248 - [c59]Ananya Appan, Anirudh Chandramouli
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. PODC 2022: 92-102 - [i43]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. CoRR abs/2201.12194 (2022) - [i42]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries. CoRR abs/2205.13169 (2022) - [i41]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries. CoRR abs/2208.06223 (2022) - [i40]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. IACR Cryptol. ePrint Arch. 2022: 109 (2022) - [i39]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries. IACR Cryptol. ePrint Arch. 2022: 651 (2022) - [i38]Ashish Choudhury, Arpita Patra:
On the Communication Efficiency of Statistically-Secure Asynchronous MPC with Optimal Resilience. IACR Cryptol. ePrint Arch. 2022: 913 (2022) - [i37]Ashish Choudhury:
Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience. IACR Cryptol. ePrint Arch. 2022: 917 (2022) - [i36]Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries. IACR Cryptol. ePrint Arch. 2022: 1047 (2022) - 2021
- [i35]Anirudh C, Ashish Choudhury, Arpita Patra:
A Survey on Perfectly-Secure Verifiable Secret-Sharing. CoRR abs/2112.11393 (2021) - [i34]Anirudh C, Ashish Choudhury, Arpita Patra:
A Survey on Perfectly-Secure Verifiable Secret-Sharing. IACR Cryptol. ePrint Arch. 2021: 445 (2021) - 2020
- [j16]Laasya Bangalore, Ashish Choudhury
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM 67(3): 14:1-14:59 (2020) - [c58]Ashish Choudhury
Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract). INDOCRYPT 2020: 786-809 - [c57]Ashish Choudhury
Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation. INDOCRYPT 2020: 810-831 - [c56]Ashish Choudhury
High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract). INDOCRYPT 2020: 832-855 - [c55]Ashish Choudhury
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. PODC 2020: 169-171 - [c54]Ashish Choudhury
Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited. DISC 2020: 44:1-44:3 - [i33]Ashish Choudhury:
Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited. IACR Cryptol. ePrint Arch. 2020: 906 (2020)
2010 – 2019
- 2019
- [c53]Harsh Chaudhari, Ashish Choudhury
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CCSW 2019: 81-92 - [c52]Laasya Bangalore, Ashish Choudhury
Round efficient computationally secure multi-party computation revisited. ICDCN 2019: 292-301 - [i32]Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh:
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CoRR abs/1912.02592 (2019) - [i31]Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh:
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. IACR Cryptol. ePrint Arch. 2019: 429 (2019) - 2018
- [c51]Rishabh Bhadauria
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited. PODC 2018: 265-267 - [c50]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC 2018: 295-304 - [c49]Ashish Choudhury
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO 2018: 55-71 - [i30]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. IACR Cryptol. ePrint Arch. 2018: 394 (2018) - [i29]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptol. ePrint Arch. 2018: 436 (2018) - 2017
- [j15]Ashish Choudhury
An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Inf. Theory 63(1): 428-468 (2017) - [c48]Ashish Choudhury:
Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority. ICDCN 2017: 1 - [c47]Ashish Choudhury
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. ICITS 2017: 83-109 - [c46]Ashish Choudhury
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - [i28]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. IACR Cryptol. ePrint Arch. 2017: 1006 (2017) - 2016
- [c45]Ashish Choudhury
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN 2016: 147-168 - 2015
- [j14]Arpita Patra, Ashish Choudhury
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. J. Cryptol. 28(1): 49-109 (2015) - [c44]Ashish Choudhury
Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015: 5:1-5:10 - [c43]Ashish Choudhury
Asynchronous Error-Decodable Secret-Sharing and Its Application. ICISS 2015: 364-377 - [i27]Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Robust MPC with Honest Majority Using Preprocessing. IACR Cryptol. ePrint Arch. 2015: 705 (2015) - 2014
- [j13]Arpita Patra, Ashish Choudhury
Asynchronous Byzantine Agreement with optimal resilience. Distributed Comput. 27(2): 111-146 (2014) - [c42]Michael Backes, Fabian Bendun, Ashish Choudhury
Asynchronous MPC with a strict honest majority using non-equivocation. PODC 2014: 10-19 - [c41]Ashish Choudhury
Reducing the Overhead of MPC over a Large Population. SCN 2014: 197-217 - [i26]Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of Cloud MPC. IACR Cryptol. ePrint Arch. 2014: 105 (2014) - 2013
- [c40]Ashish Choudhury
Between a Rock and a Hard Place: Interpolating between MPC and FHE. ASIACRYPT (2) 2013: 221-240 - [c39]Ashish Choudhury
Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation - (Extended Abstract). INDOCRYPT 2013: 19-37 - [c38]Ashish Choudhury
Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013: 388-402 - [i25]Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating Between MPC and FHE. IACR Cryptol. ePrint Arch. 2013: 85 (2013) - [i24]Michael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate:
Asynchronous MPC with t<n/2 Using Non-equivocation. IACR Cryptol. ePrint Arch. 2013: 745 (2013) - 2012
- [j12]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury
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) - [c37]Ashish Choudhury
Brief announcement: optimal amortized secret sharing with cheater identification. PODC 2012: 101-102 - [c36]Ashish Choudhury
Brief announcement: efficient optimally resilient statistical AVSS and its applications. PODC 2012: 103-104 - [i23]Ashish Choudhury, Martin Hirt, Arpita Patra:
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. IACR Cryptol. ePrint Arch. 2012: 517 (2012) - 2011
- [j11]Ashish Choudhury
Secure message transmission in asynchronous networks. J. Parallel Distributed Comput. 71(8): 1067-1074 (2011) - [c35]Ashish Choudhury
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011: 292-308 - [c34]Ashish Choudhury
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. ICISC 2011: 450-466 - [c33]Ashish Choudhury
The Round Complexity of Perfectly Secure General VSS. ICITS 2011: 143-162 - [i22]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. IACR Cryptol. ePrint Arch. 2011: 27 (2011) - [i21]Ashish Choudhury, Arpita Patra:
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 2011: 31 (2011) - [i20]Ashish Choudhury, Arpita Patra:
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. IACR Cryptol. ePrint Arch. 2011: 288 (2011) - [i19]Ashish Choudhury:
Simple and Asymptotically Optimal t-Cheater Identifiable Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 2011: 330 (2011) - 2010
- [j10]Arpita Patra, Ashish Choudhury
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. Int. J. Appl. Cryptogr. 2(2): 159-197 (2010) - [c32]Arpita Patra, Ashish Choudhary
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010: 184-202 - [c31]Arpita Patra, Ashish Choudhary
On Communication Complexity of Secure Message Transmission in Directed Networks. ICDCN 2010: 42-53 - [c30]Arpita Patra, Ashish Choudhury
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. PODC 2010: 245-246 - [i18]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. IACR Cryptol. ePrint Arch. 2010: 7 (2010) - [i17]Ashish Choudhury:
Protocols for Reliable and Secure Message Transmission. IACR Cryptol. ePrint Arch. 2010: 281 (2010) - [i16]Ashish Choudhury, Kaoru Kurosawa, Arpita Patra:
The Round Complexity of General VSS. IACR Cryptol. ePrint Arch. 2010: 609 (2010)
2000 – 2009
- 2009
- [j9]Arpita Patra, Ashish Choudhary
Perfectly reliable and secure message transmission tolerating mobile adversary. Int. J. Appl. Cryptogr. 1(3): 200-224 (2009) - [j8]Ashish Choudhary
Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules. Int. J. Comput. Math. 86(4): 567-576 (2009) - [c29]G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. CANS 2009: 21-40 - [c28]Kannan Srinathan, Arpita Patra, Ashish Choudhary
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. AsiaCCS 2009: 171-182 - [c27]Arpita Patra, Ashish Choudhary
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. Inscrypt 2009: 179-197 - [c26]Arpita Patra, Ashish Choudhary
The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009: 487-504 - [c25]Ashish Choudhary
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162 - [c24]Arpita Patra, Ashish Choudhary
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. ICITS 2009: 74-92 - [c23]Arpita Patra, Ashish Choudhary
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. INDOCRYPT 2009: 398-417 - [c22]Arpita Patra, Ashish Choudhary
Simple and efficient asynchronous byzantine agreement with optimal resilience. PODC 2009: 92-101 - [c21]Arpita Patra, Ashish Choudhary
Brief announcement: perfectly secure message transmission in directed networks re-visited. PODC 2009: 278-279 - [c20]Arpita Patra, Ashish Choudhary
Information Theoretically Secure Multi Party Set Intersection Re-visited. Selected Areas in Cryptography 2009: 71-91 - [i15]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Information Theoretically Secure Multi Party Set Intersection Re-Visited. IACR Cryptol. ePrint Arch. 2009: 116 (2009) - [i14]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 Cryptol. ePrint Arch. 2009: 311 (2009) - [i13]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. IACR Cryptol. ePrint Arch. 2009: 470 (2009) - [i12]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 2009: 492 (2009) - 2008
- [c19]Arpita Patra, Ashish Choudhary
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186 - [c18]Kannan Srinathan, Arpita Patra, Ashish Choudhary
Unconditionally Reliable Message Transmission in Directed Hypergraphs. CANS 2008: 285-303 - [c17]Ashish Choudhary
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155 - [c16]Arpita Patra, Ashish Choudhary
Round Efficient Unconditionally Secure Multiparty Computation Protocol. INDOCRYPT 2008: 185-199 - [c15]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 - [c14]Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan:
Efficient single phase unconditionally secure message transmission with optimum communication complexity. PODC 2008: 457 - [c13]Arpita Patra, Ashish Choudhary
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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2008: 141 (2008) - [i9]Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. IACR Cryptol. ePrint Arch. 2008: 172 (2008) - [i8]Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptol. ePrint Arch. 2008: 232 (2008) - [i7]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Statistically Reliable and Secure Message Transmission in Directed Networks. IACR Cryptol. ePrint Arch. 2008: 262 (2008) - [i6]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Reliable Message Transmission in Directed Hypergraphs. IACR Cryptol. ePrint Arch. 2008: 371 (2008) - [i5]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Round Efficient Unconditionally Secure Multiparty Computation Protocol. IACR Cryptol. ePrint Arch. 2008: 399 (2008) - [i4]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptol. ePrint Arch. 2008: 424 (2008) - [i3]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Multiparty Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 2008: 425 (2008) - [i2]Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Secure Multiparty Set Intersection Re-Visited. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2008: 506 (2008) - 2007
- [j7]Ashish Choudhary
Network of evolutionary processors with splicing rules and permitting context. Biosyst. 87(2-3): 111-116 (2007) - [j6]Ashish Choudhary
Returning and non-returning parallel communicating finite automata are equivalent. RAIRO Theor. Informatics Appl. 41(2): 137-145 (2007) - [j5]Anirulddlha Datta, Ranadip Pal
Control approaches for probabilistic gene regulatory networks - What approaches have been developed for addreassinig the issue of intervention? IEEE Signal Process. Mag. 24(1): 54-63 (2007) - [c12]Arpita Patra, Bhavani Shankar, Ashish Choudhary
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. CANS 2007: 80-101 - [c11]Kannan Srinathan, Arpita Patra, Ashish Choudhary
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007: 101-122 - [c10]Arpita Patra, Ashish Choudhary
Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007: 322-323 - [c9]Arpita Patra, Ashish Choudhary
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007: 496-498 - 2006
- [b1]Ashish Choudhary:
Intervention in gene regulatory networks. Texas A&M University, College Station, USA, 2006 - [j4]Ashish Choudhary, Aniruddha Datta, Michael L. Bittner, Edward R. Dougherty:
Intervention in a family of Boolean networks. Bioinform. 22(2): 226-232 (2006) - [j3]Ashish Choudhary, Marcel Brun
Genetic test bed for feature selection. Bioinform. 22(7): 837-842 (2006) - [c8]Ashish Choudhary, Aniruddha Datta, Michael L. Bittner, Edward R. Dougherty:
Optimal Control in a Family of Boolean Networks. CDC 2006: 4200-4205 - [c7]Arpita Patra, Ashish Choudhary
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006: 221-235 - 2005
- [c6]Ashish Choudhary, Aniruddha Datta, Michael L. Bittner, Edward R. Dougherty:
Assignment of terminal penalties in controlling genetic regulatory networks. ACC 2005: 417-422vol.1 - [c5]Ashish Choudhary:
Accepting Hybrid Networks of Evolutionary Processors with Splicing Rules and Forbidding Context. IICAI 2005: 2686-2698 - [c4]Ashish Choudhary
Network of Evolutionary Processors with Splicing Rules. IWINAC (1) 2005: 290-299 - [c3]Ashish Choudhary
Network of Evolutionary Processors with Splicing Rules and Forbidding Context. IWINAC (1) 2005: 300-309 - 2004
- [j2]Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty:
External control in Markovian genetic regulatory networks: the imperfect information case. Bioinform. 20(6): 924-930 (2004) - 2003
- [j1]Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty:
External Control in Markovian Genetic Regulatory Networks. Mach. Learn. 52(1-2): 169-191 (2003) - [c2]Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty:
External control in Markovian genetic regulatory networks. ACC 2003: 3614-3619 - [c1]Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty:
Application of dynamic programming in genetic regulatory networks. CDC 2003: 2817-2822
Coauthor Index
Anirudh C
aka: Anirudh Chandramouli
aka: Anirudh Chandramouli
[j20] [j17] [i38] [i35] [i34] [j16] [c53] [i32] [i31] [c50] [c49] [i30] [i29] [j15] [c47] [c46] [i28] [c45] [j14] [c44] [i27] [j13] [c41] [i26] [c40] [c38] [i25] [j12] [c36] [i23] [j11] [c35] [c34] [c33] [i22] [i21] [i20] [j10] [c32] [c31] [c30] [i18] [i16] [j9] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [i15] [i14] [i13] [i12] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [i3] [i2] [i1] [c12] [c11] [c10] [c9] [c7]
C. Pandu Rangan
aka: Chandrasekaran Pandu Rangan
aka: Chandrasekaran Pandu Rangan
K. Srinathan
aka: Kannan Srinathan
aka: Kannan Srinathan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: