Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Bus-based shared memory multiprocessors with private caches and snooping write-invalidate cache coherence protocols are dominant form of small- to medium-scale parallel machines t...
: Search engines--"web dragons"--are the portals through which we access society's treasure trove of information. They do not publish the algorithms they use to sort...
Our previous work has shown that architectural and application shifts have resulted in modern OLTP databases increasingly falling short of optimal performance [10]. In particular,...
Robert Kallman, Hideaki Kimura, Jonathan Natkins, ...
: E-marketplaces present a business-to-business (B2B) trading environment in which firms can benefit from increased choice among trading partners, and other efficiencies gained thr...