Sciweavers

13306 search results - page 268 / 2662
» Theoretical Computer Science
Sort
View
CTRS
1992
15 years 10 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
Gregory Kucherov, Mohamed Tajine
FOCS
2009
IEEE
16 years 1 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
FOCS
1999
IEEE
15 years 11 months ago
How Asymmetry Helps Load Balancing
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking
FOCS
1990
IEEE
15 years 10 months ago
Matrix Decomposition Problem Is Complete for the Average Case
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
Yuri Gurevich
STACS
2007
Springer
16 years 22 days ago
On Symmetric Signatures in Holographic Algorithms
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
Jin-yi Cai, Pinyan Lu