Aggarwal, D.
, Damgård, I., Nielsen, J. B., Obremski, M., Purwanto, E., Ribeiro, J.
& Simkin, M. (2019).
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. I A. Boldyreva & D. Micciancio (red.),
Advances in Cryptology – CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Bind II, s. 510-539). Springer.
https://doi.org/10.1007/978-3-030-26951-7_18
Aggarwal, D.
, Obremski, M., Ribeiro, J.
, Simkin, M. & Siniscalchi, L. (2022).
Privacy Amplification with Tamperable Memory via Non-Malleable Two-Source Extractors.
IEEE Transactions on Information Theory,
68(8), 5475-5495.
https://doi.org/10.1109/TIT.2022.3167404
Agarwal , P. K., Graham , G.
, Huang, Z., Phillips, J.
, Wei, Z. & Yi, K. (2013).
Mergeable summaries.
A C M Transactions on Database Systems,
38(4), Artikel 26 .
https://doi.org/10.1145/2500128
Agarwal, P. K., Mølhave, T.
, Revsbæk, M., Safa, I., Wang, Y.
& Yang, J. (2015).
Maintaining Contour Trees of Dynamic Terrains. I L. Arge & J. Pach (red.),
31st International Symposium on Computational Geometry (SoCG 2015) (s. 796-811)
https://doi.org/10.4230/LIPIcs.SOCG.2015.796
Agarwal, P.
, Arge, L., Erickson, J., Yu, H., Albers, S. (red.) & Radzik, T. (red.) (2004).
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. I
Ikke angivet (3221 i Lecture Notes in Computer Science udg., s. 4-15). Springer.
Agarwal, S. & Frandsen, G. S. (2004).
Binary GCD like Algorithms for Some Complex Quadratic Rings. I D. Buell (red.),
Algorithmic Number Theory: 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings (s. 57-71). Springer.
https://doi.org/10.1007/978-3-540-24847-7_4
Agarwal, P. K.
, Arge, L. A., Erickson, J., Franciosa, P. G. & Vitter, J. S. (2000).
Efficient Searching with Linear Constraints.
Journal of Computer and System Sciences,
61, Issue 2, 194-216.
https://doi.org/10.1006/jcss.2000.1709
Agarwal, P. K.
, Arge, L. A., Erickson, J. & Yu, H. (2004).
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. I S. Albers & T. Radzik (red.),
Algorithms - ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings (s. 4-15). Springer.
https://doi.org/10.1007/978-3-540-30140-0_3
Agarwal, P. K.
, Arge, L. A., Yang, J. & Yi, K. (2003).
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. I G. Di Battista & U. Zwick (red.),
Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003. Proceedings (s. 7-18). Springer.
https://doi.org/10.1007/978-3-540-39658-1_4
Agarwal, P. K.
, Arge, L. A. & Vahrenhold, J. (2001).
Time Responsive External Data Structures for Moving Points. I F. Dehne, J.-R. Sack & R. Tamassia (red.),
Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (s. 50-61). Springer.
https://doi.org/10.1007/3-540-44634-6_6
Agarwal, P. K.
, Arge, L. A., Procopiuc, O. & Vitter, J. S. (2001).
A Framework for Index Bulk Loading and Dynamization. I F. Orejas, P. G. Spirakis & J. van Leeuwen (red.),
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8-12, 2001 Proceedings (s. 115-127). Springer.
https://doi.org/10.1007/3-540-48224-5_10