 | 2010 |
| 14 |  | Denis Xavier Charles,
Max Chickering,
Nikhil R. Devanur,
Kamal Jain,
Manan Sanghi:
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.
ACM Conference on Electronic Commerce 2010: 121-128 |
| 13 |  | Sven Seuken,
Denis Xavier Charles,
Max Chickering,
Sidd Puri:
Market design & analysis for a P2P backup system.
ACM Conference on Electronic Commerce 2010: 97-108 |
| 2009 |
| 12 |  | Sven Seuken,
Denis Xavier Charles,
Max Chickering,
Sidd Puri:
Market Design for a P2P Backup System.
AMMA 2009: 55-57 |
| 11 |  | Denis Xavier Charles,
Kristin E. Lauter,
Eyal Z. Goren:
Cryptographic Hash Functions from Expander Graphs.
J. Cryptology 22(1): 93-113 (2009) |
| 2008 |
| 10 |  | Denis Xavier Charles,
Kumar Chellapilla:
Bloomier Filters: A Second Look.
ESA 2008: 259-270 |
| 9 |  | Reinier Bröker,
Denis Xavier Charles,
Kristin Lauter:
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography.
Pairing 2008: 100-112 |
| 8 |  | Denis Xavier Charles,
Kumar Chellapilla:
Bloomier Filters: A second look
CoRR abs/0807.0928: (2008) |
| 2007 |
| 7 |  | Kumar Chellapilla,
Anton Mityagin,
Denis Xavier Charles:
GigaHash: scalable minimal perfect hashing for billions of urls.
WWW 2007: 1165-1166 |
| 6 |  | Denis Xavier Charles:
Counting lattice vectors.
J. Comput. Syst. Sci. 73(6): 962-972 (2007) |
| 2006 |
| 5 |  | Denis Xavier Charles:
On the existence of distortion maps on ordinary elliptic curves.
IACR Cryptology ePrint Archive 2006: 128 (2006) |
| 4 |  | Denis Xavier Charles,
Eyal Z. Goren,
Kristin Lauter:
Cryptographic hash functions from expander graphs.
IACR Cryptology ePrint Archive 2006: 21 (2006) |
| 3 |  | Denis Xavier Charles,
Kamal Jain,
Kristin Lauter:
Signatures for Network Coding.
IACR Cryptology ePrint Archive 2006: 25 (2006) |
| 2004 |
| 2 |  | Denis Xavier Charles,
Kristin Lauter:
Computing Modular Polynomials.
IACR Cryptology ePrint Archive 2004: 189 (2004) |
| 2001 |
| 1 |  | Denis Xavier Charles:
A Note on Subgroup Membership Problem for PSL(2,p).
Electronic Colloquium on Computational Complexity (ECCC) 8(29): (2001) |