Search for Author All Reviews
	Italiano, Giuseppe F.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Data structures resilient to memory faults: an experimental study of dictionaries Ferraro-Petrillo U., Grandoni F., Italiano G. Journal of Experimental Algorithmics 181.1-1.14, 2013.  Type: Article Soft errors in electronics equipment can be caused by alpha particles or noise, and can change data that is being processed. The chance of these errors occuring increases with the size and speed of the memory used by the component. Mem...... Dec 27 2013     Fully dynamic planarity testing with applications Galil Z., Italiano G., Sarnak N. Journal of the ACM 46(1): 28-91, 1999.  Type: Article Since 1974, it has been known how to test graphs for planarity inlinear time. This involves an O(n) algorithm to see if the abstract graph’s structurewith n vertices is embeddable in the ...... Nov 1 1999     Sparsification--a technique for speeding up dynamic graph algorithms Eppstein D., Galil Z., Italiano G., Nissenzweig A. Journal of the ACM 44(5): 669-696, 1997.  Type: Article As the authors observe, “graph algorithms are fundamental in computer science,” and therefore, so are the data structures that facilitate them. This paper introduces a data structure called a sparsification tree, wh...... Jun 1 1998     Data structures and algorithms for disjoint set union problems Galil Z., Italiano G. ACM Computing Surveys 23(3): 319-344, 1991.  Type: Article The authors survey solutions for various versions of the set union/find problem in which the operations of combining two sets and locating the set containing a particular element must be implemented. First, they examine the general pro...... Jul 1 1992
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy