Skip to content

Toms Feder

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

28

Venues

12

Active years

1988–2020

Best venue rank

A*

Where they publish

Papers

28 indexed papers, newest first.

YearVenueTitleAuthors
2020MFCSList Homomorphism Problems for Signed Graphs.Jan Bok, Richard C. Brewster, Toms Feder, Pavol Hell, Nikola Jedlickov
2011EDBTDistributing data for secure database services.Vignesh Ganapathy, Dilys Thomas, Toms Feder, Hector Garcia-Molina, Rajeev Motwani
2006FOCSA Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.Toms Feder, Adam Guetz, Milena Mihail, Amin Saberi
2006PODSAchieving anonymity via clustering.Gagan Aggarwal, Toms Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
2005ICDTAnonymizing Tables.Gagan Aggarwal, Toms Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu
2005ICDTAlgorithms for the Database Layout Problem.Gagan Aggarwal, Toms Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
2005SODATwo algorithms for general list matrix partitions.Toms Feder, Pavol Hell, Daniel Krl, Jir Sgall
2005SODAFinding large cycles in Hamiltonian graphs.Toms Feder, Rajeev Motwani
2004ICALPAlgorithms for Multi-product Pricing.Gagan Aggarwal, Toms Feder, Rajeev Motwani, An Zhu
2004LATINList Partitions of Chordal Graphs.Toms Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fbio Protti
2003LICSHomomorphism Closed vs. Existential Positive.Toms Feder, Moshe Y. Vardi
2003STACSRepresenting Graph Metrics with Fewest Edges.Toms Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy
2003STACSComputing Shortest Paths with Uncertainty.Toms Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
2002SODAWeb caching with request reordering.Toms Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
2000STOCComputing the median with uncertainty.Toms Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
2000STOCFinding long paths and cycles in sparse Hamiltonian graphs.Toms Feder, Rajeev Motwani, Carlos S. Subi
1999STOCComplexity of Graph Partition Problems.Toms Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
1997STOCIncremental Clustering and Dynamic Information Retrieval.Moses Charikar, Chandra Chekuri, Toms Feder, Rajeev Motwani
1994SODAA Sublinear Parallel Algorithm for Stable Matching.Toms Feder, Nimrod Megiddo, Serge A. Plotkin
1993STOCMonotone monadic SNP and constraint satisfaction.Toms Feder, Moshe Y. Vardi
1992ICDTDecidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations.Toms Feder, Yatin P. Saraiya
1992STOCBalanced MatroidsToms Feder, Milena Mihail
1991FOCSAmortized Communication Complexity (Preliminary Version)Toms Feder, Eyal Kushilevitz, Moni Naor
1991PODCThe Benefits of Relaxing Punctuality.Rajeev Alur, Toms Feder, Thomas A. Henzinger
1991STOCClique Partitions, Graph Compression, and Speeding-Up AlgorithmsToms Feder, Rajeev Motwani
1989FOCSMultiparty Communication ComplexityDanny Dolev, Toms Feder
1989STOCA New Fixed Point Approach for Stable Networks and Stable MarriagesToms Feder
1988STOCOptimal Algorithms for Approximate ClusteringToms Feder, Daniel H. Greene