Leslie A. Henderson
University of Liverpool
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j52 |      | |
| j51 | | Leslie Ann Goldberg, Mark Jerrum: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. Syst. Sci. 79(1): 68-78 (2013) |
| j50 | | Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre: Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476: 24-37 (2013) |
| c50 | | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby: The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 |
| i33 | | Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre: Ranking Games that have Competitiveness-based Strategies. CoRR abs/1301.5844 (2013) |
| 2012 | ||
| j49 | | Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial of a planar graph. Computational Complexity 21(4): 605-642 (2012) |
| j48 | | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) |
| j47 | | Leslie Ann Goldberg, Mark Jerrum: Approximating the partition function of the ferromagnetic potts model. J. ACM 59(5): 25 (2012) |
| j46 | | 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) |
| j45 | | Prasad Chebolu, Leslie Ann Goldberg, Russell Martin: The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5): 1579-1605 (2012) |
| j44 | | Prasad Chebolu, Leslie Ann Goldberg, Russell Martin: The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437: 35-68 (2012) |
| c49 | | Leslie Ann Goldberg, Mark Jerrum: The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) 2012: 399-410 |
| c48 | | 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 |
| c47 | | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313 |
| i32 | | 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) |
| i31 | | 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) |
| i30 | | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby: The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) |
| i29 | | Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan: Approximating the partition function of planar two-state spin systems. CoRR abs/1208.4987 (2012) |
| 2011 | ||
| c46 | | 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 |
| c45 | | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler: Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 |
| e3 | | Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim (Eds.): 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. Lecture Notes in Computer Science 6845, Springer 2011, isbn 978-3-642-22934-3 |
| i28 | | |
| i27 | | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. CoRR abs/1108.5288 (2011) |
| i26 | | Leslie Ann Goldberg, Mark Jerrum: A Counterexample to rapid mixing of the Ge-Stefankovic Process. CoRR abs/1109.5242 (2011) |
| i25 | | 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 | ||
| j43 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: A Complexity Dichotomy For Hypergraph Partition Functions. Computational Complexity 19(4): 605-633 (2010) |
| j42 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010) |
| j41 | | 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) |
| j40 | | 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) |
| c44 | | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94 |
| c43 | | Leslie Ann Goldberg, Mark Jerrum: Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) 2010: 396-407 |
| c42 | | |
| c41 | | |
| c40 | | 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 |
| c39 | | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334 |
| c38 | | 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 |
| i24 | | 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) |
| i23 | | Leslie Ann Goldberg, Mark Jerrum: Approximating the partition function of the ferromagnetic Potts model. CoRR abs/1002.0986 (2010) |
| i22 | | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings. CoRR abs/1004.1836 (2010) |
| i21 | | 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) |
| i20 | | Leslie Ann Goldberg, Mark Jerrum: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. CoRR abs/1006.5234 (2010) |
| i19 | | 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) |
| i18 | | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Roommate Assignments. CoRR abs/1012.1237 (2010) |
| 2009 | ||
| j39 | | 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) |
| j38 | | 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) |
| j37 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean CSP. SIAM J. Comput. 38(5): 1970-1986 (2009) |
| j36 | | 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) |
| c37 | | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504 |
| i17 | | Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial of a planar graph. CoRR abs/0907.1724 (2009) |
| i16 | | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP. CoRR abs/0907.2663 (2009) |
| 2008 | ||
| j35 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. Combinatorics, Probability & Computing 17(6): 761-779 (2008) |
| j34 | | Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908-929 (2008) |
| c36 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74 |
| c35 | | 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 |
| e2 |  | Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): 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. Lecture Notes in Computer Science 5125, Springer 2008, isbn 978-3-540-70574-1 |
| e1 | | Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): 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. Lecture Notes in Computer Science 5126, Springer 2008, isbn 978-3-540-70582-6 |
| i15 | | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008) |
| i14 | | Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski: The Mixing Time of Glauber Dynamics for Colouring Regular Trees. CoRR abs/0806.0921 (2008) |
| i13 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: A complexity dichotomy for hypergraph partition functions. CoRR abs/0811.0037 (2008) |
| i12 | | 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) |
| 2007 | ||
| j33 | | Leslie Ann Goldberg, Mark Jerrum: The Complexity of Ferromagnetic Ising with Local Fields. Combinatorics, Probability & Computing 16(1): 43-61 (2007) |
| j32 | | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. J. ACM 54(6) (2007) |
| j31 | | 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) |
| c34 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723 |
| c33 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171 |
| c32 | | 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 |
| c31 | | |
| i11 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: The Complexity of Weighted Boolean #CSP. CoRR abs/0704.3683 (2007) |
| i10 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: An approximation trichotomy for Boolean #CSP. CoRR abs/0710.4272 (2007) |
| i9 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games. CoRR abs/cs/0703133 (2007) |
| i8 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Matrix norms and rapid mixing for spin systems. CoRR abs/math/0702744 (2007) |
| 2006 | ||
| j30 | | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006) |
| j29 | | 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) |
| c30 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338 |
| c29 | | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49 |
| c28 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109 |
| c27 | | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed selfish load balancing. SODA 2006: 354-363 |
| i7 | | Leslie Ann Goldberg, Mark Jerrum: Inapproximability of the Tutte polynomial. CoRR abs/cs/0605140 (2006) |
| i6 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover. CoRR abs/cs/0606044 (2006) |
| i5 | | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited. Electronic Colloquium on Computational Complexity (ECCC)(005) (2006) |
| 2005 | ||
| j28 | | 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) |
| i4 | | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin: Distributed Selfish Load Balancing. CoRR abs/cs/0506098 (2005) |
| i3 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Dobrushin conditions and Systematic Scan. Electronic Colloquium on Computational Complexity (ECCC)(075) (2005) |
| i2 | | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC)(121) (2005) |
| 2004 | ||
| j27 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004) |
| j26 | | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004) |
| j25 | | 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) |
| j24 | | 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) |
| c26 | | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571 |
| i1 | | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin: Utilitarian resource assignment. CoRR cs.GT/0410018 (2004) |
| 2003 | ||
| j23 | | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2003) |
| j22 | | Leslie Ann Goldberg, Mark Jerrum, Mike Paterson: The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003) |
| j21 | | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. 32(5): 1260-1279 (2003) |
| c25 | | 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 |
| 2002 | ||
| j20 | | Leslie Ann Goldberg, Mark Jerrum: The "Burnside Process" Converges Slowly. Combinatorics, Probability & Computing 11(1): 21-34 (2002) |
| j19 | | 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) |
| c24 | | 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 |
| c23 | | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Counting and Sampling H-Colourings. RANDOM 2002: 51-67 |
| c22 | | Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62 |
| 2001 | ||
| j18 | | 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) |
| j17 | | 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) |
| j16 | | 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) |
| j15 | | 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) |
| c21 | | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg: The Natural Work-Stealing Algorithm is Stable. FOCS 2001: 178-187 |
| 2000 | ||
| j14 | | Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000) |
| j13 | | 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) |
| c20 | | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum: On the relative complexity of approximate counting problems. APPROX 2000: 108-119 |
| c19 | | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716 |
| c18 | | Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767 |
| c17 | | 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 |
| c16 | | Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180 |
| 1999 | ||
| j12 | | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 (1999) |
| j11 | | 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) |
| j10 | | Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SIAM J. Comput. 28(5): 1829-1847 (1999) |
| j9 | | Leslie Ann Goldberg, Mark Jerrum: Randomly Sampling Molecules. SIAM J. Comput. 29(3): 834-853 (1999) |
| c15 | | 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 |
| 1998 | ||
| j8 | | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 (1998) |
| j7 | | 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) |
| c14 | | 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 |
| c13 | | |
| 1997 | ||
| j6 | | 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) |
| c12 | | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips: Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149 |
| c11 | | Leslie Ann Goldberg, Philip D. MacKenzie: Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222 |
| c10 | | |
| c9 | | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608 |
| 1996 | ||
| j5 | | 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) |
| c8 | | Leslie Ann Goldberg: Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT 1996: 2-9 |
| c7 | | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. CPM 1996: 253-270 |
| c6 | | Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563 |
| 1995 | ||
| c5 | | 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 | ||
| j4 | | Leslie Ann Goldberg: Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. 49(2): 408-424 (1994) |
| c4 | | Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156 |
| c3 | | Leslie Ann Goldberg, Yossi Matias, Satish Rao: An Optical Simulation of Shared Memory. SPAA 1994: 257-267 |
| 1993 | ||
| j3 | | Leslie Ann Goldberg: Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial. Inf. Comput. 105(2): 268-288 (1993) |
| c2 | | 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 |
| c1 | | Leslie Ann Goldberg: Polynomial space polynomial delay algorithms for listing families of graphs. STOC 1993: 218-225 |
| 1992 | ||
| j2 | | Leslie Ann Goldberg: Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms 13(1): 128-143 (1992) |
| 1990 | ||
| j1 | | 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) |
Colors in the list of coauthors
Last update Sat May 25 21:35:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page