Showing papers by "Michael T. Goodrich published in 2014"
29 Jun 2014
TL;DR: In this article, it was shown that it is possible to achieve a memory wear bound of log logn + O(1) after the insertion of n items into a table of size Cn for a suitable constant C using cuckoo hashing.
Abstract: We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of loglogn + O(1) after the insertion of n items into a table of size Cn for a suitable constant C using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linear probing in practice.
21 citations
TL;DR: Galoois theory is used to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials, and that such solutions cannot be computed exactly even in extended computational models that include such operations.
Abstract: Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.
18 citations
Posted Content•
TL;DR: Wear-leveling techniques for cuckoo hashing are studied, showing that it is possible to achieve a memory wear bound of loglogn + O(1) after the insertion of n items into a table of size Cn for a suitable constant C using cuckoos hashing.
Abstract: We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of $\log\log n+O(1)$ after the insertion of $n$ items into a table of size $Cn$ for a suitable constant $C$ using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linear probing in practice.
11 citations
24 Sep 2014
TL;DR: Galoois theory is used to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials, and that such solutions cannot be computed exactly even in extended computational models that include such operations.
Abstract: Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.
10 citations
Posted Content•
TL;DR: In this paper, the authors studied balanced circle packings and circle contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle diameter is polynomial in the number of circles.
Abstract: We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle's diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.
10 citations
24 Sep 2014
TL;DR: A number of positive and negative results are provided for the existence of balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largestcircle's diameter to the smallest circle's diameter is polynomial in the number of circles.
Abstract: We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle's diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.
5 citations
Book•
27 May 2014
1 citations