Publications

Panconesi A, Srinivasan A. 1995. The local nature of Δ-coloring and its algorithmic applications. Combinatorica. 15(2):255-280.

Panconesi A, Srinivasan A. 1996. On the Complexity of Distributed Network Decomposition. Journal of Algorithms. 20(2):356-374.

Panconesi A, Srinivasan A. 1997. Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds. SIAM Journal on Computing. 26(2):350-350.

Panconesi A, Srinivasan A. 1992. Fast randomized algorithms for distributed edge coloring. Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. :251-262.

Panconesi A, Srinivasan A. 1992. Improved distributed algorithms for coloring and network decomposition problems. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing. :581-592.

Panjwani S, Tan S, Jarrin KM, Cukier M. 2005. An experimental evaluation to determine if port scans are precursors to an attack. :602-611.

Papadimitriou P, Tsaparas P, Fuxman A, Getoor L. 2012. TACI: Taxonomy-Aware Catalog Integration. IEEE Transactions on Knowledge and Data Engineering (TKDE).

Papageorge P, McCann J, Hicks MW. 2009. Passive aggressive measurement with MGRP. SIGCOMM Comput. Commun. Rev.. 39(4):279-290.

Papageorgiou P, Hicks MW. 2005. Merging Network Measurement with Data Transport. Passive and Active Network MeasurementPassive and Active Network Measurement. 3431:368-371.

Papaleo L, De Floriani L, Hendler J, Hui A. 2007. Towards a semantic web system for understanding real world representations. Proceedings of the Tenth International Conference on Computer Graphics and Artificial Intelligence.

Papaleo L, De Floriani L. 2009. Semantic-based segmentation and annotation of 3d models. Image Analysis and Processing–ICIAP 2009. :103-112.

Papamanthou C, Tamassia R, Triandopoulos N. 2011. Optimal Verification of Operations on Dynamic Sets. Advances in Cryptology – CRYPTO 2011. :91-110.

Papamanthou C, Paparrizos K, Samaras N. 2005. A parametric visualization software for the assignment problem. Yugoslav Journal of Operations Research. 15(1):147-158.

Papamanthou C, Tollis IG. 2010. Applications of Parameterized st-Orientations. Journal of Graph Algorithms and Applications. 14(2):337-365.

Papamanthou C, Tamassia R, Triandopoulos N. 2010. Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.

Papamanthou C, Shi E, Tamassia R, Yi K. 2013. Streaming Authenticated Data Structures. Advances in Cryptology – EUROCRYPT 2013. :353-370.

Papamanthou C, Tamassia R. 2007. Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. Information and Communications Security. :1-15.

Papamanthou C, Tollis IG. 2008. Algorithms for computing a parameterized st-orientation. Theoretical Computer Science. 408(2–3):224-240.

Papamanthou C, Paparrizos K, Samaras N. 2004. Computational experience with exterior point algorithms for the transportation problem. Applied Mathematics and Computation. 158(2):459-475.

Papamanthou C, Shi E, Tamassia R. 2013. Signatures of Correct Computation. Theory of Cryptography. :222-242.

Papamanthou C, Tamassia R, Triandopoulos N. 2008. Authenticated Hash Tables. CCS '08 Proceedings of the 15th ACM Conference on Computer and Communications Security . :437-448.

Papamanthou C, Paparrizos K, Samaras N, Stergiou K. 2008. Worst case examples of an exterior point algorithm for the assignment problem. Discrete Optimization. 5(3):605-614.

Papamanthou C, Paparrizos K. 2003. A Visualization of the Primal Simplex Algorithm for the Assignment Problem. ITiCSE '03 Proceedings of the 8th Annual Conference on Innovation and Technology in Computer Science Education . :267-267.

Papamanthou C, Preparata FP, Tamassia R. 2008. Algorithms for Location Estimation Based on RSSI Sampling. Algorithmic Aspects of Wireless Sensor Networks. :72-86.

Papamanthou C, Tollis IG. 2006. Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Graph Drawing. :355-367.

Pages

Publications