Supartha Podder
Supartha Podder
Postdoc, University of Ottawa
Adresse e-mail validée de uottawa.ca - Page d'accueil
Titre
Citée par
Citée par
Année
New bounds for the garden-hose model
H Klauck, S Podder
arXiv preprint arXiv:1412.4904, 2014
102014
Two results about quantum messages
H Klauck, S Podder
International Symposium on Mathematical Foundations of Computer Science, 445-456, 2014
82014
Graph properties in node-query setting: effect of breaking symmetry
N Balaji, S Datta, R Kulkarni, S Podder
arXiv preprint arXiv:1510.08267, 2015
42015
Symmetries, graph properties, and quantum speedups
S Ben-David, AM Childs, A Gilyén, W Kretschmer, S Podder, D Wang
arXiv preprint arXiv:2006.12760, 2020
32020
How symmetric is too symmetric for large quantum speedups?
S Ben-David, S Podder
arXiv preprint arXiv:2001.09642, 2020
12020
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
R Kulkarni, S Podder
arXiv preprint arXiv:1509.06361, 2015
12015
Secure Software Leasing Without Assumptions
A Broadbent, S Jeffery, S Lord, S Podder, A Sundaram
arXiv preprint arXiv:2101.12739, 2021
2021
Communication memento: Memoryless communication complexity
S Arunachalam, S Podder
arXiv preprint arXiv:2005.04068, 2020
2020
Exploring Different Models of Query Complexity and Communication Complexity
S Podder
2016
Bounds For Classical And Quantum Communication Complexity
S Podder
Master Thesis, MPRI, École normale supérieure Paris-Saclay, 2011
2011
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–10