| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
A Counterexample to rapid mixing of the Ge-Stefankovic Process |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
Stabilizing consensus with the power of two choices. |
SPAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski |
The mixing time of Glauber dynamics for coloring regular trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
A Complexity Dichotomy For Hypergraph Partition Functions. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin |
The Complexity of Approximately Counting Stable Roommate Assignments |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin |
The Complexity of Approximately Counting Stable Matchings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Approximating the partition function of the ferromagnetic Potts model |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
An approximation trichotomy for Boolean #CSP. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A Complexity Dichotomy for Partition Functions with Mixed Signs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Adaptive Drift Analysis. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg |
Drift Analysis with Tail Bounds. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Approximating the Partition Function of the Ferromagnetic Potts Model. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre |
Ranking games that have competitiveness-based strategies. |
ACM Conference on Electronic Commerce |
2010 |
DBLP DOI BibTeX RDF |
anonymous games, computation of exact and approximate nash equilibria |
| 1 | Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin |
The Complexity of Approximately Counting Stable Matchings. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Inapproximability of the Tutte polynomial of a planar graph |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Weighted Boolean CSP. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge |
On the computational complexity of weighted voting games. |
Ann. Math. Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A Complexity Dichotomy for Partition Functions with Mixed Signs. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Inapproximability of the Tutte polynomial. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin Conditions and Systematic Scan. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A complexity dichotomy for partition functions with mixed signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Weighted Boolean #CSP with Mixed Signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski |
The Mixing Time of Glauber Dynamics for Colouring Regular Trees |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
A complexity dichotomy for hypergraph partition functions |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
ICALP |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
ICALP |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge |
A tractable and expressive class of marginal contribution nets and its applications. |
AAMAS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge |
On the Dimensionality of Voting Games. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Ferromagnetic Ising with Local Fields. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On counting homomorphisms to directed acyclic graphs. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
directed acyclic graphs, homomorphisms, Counting |
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Weighted Boolean #CSP |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Computing Good Nash Equilibria in Graphical Games |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Matrix norms and rapid mixing for spin systems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
An approximation trichotomy for Boolean #CSP |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin |
Distributed Selfish Load Balancing. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Frugality ratios and improved truthful mechanisms for vertex cover. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
frugality, auctions, vertex cover |
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Computing good nash equilibria in graphical games. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
approximation scheme, graphical games |
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Inapproximability of the Tutte polynomial. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
complexity, approximation, Tutte polynomial |
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge |
Computational Complexity of Weighted Threshold Games. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash Equilibria in Graphical Games on Trees Revisited |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Frugality ratios and improved truthful mechanisms for vertex cover |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
Inapproximability of the Tutte polynomial |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin |
Utilitarian resource assignment. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin |
Distributed selfish load balancing. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On Counting Homomorphisms to Directed Acyclic Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash equilibria in graphical games on trees revisited. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, nash equilibrium, graphical games |
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin Conditions and Systematic Scan. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin conditions and Systematic Scan |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On counting homomorphisms to directed acyclic graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin |
Distributed Selfish Load Balancing |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson |
Strong Spatial Mixing with Fewer Colors for Lattice Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Counting and sampling H-colourings? |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson |
Random sampling of 3-colorings in Z2. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin |
Utilitarian resource assignment |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson |
A bound on the capacity of backoff and acknowledgment-based protocols. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Steven Kelk, Mike Paterson |
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson |
trong Spatial Mixing for Lattice Graphs with Fewer Colours. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
The Relative Complexity of Approximate Counting Problems. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximate counting |
| 1 | Leslie Ann Goldberg, Mark Jerrum, Mike Paterson |
The computational complexity of two-state spin systems. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg |
The Natural Work-Stealing Algorithm is Stable. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum |
Convergence Of The Iterated Prisoner's Dilemma Game. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum |
The "Burnside Process" Converges Slowly. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Counting and Sampling H-Colourings. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Steven Kelk, Mike Paterson |
The complexity of choosing an H-colouring (nearly) uniformly at random. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk |
The Complexity of Gene Placement. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |
Better Approximation Guarantees for Job-Shop Scheduling. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie |
An Improved Stability Bound for Binary Exponential Backoff. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg |
The Natural Work-Stealing Algorithm is Stable. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan |
Contention resolution with constant expected delay. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
Markov chains, ethernet, multiple-access channel, contention resolution |
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson |
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson |
Tight Size Bounds for Packet Headers in Narrow Meshes. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie |
Binary Exponential Backoff Is Stable for High Arrival Rates. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
On the relative complexity of approximate counting problems. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips |
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Computational biology, Phylogeny |
| 1 | Leslie Ann Goldberg, Philip D. MacKenzie |
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")