This paper illustrates the thesis research and process that led me to conceive, design and evaluate the Phototropic Memories device, a novel interface supporting the intimate shar...
Starting from an axiomatization of a generalization of Shannon entropy we introduce a set of axioms for a parametric family of distances over sets of partitions of finite sets. T...
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...