Leslie Ann Goldberg

Leslie A. Henderson

University of Liverpool

	2012
125		Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis: Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960
124		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313
123		Leslie Ann Goldberg, Mark Jerrum: The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation) CoRR abs/1202.0313: (2012)
122		Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis: Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436: (2012)
121		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012)
	2011
120		Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings Springer 2011
119		Leslie Ann Goldberg, Mark Jerrum: A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. ICALP (1) 2011: 521-532
118		Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Stabilizing consensus with the power of two choices. SPAA 2011: 149-158
117		Benjamin Doerr, Leslie Ann Goldberg: Adaptive Drift Analysis CoRR abs/1108.0295: (2011)
116		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs CoRR abs/1108.5288: (2011)
115		Leslie Ann Goldberg, Mark Jerrum: A Counterexample to rapid mixing of the Ge-Stefankovic Process CoRR abs/1109.5242: (2011)
114		Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis: Approximating Fixation Probabilities in the Generalized Moran Process CoRR abs/1111.3321: (2011)
	2010
113		Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre: Ranking games that have competitiveness-based strategies. ACM Conference on Electronic Commerce 2010: 335-344
112		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94
111		Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530
110		Leslie Ann Goldberg, Mark Jerrum: Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) 2010: 396-407
109		Benjamin Doerr, Leslie Ann Goldberg: Drift Analysis with Tail Bounds. PPSN (1) 2010: 174-183
108		Benjamin Doerr, Leslie Ann Goldberg: Adaptive Drift Analysis. PPSN (1) 2010: 32-41
107		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334
106		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR abs/1001.4987: (2010)
105		Leslie Ann Goldberg, Mark Jerrum: Approximating the partition function of the ferromagnetic Potts model CoRR abs/1002.0986: (2010)
104		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings CoRR abs/1004.1836: (2010)
103		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP CoRR abs/1005.2678: (2010)
102		Leslie Ann Goldberg, Mark Jerrum: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials CoRR abs/1006.5234: (2010)
101		Leslie Ann Goldberg, Mark Jerrum: A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid CoRR abs/1010.6231: (2010)
100		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Roommate Assignments CoRR abs/1012.1237: (2010)
99		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: A Complexity Dichotomy For Hypergraph Partition Functions. Computational Complexity 19(4): 605-633 (2010)
98		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010)
97		Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski: The mixing time of Glauber dynamics for coloring regular trees. Random Struct. Algorithms 36(4): 464-476 (2010)
96		Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010)
	2009
95		Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504
94		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2): 109-131 (2009)
93		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial of a planar graph CoRR abs/0907.1724: (2009)
92		Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR abs/0907.2663: (2009)
91		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. 55(4): 362-376 (2009)
90		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean CSP. SIAM J. Comput. 38(5): 1970-1986 (2009)
89		Andrei A. 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
88		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
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 II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations Springer 2008
86		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74
85		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
84		Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A complexity dichotomy for partition functions with mixed signs CoRR abs/0804.1932: (2008)
83		Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski: The Mixing Time of Glauber Dynamics for Colouring Regular Trees CoRR abs/0806.0921: (2008)
82		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: A complexity dichotomy for hypergraph partition functions CoRR abs/0811.0037: (2008)
81		Andrei A. 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)
80		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. Combinatorics, Probability & Computing 17(6): 761-779 (2008)
79		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908-929 (2008)
	2007
78		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723
77		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171
76		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
75		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. STOC 2007: 459-468
74		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean #CSP CoRR abs/0704.3683: (2007)
73		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: An approximation trichotomy for Boolean #CSP CoRR abs/0710.4272: (2007)
72		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games CoRR abs/cs/0703133: (2007)
71		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Matrix norms and rapid mixing for spin systems CoRR abs/math/0702744: (2007)
70		Leslie Ann Goldberg, Mark Jerrum: The Complexity of Ferromagnetic Ising with Local Fields. Combinatorics, Probability & Computing 16(1): 43-61 (2007)
69		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. J. ACM 54(6): (2007)
68		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
67		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109
66		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338
65		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49
64		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed selfish load balancing. SODA 2006: 354-363
63		Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial CoRR abs/cs/0605140: (2006)
62		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover CoRR abs/cs/0606044: (2006)
61		Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited Electronic Colloquium on Computational Complexity (ECCC)(005): (2006)
60		Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006)
59		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
58		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing CoRR abs/cs/0506098: (2005)
57		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin conditions and Systematic Scan Electronic Colloquium on Computational Complexity (ECCC)(075): (2005)
56		Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs Electronic Colloquium on Computational Complexity (ECCC)(121): (2005)
55		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
54		Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571
53		Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment CoRR cs.GT/0410018: (2004)
52		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004)
51		Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004)
50		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)
49		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
48		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
47		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2003)
46		Leslie Ann Goldberg, Mark Jerrum, Mike Paterson: The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003)
45		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. 32(5): 1260-1279 (2003)
	2002
44		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
43		Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and Sampling H-Colourings. RANDOM 2002: 51-67
42		Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62
41		Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly. Combinatorics, Probability & Computing 11(1): 21-34 (2002)
40		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): 135-147 (2002)
	2001
39		Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. FOCS 2001: 178-187
38		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)
37		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)
36		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)
35		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
34		Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: On the relative complexity of approximate counting problems. APPROX 2000: 108-119
33		Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716
32		Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767
31		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
30		Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180
29		Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000)
28		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
27		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
26		Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 (1999)
25		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)
24		Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SIAM J. Comput. 28(5): 1829-1847 (1999)
23		Leslie Ann Goldberg, Mark Jerrum: Randomly Sampling Molecules. SIAM J. Comput. 29(3): 834-853 (1999)
	1998
22		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
21		Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly. RANDOM 1998: 331-345
20		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 (1998)
19		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
18		Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149
17		Leslie Ann Goldberg, Philip D. MacKenzie: Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222
16		Leslie Ann Goldberg, Mark Jerrum: Randomly Sampling Molecules. SODA 1997: 183-192
15		Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608
14		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
13		Leslie Ann Goldberg: Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT 1996: 2-9
12		Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. CPM 1996: 253-270
11		Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563
10		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
9		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
8		Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156
7		Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SPAA 1994: 257-267
6		Leslie Ann Goldberg: Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. 49(2): 408-424 (1994)
	1993
5		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
4		Leslie Ann Goldberg: Polynomial space polynomial delay algorithms for listing families of graphs. STOC 1993: 218-225
3		Leslie Ann Goldberg: Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial Inf. Comput. 105(2): 268-288 (1993)
	1992
2		Leslie Ann Goldberg: Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms 13(1): 128-143 (1992)
	1990
1		Leslie A. Henderson, Robert E. Hiromoto, Olaf M. Lubeck, Margaret L. Simmons: On the use of diagnostic dependence-analysis tools in parallel programming: Experiences using PTOOL. The Journal of Supercomputing 4(1): 83-96 (1990)

Coauthor Index

1	Luca Aceto	[87] [88]
2	Micah Adler	[32] [48]
3	Hesham Al-Ammal	[30] [35]
4	Petra Berenbrink	[39] [45] [48] [53] [58] [60] [64] [68]
5	Andrei A. Bulatov	[81] [89] [103] [116] [121] [124]
6	Prasad Chebolu	[100] [104] [112]
7	Mary Cryan	[18] [22] [26] [37] [44] [59]
8	Ivan Damgård (Ivan Bjerre Damgård)	[87] [88]
9	Josep Díaz	[114] [122] [125]
10	Benjamin Doerr	[108] [109] [111] [117] [118]
11	Martin E. Dyer	[28] [31] [34] [40] [43] [44] [47] [52] [56] [57] [59] [65] [66] [69] [71] [73] [74] [80] [81] [82] [89] [90] [92] [98] [99] [103] [106] [107] [116] [121] [124]
12	Edith Elkind	[61] [62] [67] [72] [76] [77] [78] [85] [86] [91] [94]
13	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[32]
14	Tom Friedetzky	[39] [45] [48] [58] [64] [68]
15	Paul W. Goldberg	[9] [10] [12] [20] [22] [27] [37] [38] [48] [53] [58] [60] [61] [62] [64] [67] [68] [72] [76] [77] [78] [85] [86] [91] [94] [113]
16	Catherine S. Greenhill	[28] [31] [34] [40] [47]
17	Martin Grohe	[84] [95] [96]
18	Magnús M. Halldórsson	[87] [88]
19	Robert E. Hiromoto	[1]
20	Zengjian Hu	[58] [64] [68]
21	Anna Ingólfsdóttir	[87] [88]
22	Gabriel Istrate	[40]
23	Markus Jalsenius	[81] [89] [92] [103] [106] [107] [121]
24	Klaus Jansen	[120]
25	Mark Jerrum	[5] [8] [14] [16] [19] [21] [23] [28] [31] [33] [34] [40] [41] [43] [44] [46] [47] [50] [52] [57] [59] [63] [66] [70] [71] [73] [74] [75] [79] [80] [82] [83] [84] [90] [93] [95] [96] [97] [98] [99] [101] [102] [103] [105] [110] [115] [116] [119] [121] [123] [124]
26	Sampath Kannan	[33] [50]
27	Marek Karpinski	[83] [97]
28	Steven Kelk	[42] [49]
29	Piotr Krysta	[113]
30	Frank Thomson Leighton (Tom Leighton)	[5] [14]
31	Olaf M. Lubeck	[1]
32	Philip D. MacKenzie	[8] [11] [17] [19] [25] [29] [30] [35]
33	Russell Martin (Russell A. Martin)	[44] [51] [53] [54] [55] [58] [59] [60] [64] [68] [100] [104] [112]
34	Yossi Matias	[7] [24]
35	George B. Mertzios	[114] [122] [125]
36	Lorenz Minder	[111] [118]
37	Michael Mitzenmacher	[28] [31]
38	Mike Paterson	[15] [27] [29] [32] [33] [36] [38] [42] [46] [48] [49] [50] [51] [54] [55] [56] [65] [69]
39	Pavel A. Pevzner	[27] [38]
40	Cynthia A. Phillips	[9] [10] [12] [18] [20] [26]
41	Satish Rao	[5] [7] [14] [24]
42	R. Ravi	[120]
43	David Richerby	[81] [89] [92] [103] [106] [107] [114] [121] [122] [125]
44	José D. P. Rolim	[120]
45	Süleyman Cenk Sahinalp	[27] [38]
46	Thomas Sauerwald	[111] [118]
47	Christian Scheideler	[111] [118]
48	Maria J. Serna	[114] [122] [125]
49	Margaret L. Simmons	[1]
50	Gregory B. Sorkin	[12] [20]
51	Paul G. Spirakis	[114] [122] [125]
52	Aravind Srinivasan	[15] [29] [36]
53	Elizabeth Sweedyk	[9] [10] [15] [27] [36] [38]
54	Marc Thurley	[84] [95] [96]
55	Carmine Ventre	[113]
56	Igor Walukiewicz	[87] [88]
57	Tandy Warnow	[9] [10]
58	Michael Wooldridge (Michael J. Wooldridge)	[78] [85] [86] [91] [94]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page