BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Italy
1 × Japan
1 × United Kingdom
2 × Switzerland
2 × USA
Collaborated with:
M.Jerrum M.Paterson ∅ A.Göbel D.Richerby A.Galanis R.Gysel J.Lapinskas M.E.Dyer S.Kelk M.Adler F.E.Fich S.Kannan
Talks about:
polynomi (5) approxim (4) count (4) graph (3) ferromagnet (2) homomorph (2) algorithm (2) function (2) complex (2) partit (2)

Person: Leslie Ann Goldberg

DBLP DBLP: Goldberg:Leslie_Ann

Facilitated 3 volumes:

ICALP (1) 2008Ed
ICALP (2) 2008Ed
ICALP (2) 2008Ed

Contributed to:

ICALP (1) 20152015
ICALP (1) 20122012
ICALP (1) 20112011
ICALP (1) 20102010
STOC 20072007
ICALP (1) 20062006
STOC 20022002
ICALP 20002000
STOC 19931993

Wrote 12 papers:

ICALP-v1-2015-0001GR #graph #morphism
Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.
ICALP-v1-2015-GalanisGJ #approximate
Approximately Counting H-Colourings is BIS-Hard (AG, LAG, MJ), pp. 529–541.
ICALP-v1-2015-GoldbergGL #approximate
Approximately Counting Locally-Optimal Structures (LAG, RG, JL), pp. 654–665.
ICALP-v1-2012-GoldbergJ #approximate #complexity #polynomial
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.
ICALP-v1-2011-GoldbergJ #algorithm #polynomial
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (LAG, MJ), pp. 521–532.
ICALP-v1-2010-GoldbergJ #approximate
Approximating the Partition Function of the Ferromagnetic Potts Model (LAG, MJ), pp. 396–407.
STOC-2007-GoldbergJ #polynomial
Inapproximability of the Tutte polynomial (LAG, MJ), pp. 459–468.
ICALP-v1-2006-DyerGP #graph #morphism #on the
On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
STOC-2002-GoldbergKP #complexity #random
The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.
ICALP-2000-AdlerFGP #bound
Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.
ICALP-2000-GoldbergJKP #bound #capacity #protocol
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (LAG, MJ, SK, MP), pp. 705–716.
STOC-1993-Goldberg #algorithm #graph #polynomial #product line
Polynomial space polynomial delay algorithms for listing families of graphs (LAG), pp. 218–225.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.