The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leslie Ann Goldberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Leslie Ann Goldberg
    Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:2-9 [Conf]
  4. Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:130-149 [Conf]
  5. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
    Constructing Computer Virus Phylogenies. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:253-270 [Conf]
  6. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow
    Minimizing Phylogenetic Number to find Good Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:102-127 [Conf]
  7. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
    The Natural Work-Stealing Algorithm is Stable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:178-187 [Conf]
  8. 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]
  9. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
    Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:436-445 [Conf]
  10. Leslie Ann Goldberg, Philip D. MacKenzie
    Contention Resolution with Guaranteed Constant Expected Delay. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:213-222 [Conf]
  11. Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
    trong Spatial Mixing for Lattice Graphs with Fewer Colours. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:562-571 [Conf]
  12. Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson
    Tight Size Bounds for Packet Headers in Narrow Meshes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:756-767 [Conf]
  13. 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]
  14. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:705-716 [Conf]
  15. Leslie Ann Goldberg, Mark Jerrum
    The "Burnside Process" Converges Slowly. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:331-345 [Conf]
  16. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
    Counting and Sampling H-Colourings. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:51-67 [Conf]
  17. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Nash equilibria in graphical games on trees revisited. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:100-109 [Conf]
  18. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin
    Distributed selfish load balancing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:354-363 [Conf]
  19. 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]
  20. Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
    The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:386-395 [Conf]
  21. Leslie Ann Goldberg, Mark Jerrum
    Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:183-192 [Conf]
  22. Leslie Ann Goldberg, Philip D. MacKenzie
    Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:554-563 [Conf]
  23. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
    Better Approximation Guarantees for Job-shop Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:599-608 [Conf]
  24. Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson
    A proportionate fair scheduling rule with good worst-case performance. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:101-108 [Conf]
  25. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:300-309 [Conf]
  26. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
    An W(log log n) Lower Bound for Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:147-156 [Conf]
  27. Leslie Ann Goldberg, Yossi Matias, Satish Rao
    An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:257-267 [Conf]
  28. Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
    Binary Exponential Backoff Is Stable for High Arrival Rates. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:169-180 [Conf]
  29. Leslie Ann Goldberg
    Polynomial space polynomial delay algorithms for listing families of graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:218-225 [Conf]
  30. Leslie Ann Goldberg, Steven Kelk, Mike Paterson
    The complexity of choosing an H-colouring (nearly) uniformly at random. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:53-62 [Conf]
  31. Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:311-329 [Journal]
  32. 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]
  33. Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
    Utilitarian resource assignment [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  34. 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]
  35. Leslie Ann Goldberg, Mark Jerrum
    The "Burnside Process" Converges Slowly [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal]
  36. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow
    Minimizing Phylogenetic Number To Find Good Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:111-136 [Journal]
  37. 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]
  38. 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]
  39. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Nash Equilibria in Graphical Games on Trees Revisited [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:005, pp:- [Journal]
  40. 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]
  41. Leslie Ann Goldberg
    Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:2, pp:268-288 [Journal]
  42. Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
    Contention resolution with constant expected delay. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:6, pp:1048-1096 [Journal]
  43. Leslie Ann Goldberg
    Efficient Algorithms for Listing Unlabeled Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:128-143 [Journal]
  44. Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
    The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:225-243 [Journal]
  45. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
    Constructing Computer Virus Phylogenies. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:1, pp:188-208 [Journal]
  46. Leslie Ann Goldberg
    Listing Graphs That Satisfy First-Order Sentences. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:408-424 [Journal]
  47. Leslie Ann Goldberg, Philip D. MacKenzie
    Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:232-258 [Journal]
  48. Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin
    Utilitarian resource assignment. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:567-587 [Journal]
  49. Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
    An Improved Stability Bound for Binary Exponential Backoff. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:3, pp:229-244 [Journal]
  50. Leslie Ann Goldberg, Mark Jerrum, Mike Paterson
    The computational complexity of two-state spin systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:2, pp:133-154 [Journal]
  51. Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
    Random sampling of 3-colorings in Z2. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:3, pp:279-302 [Journal]
  52. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
    The Natural Work-Stealing Algorithm is Stable. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1260-1279 [Journal]
  53. Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
    Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:375-397 [Journal]
  54. 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]
  55. Leslie Ann Goldberg, Mark Jerrum
    Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:834-853 [Journal]
  56. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A bound on the capacity of backoff and acknowledgment-based protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:313-331 [Journal]
  57. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
    Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1100-1119 [Journal]
  58. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
    An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1083-1098 [Journal]
  59. Leslie Ann Goldberg, Steven Kelk, Mike Paterson
    The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:416-432 [Journal]
  60. Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
    Strong Spatial Mixing with Fewer Colors for Lattice Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:486-517 [Journal]
  61. Leslie Ann Goldberg, Yossi Matias, Satish Rao
    An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1829-1847 [Journal]
  62. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
    Better Approximation Guarantees for Job-Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:67-92 [Journal]
  63. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge
    Computational Complexity of Weighted Threshold Games. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:718-723 [Conf]
  64. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Frugality ratios and improved truthful mechanisms for vertex cover. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:336-345 [Conf]
  65. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Computing good nash equilibria in graphical games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:162-171 [Conf]
  66. Leslie Ann Goldberg, Mark Jerrum
    Inapproximability of the Tutte polynomial. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:459-468 [Conf]
  67. 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]
  68. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Computing Good Nash Equilibria in Graphical Games [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  69. 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]
  70. Leslie Ann Goldberg, Mark Jerrum
    Inapproximability of the Tutte polynomial [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  71. Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg
    Frugality ratios and improved truthful mechanisms for vertex cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  72. 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]
  73. 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]

  74. On the Dimensionality of Voting Games. [Citation Graph (, )][DBLP]


  75. The Complexity of Approximately Counting Stable Matchings. [Citation Graph (, )][DBLP]


  76. A tractable and expressive class of marginal contribution nets and its applications. [Citation Graph (, )][DBLP]


  77. Approximating the Partition Function of the Ferromagnetic Potts Model. [Citation Graph (, )][DBLP]


  78. Drift Analysis with Tail Bounds. [Citation Graph (, )][DBLP]


  79. Adaptive Drift Analysis. [Citation Graph (, )][DBLP]


  80. Ranking games that have competitiveness-based strategies. [Citation Graph (, )][DBLP]


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


  82. A Complexity Dichotomy for Partition Functions with Mixed Signs. [Citation Graph (, )][DBLP]


  83. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. [Citation Graph (, )][DBLP]


  84. On the computational complexity of weighted voting games. [Citation Graph (, )][DBLP]


  85. Distributed Selfish Load Balancing [Citation Graph (, )][DBLP]


  86. A complexity dichotomy for partition functions with mixed signs [Citation Graph (, )][DBLP]


  87. The Mixing Time of Glauber Dynamics for Colouring Regular Trees [Citation Graph (, )][DBLP]


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


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


  90. Inapproximability of the Tutte polynomial of a planar graph [Citation Graph (, )][DBLP]


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


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


  93. Approximating the partition function of the ferromagnetic Potts model [Citation Graph (, )][DBLP]


  94. The Complexity of Approximately Counting Stable Matchings [Citation Graph (, )][DBLP]


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


  96. Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials [Citation Graph (, )][DBLP]


  97. The Complexity of Ferromagnetic Ising with Local Fields. [Citation Graph (, )][DBLP]


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


Search in 0.224secs, Finished in 0.230secs
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