BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
2 × Canada
8 × USA
Collaborated with:
R.Motwani M.Y.Vardi M.Mihail D.H.Greene G.Aggarwal A.Zhu R.Panigrahy C.S.Subi P.Hell S.Klein M.Charikar C.Chekuri C.Olston J.Widom K.Kenthapadi S.Khuller D.Thomas
Talks about:
algorithm (3) cluster (3) graph (3) partit (2) stabl (2) uncertainti (1) hamiltonian (1) constraint (1) satisfact (1) increment (1)

Person: Tomás Feder

DBLP DBLP: Feder:Tom=aacute=s

Contributed to:

PODS 20062006
ICALP 20042004
LICS 20032003
STOC 20002000
STOC 19991999
STOC 19971997
STOC 19931993
STOC 19921992
STOC 19911991
STOC 19891989
STOC 19881988

Wrote 12 papers:

PODS-2006-AggarwalFKKPTZ #clustering
Achieving anonymity via clustering (GA, TF, KK, SK, RP, DT, AZ), pp. 153–162.
ICALP-2004-AggarwalFMZ #algorithm #multi
Algorithms for Multi-product Pricing (GA, TF, RM, AZ), pp. 72–83.
LICS-2003-FederV #morphism
Homomorphism Closed vs. Existential Positive (TF, MYV), pp. 311–320.
STOC-2000-FederMPOW #nondeterminism
Computing the median with uncertainty (TF, RM, RP, CO, JW), pp. 602–607.
STOC-2000-FederMS #graph
Finding long paths and cycles in sparse Hamiltonian graphs (TF, RM, CSS), pp. 524–529.
STOC-1999-FederHKM #complexity #graph #problem
Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
STOC-1997-CharikarCFM #clustering #incremental #information management #information retrieval
Incremental Clustering and Dynamic Information Retrieval (MC, CC, TF, RM), pp. 626–635.
STOC-1993-FederV #constraints #monad
Monotone monadic SNP and constraint satisfaction (TF, MYV), pp. 612–622.
Balanced Matroids (TF, MM), pp. 26–38.
STOC-1991-FederM #algorithm #clique #graph
Clique Partitions, Graph Compression, and Speeding-Up Algorithms (TF, RM), pp. 123–133.
STOC-1989-Feder #approach #fixpoint #network
A New Fixed Point Approach for Stable Networks and Stable Marriages (TF), pp. 513–522.
STOC-1988-FederG #algorithm #approximate #clustering
Optimal Algorithms for Approximate Clustering (TF, DHG), pp. 434–444.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.