• Aggarwal, A., Gupta, D., Saia, J. Sybil Defense Against an Adaptive Adversary. Under Preparation. (2019)
  • Erickson, J., Aggarwal, A., Moses, M. Blackbox Analysis of Genetically Evolved Swarm Foraging Algorithms. Under Preparation. (2019)
  • Aggarwal, A., Gupta, D., Fricke, G.M., Vinings, W., Moses, M. On Site Fidelity and the Price of Ignorance in Swarm Foraging Algorithms. Submitted for review. (2019)
  • Aggarwal, A., Mohavedi, M., Saia, J., Zamani, M. Bootstrapping Blockchains without a Trusted Setup. Submitted for review. (2019)
  • Aggarwal, A., Dani, V., Hayes, Thomas P., Saia, J. Multiparty Interactive Communication with Private Channels. Submitted for review. (2019) [pdf
  • Aggarwal, A., Sinha, R., Christodorescu, M. Oblivious Filtering of Data Streams. Under Preparation. (2019) [pdf]
  • Aggarwal, A., Dani, V., Hayes, Thomas P., Saia, J. Sending a Message with Unknown Noise.  ICDCN 2018 [pdf] [talk]
  • Aggarwal, A., Zamani, M., Christodorescu, M. Revisiting Remote-Attack Prevention: Challenges in Achieving Complete Decentralization. (Technical Report) (2018) [pdf]
  • Aggarwal, A., Guo, Y. A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks. ( 20180116:131918) (2018). [pdf]
  • Aggarwal, A., Zamani, M., Christodorescu, M. Incentive-Driven Remote Configuration of Security Gateways. (arXiv: 1709.04569) (2017) [pdf] [talk] [poster]
  • Aggarwal, A., Castellanos Joo, J. A., Gupta, D. Beating the Multiplicative Weights Update Algorithm. (arXiv: 1708.04668) (2017) [pdf
  • Aggarwal, A. On the Equivalence of Probabilistic Automata: A Brief Literature Review. Technical Report. UNM 2015. [pdf] [talk]
  • Aggarwal, A. Evolving Random Sequences using a Genetic Algorithm. Technical Report. UNM 2015. [pdf]
  • Aggarwal, A. Probabilistic Programs and their Verification: A Brief Survey. Technical Report. UNM 2014. [pdf]


  • Aggarwal, A., Sinha, R., Christodorescu, M. On Oblivious Filtering of Data Streams. (Pending) Patent, VISA Research (2018).
  • Ren, J., Aggarwal, A., Salajegheh, M. System, Method, and Computer Program Product for Maintaining User Privacy in Advertisement Networks. (Pending) Patent, VISA Research (2018).
  • Aggarwal, A., Zamani. M. Sybil-Resistant Identity Generation. (Pending) Patent, VISA Research (2018).
  • Freeman, C., Aggarwal, A., Merriman, J., Beaver, I. Model-Agnostic Visualizations using Linear Programming Approximation. (Pending) Patent, Verint Intelligent Self-Service (2018).
  • Freeman, C., Merriman, J., Aggarwal, A., Beaver, I., Mueen, A. Paying Attention to Attention: Highlighting Influential Samples in Sequential Analysis. (Pending) Patent, Verint Intelligent Self-Service (2018).
  • Aggarwal, A., Zamani. M, Christodorescu, M. Remote Configuration of Security Gateways. (Provisional) Patent, VISA Research (2017).

Projects Completed Prior to my Ph.D.

Some of the projects I completed as part of my Master’s thesis and other coursework at the Indian Institute of Technology, Roorkee is listed as follows.

  • Aggarwal, A., A Similarity Criterion for Sequential Programs using Truth-Preserving Partial Functions. (arXiv: 1708.05640) Master’s Thesis (2014). [pdf
  • Aggarwal, A., Kumar, PA Theory of Function-Induced Orders to Study Recursion Termination. Technical Report. IITR 2013. [pdf]
  • Aggarwal, A., Srivastava, R., Malik, S., Meena, K., Poonam. Virtual Differential Storage Based k-Rollback Concurrency Control Algorithm in Distributed Shared Memory Systems. Technical Report. IITR 2012. [pdf]
  • Jaya, Malik, S., Aggarwal, A., Sardana, A. Novel Authentication System using Visual Cryptography. In Information and Communication Technologies (WICT), World Congress (pp. 1181-1186), IEEE (2011). [pdf]

NOTE: In theoretical computer science, it is standard to list author names in alphabetical order. 

Some Interesting/Important/Useful Facts/Links

  1. Dr. Jared Saia’s Technical Blog: Machinations. (link)
  2. Dr. Terrence Tao’s Blog. (link)
  3. Dr. Donald Knuth’s Webpage. (link)
  4. Entropy Function and its bounds: 4x(1-x) \le H(x) \le 0.11 + 4x(1-x) for all x \in [0,1]. Here H(x) = -x\log_2 x - (1-x)\log_2 (1-x)(plot)