The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alistair Sinclair: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alistair Sinclair, Mark Jerrum
    Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:93-133 [Journal]
  2. Mark Jerrum, Alistair Sinclair
    Approximating the Permanent. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1149-1178 [Journal]
  3. Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:136-147 [Conf]
  4. Steve Chien, Alistair Sinclair
    Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:352-361 [Conf]
  5. Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
    Cuts, Trees and l1-Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:399-409 [Conf]
  6. Thomas P. Hayes, Alistair Sinclair
    A general lower bound for mixing of single-site dynamics on graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:511-520 [Conf]
  7. Fabio Martinelli, Alistair Sinclair, Dror Weitz
    The Ising Model on Trees: Boundary Conditions and Mixing Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:628-639 [Conf]
  8. Michael Luby, Dana Randall, Alistair Sinclair
    Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:150-159 [Conf]
  9. Ben Morris, Alistair Sinclair
    Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:230-240 [Conf]
  10. Elchanan Mossel, Yuval Peres, Alistair Sinclair
    Shuffling by Semi-Random Transpositions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:572-581 [Conf]
  11. Yuval Rabani, Alistair Sinclair, Rolf Wanka
    Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:694-705 [Conf]
  12. Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
    Quadratic Dynamical Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:304-313 [Conf]
  13. Mark Jerrum, Alistair Sinclair
    Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:462-475 [Conf]
  14. Michael Luby, Alistair Sinclair, David Zuckerman
    Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:128-133 [Conf]
  15. Alistair Sinclair
    Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:474-487 [Conf]
  16. 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]
  17. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
    Embedding k-outerplanar graphs into l1. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:527-536 [Conf]
  18. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:351-358 [Conf]
  19. Fabio Martinelli, Alistair Sinclair, Dror Weitz
    Fast mixing for independent sets, colorings and other models on trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:456-465 [Conf]
  20. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:639-648 [Conf]
  21. Dana Randall, Alistair Sinclair
    Testable Algorithms for Self-Avoiding Walks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:593-602 [Conf]
  22. Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair
    Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:222-231 [Conf]
  23. Mark Jerrum, Alistair Sinclair
    Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:235-244 [Conf]
  24. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:712-721 [Conf]
  25. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Low distortion maps between point sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:272-280 [Conf]
  26. Claire Kenyon, Dana Randall, Alistair Sinclair
    Matchings in lattice graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:738-746 [Conf]
  27. Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
    A computational view of population genetics. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:83-92 [Conf]
  28. Alistair Sinclair, Mark Jerrum
    Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP]
    WG, 1987, pp:134-148 [Conf]
  29. Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
    Cuts, Trees and l1-Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:2, pp:233-269 [Journal]
  30. Alistair Sinclair
    Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:351-370 [Journal]
  31. Michael Luby, Alistair Sinclair, David Zuckerman
    Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:4, pp:173-180 [Journal]
  32. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:671-697 [Journal]
  33. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:218-235 [Journal]
  34. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:1, pp:13-36 [Journal]
  35. Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair
    Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:263-290 [Journal]
  36. 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]
  37. Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
    A computational view of population genetics. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:4, pp:313-334 [Journal]
  38. Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair
    Finding Points on Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1436-1448 [Journal]
  39. Mark Jerrum, Alistair Sinclair
    Polynomial-Time Approximation Algorithms for the Ising Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1087-1116 [Journal]
  40. Michael Luby, Dana Randall, Alistair Sinclair
    Markov Chain Algorithms for Planar Lattice Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:167-192 [Journal]
  41. Ben Morris, Alistair Sinclair
    Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:195-226 [Journal]
  42. Steve Chien, Alistair Sinclair
    Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:252-266 [Journal]
  43. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
    Embedding k-Outerplanar Graphs into l 1. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:119-136 [Journal]
  44. Mark Jerrum, Alistair Sinclair
    Fast Uniform Generation of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:1, pp:91-100 [Journal]
  45. Steve Chien, Alistair Sinclair
    Convergence to approximate Nash equilibria in congestion games. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:169-178 [Conf]
  46. Elitza N. Maneva, Alistair Sinclair
    On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  47. Liftings of Tree-Structured Markov Chains - (Extended Abstract). [Citation Graph (, )][DBLP]


  48. Delaying Satisfiability for Random 2SAT. [Citation Graph (, )][DBLP]


  49. Strong and Pareto Price of Anarchy in Congestion Games. [Citation Graph (, )][DBLP]


  50. The extended k-tree algorithm. [Citation Graph (, )][DBLP]


  51. Sherali-adams relaxations of the matching polytope. [Citation Graph (, )][DBLP]


  52. Mixing time for the solid-on-solid model. [Citation Graph (, )][DBLP]


  53. Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks [Citation Graph (, )][DBLP]


  54. Mobile Geometric Graphs: Detection, Coverage and Percolation [Citation Graph (, )][DBLP]


  55. Mixing Time for the Solid-on-Solid Model [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
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