Publications

Search
Export 479 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is D  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
D
Danovaro E, De Floriani L, Magillo P, Puppo E.  2003.  Data structures for 3D Multi-Tessellations: an overview. Data Visualization: The State of the ArtData Visualization: The State of the Art. :239-256.
Danovaro E, De Floriani L, Puppo E, Samet H.  2007.  Out-of-core Multi-resolution Terrain Modeling. Spatial data on the Web: modeling and management. :43-43.
Danovaro E, De Floriani L, Magillo P, Mesmoudi M M, Puppo E.  2003.  Morphology-driven simplification and multiresolution modeling of terrains. Proceedings of the 11th ACM international symposium on Advances in geographic information systems. :63-70.
Danovaro E, De Floriani L, Puppo E, Samet H.  2006.  Out–of–Core Multiresolution Terrain Modeling. Modeling and Management of Geographical Data over Distributed Architectures. Springer–Verlag.
Danovaro E, De Floriani L, Papaleo L, Vitali M.  2006.  A multi-resolution representation for terrain morphology. Geographic Information Science. :33-46.
Dangle KC, Larsen P, Shaw M, Zelkowitz MV.  2005.  Software process improvement in small organizations: a case study. Software, IEEE. 22(6):68-75.
Dang G, North C, Shneiderman B.  2005.  Dynamic Queries and Brushing on Choropleth Maps (2001). Institute for Systems Research Technical Reports.
Dang G, North C, Shneiderman B.  2001.  Dynamic queries and brushing on choropleth maps. Fifth International Conference on Information Visualisation, 2001. Proceedings. :757-764.
Dancik V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
DANČÍK V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping. Journal of Computational Biology. 4(2):119-125.
Dagon D, Feamster N, Lee W, Edmonds R, Lipton R, Ramachandran A.  2008.  Method and System for Detecting and Responding to Attacking Networks. 11/538,212
Daescu O, Luo J, Mount D.  2006.  Proximity problems on line segments spanned by points. Computational Geometry. 33(3):115-129.
Dachman-Soled D, Gennaro R, Krawczyk H, Malkin T.  2012.  Computational Extractors and Pseudorandomness. Theory of Cryptography. :383-403.
Dachman-Soled D.  2014.  On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public-Key Cryptography – PKC 2014. :574-591.
Dachman-Soled D, Mahmoody M, Malkin T.  2014.  Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.
Dachman-Soled D, Kalai YTauman.  2012.  Securing Circuits against Constant-Rate Tampering. Advances in Cryptology – CRYPTO 2012. :533-551.
Dachman-Soled D, Frenkel AI.  2007.  Geometrical Characteristics of Regular Polyhedra: Application to EXAFS Studies of Nanoclusters. X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference. 882:746-748.
Dachman-Soled D, Malkin T, Raykova M, Venkitasubramaniam M.  2013.  Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. Advances in Cryptology - ASIACRYPT 2013. :316-336.
Dachman-Soled D, Malkin T, Raykova M, Yung M.  2011.  Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. Applied Cryptography and Network Security. :130-146.
Dachman-Soled D, Malkin T, Raykova M, Yung M.  2009.  Efficient Robust Private Set Intersection. Applied Cryptography and Network Security. :125-142.
Dachman-Soled D, Servedio RA.  2011.  A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
Dachman-Soled D, Lee HK, Malkin T, Servedio RA, Wan A, Wee H.  2008.  Optimal Cryptographic Hardness of Learning Monotone Functions. Automata, Languages and Programming. :36-47.
Dachman-Soled D, Sreedhar V.C..  2007.  Configuration Reasoning and Ontology For Web. IEEE International Conference on Services Computing, 2007. SCC 2007. :387-394.
Dachman-Soled D, Servedio RA.  2007.  Distribution-Free Testing Lower Bounds for Basic Boolean Functions. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :494-508.
Dachman-Soled D, Lindell Y, Mahmoody M, Malkin T.  2011.  On the Black-Box Complexity of Optimally-Fair Coin Tossing. Theory of Cryptography. :450-467.

Pages