The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- T. Feder, Moshe Y. Vardi
- MathematicsSIAM journal on computing (Print)
- 1 February 1999
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy.
The benefits of relaxing punctuality
- R. Alur, T. Feder, T. Henzinger
- Computer ScienceACM SIGACT-SIGOPS Symposium on Principles of…
- 1 May 1991
A temporal language is introduced that can constrain the time difference between events only with finite (yet arbitrary) precision and show the resulting logic to be EXPACE-complete, allowing the authors to develop an algorithm for the verification of timing properties of real time systems with a dense semantics.
Optimal algorithms for approximate clustering
This work gives a polynomial time approximation scheme that estimates the optimal number of clusters under the second measure of cluster size within factors arbitrarily close to 1 for a fixed cluster size.
The benefits of relaxing punctuality
- R. Alur, T. Feder, T. Henzinger
- Computer ScienceJACM
- 1 July 1991
This work introduces a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete.
Balanced matroids
Dalancea
Incremental clustering and dynamic information retrieval
- M. Charikar, C. Chekuri, T. Feder, R. Motwani
- Computer ScienceSymposium on the Theory of Computing
- 4 May 1997
This work considers the problem of clustering dynamic point sets in a metric space and proposes a model called incremental clustering which is based on a careful analysis of the requirements of the information retrieval application, and which should also be useful in other applications.
Achieving anonymity via clustering
- Gagan Aggarwal, T. Feder, An Zhu
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 26 June 2006
This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k, and extends the algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication.
Anonymizing Tables
- Gagan Aggarwal, T. Feder, An Zhu
- Computer ScienceInternational Conference on Database Theory
- 5 January 2005
It is shown that the k-Anonymity problem is NP-hard even when the attribute values are ternary, and an O(k)-approximation algorithm is provided for the problem, which improves upon the previous best-known O( klog k)- approximation.
Clique partitions, graph compression and speeding-up algorithms
- T. Feder, R. Motwani
- Computer Science, MathematicsSymposium on the Theory of Computing
- 3 January 1991
An interesting application of the graph compression result arises from the fact that several graph algorithms can be adapted to work with the compressed representation of the input graph, thereby improving the bound on their running times, particularly on dense graphs.
A New Fixed Point Approach for Stable Networks and Stable Marriages
- T. Feder
- Computer ScienceJournal of computer and system sciences (Print)
- 1 October 1992
...
...