Publications
Export 326 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is P [Clear All Filters]
2008. Worst case examples of an exterior point algorithm for the assignment problem. Discrete Optimization. 5(3):605-614.
2008. Algorithms for computing a parameterized st-orientation. Theoretical Computer Science. 408(2–3):224-240.
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.
2008. Authenticated Hash Tables. CCS '08 Proceedings of the 15th ACM Conference on Computer and Communications Security . :437-448.
2010. On the initialization methods of an exterior point algorithm for the assignment problem. International Journal of Computer Mathematics. 87(8):1831-1846.
2010. Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.
2006. Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Graph Drawing. :355-367.
2007. Towards a semantic web system for understanding real world representations. Proceedings of the Tenth International Conference on Computer Graphics and Artificial Intelligence.
2009. Semantic-based segmentation and annotation of 3d models. Image Analysis and Processing–ICIAP 2009. :103-112.
2005. Merging Network Measurement with Data Transport. Passive and Active Network MeasurementPassive and Active Network Measurement. 3431:368-371.
2012. TACI: Taxonomy-Aware Catalog Integration. IEEE Transactions on Knowledge and Data Engineering (TKDE).
1992. Fast randomized algorithms for distributed edge coloring. Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. :251-262.
1995. The local nature of Δ-coloring and its algorithmic applications. Combinatorica. 15(2):255-280.
1997. Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds. SIAM Journal on Computing. 26(2):350-350.
1992. Improved distributed algorithms for coloring and network decomposition problems. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing. :581-592.
2005. Evolutionary discovery of arbitrary self-replicating structures. Computational Science–ICCS 2005. :404-411.
2003. Footloose: a case for physical eventual consistency and selective conflict resolution. Mobile Computing Systems and Applications, 2003. Proceedings. Fifth IEEE Workshop on. :170-179.
2006. An architecture for adaptive intrusion-tolerant applications. Software: Practice and Experience. 36(11-12):1331-1354.