The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin E. Dyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:1-17 [Journal]
  2. Martin E. Dyer, Alan M. Frieze
    On the Complexity of Computing the Volume of a Polyhedron. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:967-974 [Journal]
  3. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    On the relative complexity of approximate counting problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:108-119 [Conf]
  4. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Dobrushin Conditions and Systematic Scan. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:327-338 [Conf]
  5. Martin E. Dyer
    A Class of Convex Programs with Applications to Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:9-15 [Conf]
  6. Martin E. Dyer
    A Parallel Algorithm for Linear Programming in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:345-349 [Conf]
  7. Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll
    Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:89-96 [Conf]
  8. Jonathan M. Nash, Peter M. Dew, John R. Davy, Martin E. Dyer
    Implementation Issues Relating to the WPRAM Model for Scalable Computing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:319-326 [Conf]
  9. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Path Coupling Using Stopping Times. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:19-31 [Conf]
  10. Russ Bubley, Martin E. Dyer
    Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:223-231 [Conf]
  11. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:711-720 [Conf]
  12. Martin E. Dyer, Alan M. Frieze
    Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:579-587 [Conf]
  13. Martin E. Dyer, Alan M. Frieze
    Fast Solution of Some Random NP-Hard Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:331-336 [Conf]
  14. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly Coloring Constant Degree Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:582-589 [Conf]
  15. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:210-217 [Conf]
  16. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Stopping Times, Metrics and Approximate Counting. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:108-119 [Conf]
  17. Martin E. Dyer, Catherine S. Greenhill
    A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:339-350 [Conf]
  18. Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
    On Counting Homomorphisms to Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:38-49 [Conf]
  19. Martin E. Dyer, Alan M. Frieze
    Probabilistic Analysis of the Generalised Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:189-200 [Conf]
  20. Martin E. Dyer, Alan M. Frieze
    Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:72-84 [Conf]
  21. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Counting and Sampling H-Colourings. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:51-67 [Conf]
  22. Martin E. Dyer, Mark Jerrum, Eric Vigoda
    Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:68-77 [Conf]
  23. Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
    Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:149-163 [Conf]
  24. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
    On the Greedy Heuristic for Matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:141-149 [Conf]
  25. Russ Bubley, Martin E. Dyer
    Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:248-257 [Conf]
  26. Russ Bubley, Martin E. Dyer
    Faster Random Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:350-354 [Conf]
  27. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
    Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:355-363 [Conf]
  28. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
    Sampling regular graphs and a peer-to-peer network. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:980-988 [Conf]
  29. Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
    Random walks on the vertices of transportation polytopes with constant number of sources. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:330-339 [Conf]
  30. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:336-343 [Conf]
  31. Martin E. Dyer, Catherine S. Greenhill
    The complexity of counting graph homomorphisms (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:246-255 [Conf]
  32. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
    An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:616-624 [Conf]
  33. Martin E. Dyer, Jonathan M. Nash, Peter M. Dew
    An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:21-26 [Conf]
  34. Mary Cryan, Martin E. Dyer
    A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:240-249 [Conf]
  35. Mary Cryan, Martin E. Dyer, Dana Randall
    Approximately counting integral flows and cell-bounded contingency tables. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:413-422 [Conf]
  36. Martin E. Dyer
    Approximate counting by dynamic programming. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:693-699 [Conf]
  37. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:375-381 [Conf]
  38. Barbara M. Smith, Martin E. Dyer
    Locating the Phase Transition in Binary Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:81, n:1-2, pp:155-181 [Journal]
  39. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
    The Relative Complexity of Approximate Counting Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:471-500 [Journal]
  40. Jonathan M. Nash, Peter M. Dew, Martin E. Dyer
    A Scalable Shared Queue on a Distributed Memory Machine. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:6, pp:483-495 [Journal]
  41. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
    A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:271-284 [Journal]
  42. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
    Convergence Of The Iterated Prisoner's Dilemma Game [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  43. Martin E. Dyer
    On a Universal Chain Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:48, n:3, pp:219-229 [Journal]
  44. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly coloring constant degree graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:009, pp:- [Journal]
  45. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:002, pp:- [Journal]
  46. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Dobrushin conditions and Systematic Scan [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:075, pp:- [Journal]
  47. Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
    On counting homomorphisms to directed acyclic graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:121, pp:- [Journal]
  48. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Metric Construction, Stopping Times and Path Coupling. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:151, pp:- [Journal]
  49. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Counting and sampling H-colourings? [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:1-16 [Journal]
  50. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal
    The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:79-81 [Journal]
  51. Martin E. Dyer, Alan M. Frieze
    A Partitioning Algorithm for Minimum Weighted Euclidean Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:2, pp:59-62 [Journal]
  52. Colin Cooper, Martin E. Dyer, Alan M. Frieze
    On Markov Chains for Randomly H-Coloring a Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:117-134 [Journal]
  53. Martin E. Dyer, Alan M. Frieze
    Planar 3DM is NP-Complete. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:174-184 [Journal]
  54. Martin E. Dyer, Alan M. Frieze
    The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:4, pp:451-489 [Journal]
  55. Martin E. Dyer, Catherine S. Greenhill
    On Markov Chains for Independent Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:1, pp:17-49 [Journal]
  56. Martin E. Dyer, Alan M. Frieze, Stephen Suen
    Ordering Clone Libraries in Computational Biology. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:2, pp:207-218 [Journal]
  57. Mary Cryan, Martin E. Dyer
    A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:291-310 [Journal]
  58. Magnus Bordewich, Martin E. Dyer
    Path coupling without contraction. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:280-292 [Journal]
  59. Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
    On Key Storage in Secure Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1995, v:8, n:4, pp:189-200 [Journal]
  60. Martin E. Dyer, Alan M. Frieze
    On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:361-378 [Journal]
  61. Martin E. Dyer, Alan M. Frieze
    Probabilistic analysis of the generalised assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:169-181 [Journal]
  62. Martin E. Dyer, Alan M. Frieze
    Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:64, n:, pp:1-16 [Journal]
  63. Martin E. Dyer, Leen Stougie
    Computational complexity of stochastic programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:3, pp:423-432 [Journal]
  64. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
    Randomized Greedy Matching II. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:55-74 [Journal]
  65. Russ Bubley, Martin E. Dyer, Mark Jerrum
    An elementary analysis of a procedure for sampling points in a convex body. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:213-235 [Journal]
  66. Martin E. Dyer, Alan M. Frieze
    Randomly coloring graphs with lower bounds on girth and maximum degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:2, pp:167-179 [Journal]
  67. Martin E. Dyer, Alan M. Frieze
    Randomized Greedy Matching. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:1, pp:29-46 [Journal]
  68. Martin E. Dyer, Alan M. Frieze
    Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:233-240 [Journal]
  69. Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
    Randomly coloring sparse random graphs with fewer colors than the maximum degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:450-465 [Journal]
  70. Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
    Volumes Spanned by Random Points in the Hypercube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:1, pp:91-106 [Journal]
  71. Martin E. Dyer, Catherine S. Greenhill
    The complexity of counting graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:260-289 [Journal]
  72. Martin E. Dyer, Catherine S. Greenhill
    Corrigendum: The complexity of counting graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:346-352 [Journal]
  73. Martin E. Dyer, Catherine S. Greenhill
    A more rapidly mixing Markov chain for graph colorings. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:285-317 [Journal]
  74. Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
    Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:98-114 [Journal]
  75. Martin E. Dyer, Ravi Kannan, John Mount
    Sampling contingency tables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:4, pp:487-506 [Journal]
  76. Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
    Mixing in time and space for lattice spin systems: A combinatorial view. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:4, pp:461-479 [Journal]
  77. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
    On Approximately Counting Colorings of Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:387-400 [Journal]
  78. Martin E. Dyer
    Linear Time Algorithms for Two- and Three-Variable Linear Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:31-45 [Journal]
  79. Martin E. Dyer
    On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:725-738 [Journal]
  80. Martin E. Dyer
    On Counting Lattice Points in Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:695-707 [Journal]
  81. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1527-1541 [Journal]
  82. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Paths and Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1262-1272 [Journal]
  83. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
    An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1962-1975 [Journal]
  84. Martin E. Dyer, Peter Gritzmann, Alexander Hufnagel
    On the Complexity of Computing Mixed Volumes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:356-400 [Journal]
  85. Martin E. Dyer, Sandeep Sen
    Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1443-1461 [Journal]
  86. Martin E. Dyer, Alan M. Frieze, Michael Molloy
    A probabilistic analysis of randomly generated binary constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1815-1828 [Journal]
  87. Martin E. Dyer, Catherine S. Greenhill
    Polynomial-time counting and sampling of two-rowed contingency tables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:246, n:1-2, pp:265-278 [Journal]
  88. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Matrix norms and rapid mixing for spin systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  89. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    The Complexity of Weighted Boolean #CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  90. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    An approximation trichotomy for Boolean #CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  91. Russ Bubley, Martin E. Dyer
    Faster random generation of linear extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:81-88 [Journal]
  92. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:247-278 [Journal]

  93. The flip markov chain and a randomising P2P protocol. [Citation Graph (, )][DBLP]


  94. The Complexity of Approximating Bounded-Degree Boolean #CSP. [Citation Graph (, )][DBLP]


  95. On the complexity of #CSP. [Citation Graph (, )][DBLP]


  96. A complexity dichotomy for hypergraph partition functions [Citation Graph (, )][DBLP]


  97. The Complexity of Weighted Boolean #CSP with Mixed Signs [Citation Graph (, )][DBLP]


  98. The Complexity of Approximating Bounded-Degree Boolean #CSP [Citation Graph (, )][DBLP]


  99. The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) [Citation Graph (, )][DBLP]


  100. The Complexity of #CSP [Citation Graph (, )][DBLP]


  101. The complexity of weighted and unweighted #CSP [Citation Graph (, )][DBLP]


  102. Sampling Regular Graphs and a Peer-to-Peer Network. [Citation Graph (, )][DBLP]


  103. Dobrushin Conditions and Systematic Scan. [Citation Graph (, )][DBLP]


  104. On an optimization problem with nested constraints. [Citation Graph (, )][DBLP]


  105. Formulating the single machine sequencing problem with release dates as a mixed integer program. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.011secs
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