Journal: Algorithmica

Found 758 papers in total
A Tutorial for Designing Flexible Geometric Algorithms
A Tutorial for Designing Flexible Geometric Algorithms
2002,
The implementation of an algorithm is faced with the issues of efficiency,...
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
2002,
{In this paper we design and analyze a neural approximation algorithm for the Maximum...
Experimental Performance of Shared {RSA} Modulus Generation
Experimental Performance of Shared {RSA} Modulus Generation
2002,
Many distributed protocols require the participants to have secret shares of an RSA...
Efficient Bulk Operations on Dynamic R‐Trees
Efficient Bulk Operations on Dynamic R‐Trees
2002,
In recent years there has been an upsurge of interest in spatial databases. A major...
Quasi‐Fully Dynamic Algorithms for Two‐Connectivity and Cycle Equivalence
Quasi‐Fully Dynamic Algorithms for Two‐Connectivity and Cycle Equivalence
2002,
We introduce a new class of dynamic graph algorithms called quasi‐fully dynamic...
Efficient Parallel Graph Algorithms for Coarse‐Grained Multicomputers and BSP
Efficient Parallel Graph Algorithms for Coarse‐Grained Multicomputers and BSP
2002,
In this paper we present deterministic parallel algorithms for the...
Exact and Approximation Algorithms for Clustering
Exact and Approximation Algorithms for Clustering
2002,
In this paper we present an nˆ O(k 1‐1/d ) ‐time algorithm for...
Computing Approximate Shortest Paths on Convex Polytopes
Computing Approximate Shortest Paths on Convex Polytopes
2002,
The algorithms for computing a shortest path on a polyhedral surface are slow,...
Augmenting Trees to Meet Biconnectivity and Diameter Constraints
Augmenting Trees to Meet Biconnectivity and Diameter Constraints
2002,
Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a...
Fast Algorithms for Approximating Distances
Fast Algorithms for Approximating Distances
2002,
In this paper we present efficient approximation algorithms for the distance selection...
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
2002,
The construction of full-text indexes on very large text collections is nowadays a hot...
Fast Parallel Reordering and Isomorphism Testing of k ‐Trees
Fast Parallel Reordering and Isomorphism Testing of k ‐Trees
2002,
In this paper two problems on the class of k ‐trees, a subclass of the class of...
Algorithms for Coloring Quadtrees
Algorithms for Coloring Quadtrees
2002,
We describe simple linear time algorithms for coloring the squares of balanced and...
Computing the Cover Array in Linear Time
Computing the Cover Array in Linear Time
2002,
Let x denote a given nonempty string of length n = |x| . A proper...
Interleaved Prefetching
Interleaved Prefetching
2002,
We consider the problem of interleaving sequences of positive and negative numbers in...
Exploring Unknown Environments with Obstacles
Exploring Unknown Environments with Obstacles
2002,
We study exploration problems where a robot has to construct a complete map of an...
Optimal Time‐Critical Scheduling via Resource Augmentation
Optimal Time‐Critical Scheduling via Resource Augmentation
2002,
We consider two fundamental problems in dynamic scheduling: scheduling to meet...
On the Competitive Theory and Practice of Online List Accessing Algorithms
On the Competitive Theory and Practice of Online List Accessing Algorithms
2002,
This paper concerns the online list accessing problem. In the first part of the paper...
A Divide‐and‐Conquer Approach to the Minimum k ‐Way Cut Problem
A Divide‐and‐Conquer Approach to the Minimum k ‐Way Cut Problem
2002,
This paper presents algorithms for computing a minimum 3 ‐way cut and a minimum...
New Algorithms for Disk Scheduling
New Algorithms for Disk Scheduling
2002,
Processor speed and memory capacity are increasing several times faster than disk...
A Permanent Algorithm with exp[O (n ˆ{1/3}/2 ln n )] Expected Speedup for 0‐1 Matrices
A Permanent Algorithm with exp[O (n ˆ{1/3}/2 ln n )] Expected Speedup for 0‐1 Matrices
2002,
This paper outlines a permanent algorithm with mildly exponential expected speedup...
On‐Line Multi‐Threaded Paging
On‐Line Multi‐Threaded Paging
2002,
In this paper we introduce a generalization of Paging to the case where there are many...
The Structure and Complexity of Sports Elimination Numbers
The Structure and Complexity of Sports Elimination Numbers
2002,
Identifying the teams that are already eliminated from contention for first place of a...
Improved Algorithms for Constructing Fault‐Tolerant Spanners
Improved Algorithms for Constructing Fault‐Tolerant Spanners
2002,
Let S be a set of n points in a metric space, and let k be a positive integer....
Papers per page: