48 search results - page 2 / 10 » Subquadratic Algorithms for 3SUM |
OPODIS
2003
13 years 6 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
INFOVIS
2002
IEEE
13 years 10 months ago
2002
IEEE
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...