Leslie Ann Goldberg

	2009
92		Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504
91		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial of a planar graph CoRR abs/0907.1724: (2009)
90		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR abs/0907.2663: (2009)
89		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean CSP. SIAM J. Comput. 38(5): 1970-1986 (2009)
88		Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009)
	2008
87		Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games Springer 2008
86		Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations Springer 2008
85		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74
84		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014
83		Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A complexity dichotomy for partition functions with mixed signs CoRR abs/0804.1932: (2008)
82		Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski: The Mixing Time of Glauber Dynamics for Colouring Regular Trees CoRR abs/0806.0921: (2008)
81		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: A complexity dichotomy for hypergraph partition functions CoRR abs/0811.0037: (2008)
80		Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR abs/0812.4171: (2008)
79		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. Combinatorics, Probability & Computing 17(6): 761-779 (2008)
78		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908-929 (2008)
	2007
77		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723
76		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171
75		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover. ACM Conference on Electronic Commerce 2007: 336-345
74		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. STOC 2007: 459-468
73		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean #CSP CoRR abs/0704.3683: (2007)
72		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: An approximation trichotomy for Boolean #CSP CoRR abs/0710.4272: (2007)
71		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games CoRR abs/cs/0703133: (2007)
70		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Matrix norms and rapid mixing for spin systems CoRR abs/math/0702744: (2007)
69		Leslie Ann Goldberg, Mark Jerrum: The Complexity of Ferromagnetic Ising with Local Fields. Combinatorics, Probability & Computing 16(1): 43-61 (2007)
68		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. J. ACM 54(6): (2007)
67		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing. SIAM J. Comput. 37(4): 1163-1181 (2007)
	2006
66		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109
65		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338
64		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49
63		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed selfish load balancing. SODA 2006: 354-363
62		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial CoRR abs/cs/0605140: (2006)
61		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover CoRR abs/cs/0606044: (2006)
60		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited Electronic Colloquium on Computational Complexity (ECCC)(005): (2006)
59		Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006)
58		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. SIAM J. Comput. 36(1): 247-278 (2006)
	2005
57		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing CoRR abs/cs/0506098: (2005)
56		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin conditions and Systematic Scan Electronic Colloquium on Computational Complexity (ECCC)(075): (2005)
55		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs Electronic Colloquium on Computational Complexity (ECCC)(121): (2005)
54		Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Strong Spatial Mixing with Fewer Colors for Lattice Graphs. SIAM J. Comput. 35(2): 486-517 (2005)
	2004
53		Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571
52		Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment CoRR cs.GT/0410018: (2004)
51		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004)
50		Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004)
49		Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2): 313-331 (2004)
48		Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM J. Comput. 33(2): 416-432 (2004)
	2003
47		Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson: A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108
46		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2003)
45		Leslie Ann Goldberg, Mark Jerrum, Mike Paterson: The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003)
44		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. 32(5): 1260-1279 (2003)
	2002
43		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. FOCS 2002: 711-720
42		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and Sampling H-Colourings. RANDOM 2002: 51-67
41		Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62
40		Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly Combinatorics, Probability & Computing 11(1): (2002)
39		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum: Convergence Of The Iterated Prisoner's Dilemma Game Combinatorics, Probability & Computing 11(2): (2002)
	2001
38		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. FOCS 2001: 178-187
37		Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001)
36		Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg: Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. 31(2): 375-397 (2001)
35		Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discrete Math. 14(1): 67-92 (2001)
34		Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: An Improved Stability Bound for Binary Exponential Backoff. Theory Comput. Syst. 34(3): 229-244 (2001)
	2000
33		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: On the relative complexity of approximate counting problems. APPROX 2000: 108-119
32		Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716
31		Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767
30		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). SODA 2000: 616-624
29		Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180
28		Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000)
27		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. SIAM J. Comput. 30(6): 1962-1975 (2000)
	1999
26		Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. SODA 1999: 386-395
25		Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 (1999)
24		Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. 58(1): 232-258 (1999)
23		Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SIAM J. Comput. 28(5): 1829-1847 (1999)
22		Leslie Ann Goldberg, Mark Jerrum: Randomly Sampling Molecules. SIAM J. Comput. 29(3): 834-853 (1999)
	1998
21		Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg: Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS 1998: 436-445
20		Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly. RANDOM 1998: 331-345
19		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 (1998)
18		Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. 27(4): 1083-1098 (1998)
	1997
17		Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149
16		Leslie Ann Goldberg, Philip D. MacKenzie: Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222
15		Leslie Ann Goldberg, Mark Jerrum: Randomly Sampling Molecules. SODA 1997: 183-192
14		Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608
13		Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao: Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26(4): 1100-1119 (1997)
	1996
12		Leslie Ann Goldberg: Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT 1996: 2-9
11		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. CPM 1996: 253-270
10		Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563
9		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discrete Applied Mathematics 71(1-3): 111-136 (1996)
	1995
8		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow: Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127
	1994
7		Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156
6		Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SPAA 1994: 257-267
5		Leslie Ann Goldberg: Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. 49(2): 408-424 (1994)
	1993
4		Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao: A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA 1993: 300-309
3		Leslie Ann Goldberg: Polynomial space polynomial delay algorithms for listing families of graphs. STOC 1993: 218-225
2		Leslie Ann Goldberg: Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial Inf. Comput. 105(2): 268-288 (1993)
	1992
1		Leslie Ann Goldberg: Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms 13(1): 128-143 (1992)

Coauthor Index

1	Luca Aceto	[86] [87]
2	Micah Adler	[31] [47]
3	Hesham Al-Ammal	[29] [34]
4	Petra Berenbrink	[38] [44] [47] [52] [57] [59] [63] [67]
5	Andrei Bulatov	[80] [88]
6	Mary Cryan	[17] [21] [25] [36] [43] [58]
7	Ivan Damgård	[86] [87]
8	Martin E. Dyer	[27] [30] [33] [39] [42] [43] [46] [51] [55] [56] [58] [64] [65] [68] [70] [72] [73] [79] [80] [81] [88] [89] [90]
9	Edith Elkind	[60] [61] [66] [71] [75] [76] [77] [84] [85]
10	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[31]
11	Tom Friedetzky	[38] [44] [47] [57] [63] [67]
12	Paul W. Goldberg	[8] [9] [11] [19] [21] [26] [36] [37] [47] [52] [57] [59] [60] [61] [63] [66] [67] [71] [75] [76] [77] [84] [85]
13	Catherine S. Greenhill	[27] [30] [33] [39] [46]
14	Martin Grohe	[83] [92]
15	Magnús M. Halldórsson	[86] [87]
16	Zengjian Hu	[57] [63] [67]
17	Anna Ingólfsdóttir	[86] [87]
18	Gabriel Istrate	[39]
19	Markus Jalsenius	[80] [88] [90]
20	Mark Jerrum	[4] [7] [13] [15] [18] [20] [22] [27] [30] [32] [33] [39] [40] [42] [43] [45] [46] [49] [51] [56] [58] [62] [65] [69] [70] [72] [73] [74] [78] [79] [81] [82] [83] [89] [91] [92]
21	Sampath Kannan	[32] [49]
22	Marek Karpinski	[82]
23	Steven Kelk	[41] [48]
24	Frank Thomson Leighton (Tom Leighton)	[4] [13]
25	Philip D. MacKenzie	[7] [10] [16] [18] [24] [28] [29] [34]
26	Russell A. Martin	[43] [50] [52] [53] [54] [57] [58] [59] [63] [67]
27	Yossi Matias	[6] [23]
28	Michael Mitzenmacher	[27] [30]
29	Mike Paterson	[14] [26] [28] [31] [32] [35] [37] [41] [45] [47] [48] [49] [50] [53] [54] [55] [64] [68]
30	Pavel A. Pevzner	[26] [37]
31	Cynthia A. Phillips	[8] [9] [11] [17] [19] [25]
32	Satish Rao	[4] [6] [13] [23]
33	David Richerby	[80] [88] [90]
34	Süleyman Cenk Sahinalp	[26] [37]
35	Gregory B. Sorkin	[11] [19]
36	Aravind Srinivasan	[14] [28] [35]
37	Elizabeth Sweedyk	[8] [9] [14] [26] [35] [37]
38	Marc Thurley	[83] [92]
39	Igor Walukiewicz	[86] [87]
40	Tandy Warnow	[8] [9]
41	Michael Wooldridge (Michael J. Wooldridge)	[77] [84] [85]