The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomás Feder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomás Feder, Moshe Y. Vardi
    Monotone monadic SNP and constraint satisfaction. [Citation Graph (4, 0)][DBLP]
    STOC, 1993, pp:612-622 [Conf]
  2. Tomás Feder, Rajeev Motwani
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:123-133 [Conf]
  3. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
    Computing the median with uncertainty. [Citation Graph (1, 0)][DBLP]
    STOC, 2000, pp:602-607 [Conf]
  4. Danny Dolev, Tomás Feder
    Multiparty Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:428-433 [Conf]
  5. Tomás Feder, Eyal Kushilevitz, Moni Naor
    Amortized Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:239-248 [Conf]
  6. Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi
    A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:69-76 [Conf]
  7. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu
    Algorithms for Multi-product Pricing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:72-83 [Conf]
  8. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu
    Anonymizing Tables. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:246-258 [Conf]
  9. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
    Algorithms for the Database Layout Problem. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:189-203 [Conf]
  10. Tomás Feder, Yatin P. Saraiya
    Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. [Citation Graph (0, 14)][DBLP]
    ICDT, 1992, pp:297-311 [Conf]
  11. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
    List Partitions of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:100-108 [Conf]
  12. Tomás Feder, Moshe Y. Vardi
    Homomorphism Closed vs. Existential Positive. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:311-320 [Conf]
  13. Rajeev Alur, Tomás Feder, Thomas A. Henzinger
    The Benefits of Relaxing Punctuality. [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:139-152 [Conf]
  14. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
    Achieving anonymity via clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:153-162 [Conf]
  15. Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall
    Two algorithms for general list matrix partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:870-876 [Conf]
  16. Tomás Feder, Rajeev Motwani
    Finding large cycles in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:166-175 [Conf]
  17. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
    A Sublinear Parallel Algorithm for Stable Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:632-637 [Conf]
  18. Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
    Web caching with request reordering. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:104-105 [Conf]
  19. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy
    Representing Graph Metrics with Fewest Edges. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:355-366 [Conf]
  20. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
    Computing Shortest Paths with Uncertainty. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:367-378 [Conf]
  21. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
    Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:626-635 [Conf]
  22. Tomás Feder
    A New Fixed Point Approach for Stable Networks and Stable Marriages [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:513-522 [Conf]
  23. Tomás Feder, Daniel H. Greene
    Optimal Algorithms for Approximate Clustering [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:434-444 [Conf]
  24. Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
    Complexity of Graph Partition Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:464-472 [Conf]
  25. Tomás Feder, Milena Mihail
    Balanced Matroids [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:26-38 [Conf]
  26. Tomás Feder, Rajeev Motwani, Carlos S. Subi
    Finding long paths and cycles in sparse Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:524-529 [Conf]
  27. Tomás Feder
    Network Flow and 2-Satisfiability. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:291-319 [Journal]
  28. Tomás Feder, Pavol Hell, Jing Huang
    List Homomorphisms and Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:4, pp:487-505 [Journal]
  29. Tomás Feder, Pavol Hell, Kim Tucker-Nally
    Digraph matrix partitions and trigraph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2458-2469 [Journal]
  30. Tomás Feder, Pavol Hell
    Matrix partitions of perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2450-2460 [Journal]
  31. Tomás Feder, Pavol Hell, Jing Huang
    List homomorphisms of graphs with bounded degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:386-392 [Journal]
  32. Tomás Feder, Pavol Hell, Jing Huang
    The structure of bi-arc trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:393-401 [Journal]
  33. Tomás Feder
    Constraint Satisfaction on Finite Groups with Near Subgroups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:005, pp:- [Journal]
  34. Tomás Feder, Daniel Ford
    Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:016, pp:- [Journal]
  35. Tomás Feder, Carlos S. Subi
    On Barnette's conjecture [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:015, pp:- [Journal]
  36. Tomás Feder, Carlos S. Subi
    Partition into k-vertex subgraphs of k-partite graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:016, pp:- [Journal]
  37. Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy
    A combinatorial algorithm for MAX CSP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:307-315 [Journal]
  38. Tomás Feder, Sunil M. Shende
    Online Channel Allocation in FDMA Networks with Reuse Constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:6, pp:295-302 [Journal]
  39. Rajeev Alur, Tomás Feder, Thomas A. Henzinger
    The Benefits of Relaxing Punctuality. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:1, pp:116-146 [Journal]
  40. Tomás Feder, Rajeev Motwani
    Worst-case time bounds for coloring and satisfiability problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:192-201 [Journal]
  41. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
    Computing shortest paths with uncertainty. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2007, v:62, n:1, pp:1-18 [Journal]
  42. Tomás Feder
    A New Fixed Point Approach for Stable Networks and Stable Marriages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:2, pp:233-284 [Journal]
  43. Tomás Feder, Rajeev Motwani
    Clique Partitions, Graph Compression and Speeding-Up Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:2, pp:261-272 [Journal]
  44. Tomás Feder, Pavol Hell
    List Homomorphisms to Reflexive Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:2, pp:236-250 [Journal]
  45. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
    Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1417-1440 [Journal]
  46. Danny Dolev, Tomás Feder
    Determinism vs. Nondeterminism in Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:889-895 [Journal]
  47. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
    Amortized Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:736-750 [Journal]
  48. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
    Computing the Median with Uncertainty. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:538-547 [Journal]
  49. Tomás Feder, Rajeev Motwani, Carlos S. Subi
    Approximating the Longest Cycle Problem in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1596-1607 [Journal]
  50. Tomás Feder, Moshe Y. Vardi
    The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:57-104 [Journal]
  51. Tomás Feder
    Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:471-480 [Journal]
  52. Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
    List Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:3, pp:449-478 [Journal]
  53. Tomás Feder, Pavol Hell, Bojan Mohar
    Acyclic Homomorphisms and Circular Colorings of Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:161-169 [Journal]
  54. Tomás Feder, Carlos S. Subi
    Disks on a Tree: Analysis of a Combinatorial Game. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:543-552 [Journal]
  55. Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas
    Querying priced information in databases: The conjunctive case. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  56. Tomás Feder
    Fanout limitations on constraint systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:281-293 [Journal]
  57. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
    List matrix partitions of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:52-66 [Journal]
  58. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
    A sublinear parallel algorithm for stable matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:297-308 [Journal]
  59. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
    Combining request scheduling with web caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:201-218 [Journal]
  60. Tomás Feder, Florent R. Madelaine, Iain A. Stewart
    Dichotomies for classes of homomorphism problems involving unary functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:1-2, pp:1-43 [Journal]
  61. Tomás Feder
    Reliable computation by networks in the presence of noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:569-571 [Journal]
  62. Tomás Feder, Hamid Nazerzadeh, Amin Saberi
    Approximating nash equilibria using small-support strategies. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:352-354 [Conf]
  63. Tomás Feder, Pavol Hell
    Full Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:230-246 [Journal]

  64. Matrix Partitions with Finitely Many Obstructions. [Citation Graph (, )][DBLP]


  65. Anonymizing Graphs [Citation Graph (, )][DBLP]


  66. Extension problems with degree bounds. [Citation Graph (, )][DBLP]


  67. Finding large cycles in Hamiltonian graphs. [Citation Graph (, )][DBLP]


  68. On realizations of point determining graphs, and obstructions to full homomorphisms. [Citation Graph (, )][DBLP]


  69. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). [Citation Graph (, )][DBLP]


  70. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. [Citation Graph (, )][DBLP]


  71. Finding large cycles in Hamiltonian graphs. [Citation Graph (, )][DBLP]


  72. Channel assignment in wireless networks and classification of minimum graph homomorphism. [Citation Graph (, )][DBLP]


  73. Closures and dichotomies for quantified constraints. [Citation Graph (, )][DBLP]


  74. Constraint satisfaction: a personal perspective. [Citation Graph (, )][DBLP]


  75. k-connected spanning subgraphs of low degree. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002