Search the dblp DataBase
Leslie Ann Goldberg :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Philip D. MacKenzie Contention Resolution with Guaranteed Constant Expected Delay. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:213-222 [Conf ] 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 ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Mark Jerrum The "Burnside Process" Converges Slowly. [Citation Graph (0, 0)][DBLP ] RANDOM, 1998, pp:331-345 [Conf ] Martin E. Dyer , Leslie Ann Goldberg , Mark Jerrum Counting and Sampling H-Colourings. [Citation Graph (0, 0)][DBLP ] RANDOM, 2002, pp:51-67 [Conf ] 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 ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Mark Jerrum Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:183-192 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Yossi Matias , Satish Rao An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP ] SPAA, 1994, pp:257-267 [Conf ] 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 ] Leslie Ann Goldberg Polynomial space polynomial delay algorithms for listing families of graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:218-225 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Mark Jerrum Inapproximability of the Tutte polynomial. [Citation Graph (0, 0)][DBLP ] STOC, 2007, pp:459-468 [Conf ] 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 ] 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 ] 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 ] Leslie Ann Goldberg , Mark Jerrum Inapproximability of the Tutte polynomial [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] 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 ] 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 ] 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 ] On the Dimensionality of Voting Games. [Citation Graph (, )][DBLP ] The Complexity of Approximately Counting Stable Matchings. [Citation Graph (, )][DBLP ] A tractable and expressive class of marginal contribution nets and its applications. [Citation Graph (, )][DBLP ] Approximating the Partition Function of the Ferromagnetic Potts Model. [Citation Graph (, )][DBLP ] Drift Analysis with Tail Bounds. [Citation Graph (, )][DBLP ] Adaptive Drift Analysis. [Citation Graph (, )][DBLP ] Ranking games that have competitiveness-based strategies. [Citation Graph (, )][DBLP ] The Complexity of Approximating Bounded-Degree Boolean #CSP. [Citation Graph (, )][DBLP ] A Complexity Dichotomy for Partition Functions with Mixed Signs. [Citation Graph (, )][DBLP ] Brief Announcement: Stabilizing Consensus with the Power of Two Choices. [Citation Graph (, )][DBLP ] On the computational complexity of weighted voting games. [Citation Graph (, )][DBLP ] Distributed Selfish Load Balancing [Citation Graph (, )][DBLP ] A complexity dichotomy for partition functions with mixed signs [Citation Graph (, )][DBLP ] The Mixing Time of Glauber Dynamics for Colouring Regular Trees [Citation Graph (, )][DBLP ] A complexity dichotomy for hypergraph partition functions [Citation Graph (, )][DBLP ] The Complexity of Weighted Boolean #CSP with Mixed Signs [Citation Graph (, )][DBLP ] Inapproximability of the Tutte polynomial of a planar graph [Citation Graph (, )][DBLP ] The Complexity of Approximating Bounded-Degree Boolean #CSP [Citation Graph (, )][DBLP ] The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) [Citation Graph (, )][DBLP ] Approximating the partition function of the ferromagnetic Potts model [Citation Graph (, )][DBLP ] The Complexity of Approximately Counting Stable Matchings [Citation Graph (, )][DBLP ] The complexity of weighted and unweighted #CSP [Citation Graph (, )][DBLP ] Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials [Citation Graph (, )][DBLP ] The Complexity of Ferromagnetic Ising with Local Fields. [Citation Graph (, )][DBLP ] Dobrushin Conditions and Systematic Scan. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.460secs