Publications

Preprints

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

  • L.A. Goldberg, Automating Polya Theory: The Computational Complexity of the Cycle Index Polynomial, Information and Computation 105(2) (1993) 268--288. http://dx.doi.org/10.1006/inco.1993.1045

  • L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, (Cambridge University Press, 1993). http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511569913 (One of three winners of the UK Distinguished Dissertations in Computer Science Prize.)

  • L.A. Goldberg, Listing Graphs that Satisfy First Order Sentences, Proceedings of STOC (1993) 218-225. (see the journal version in 1994)

  • L.A. Goldberg, M. Jerrum, T. Leighton, and S. Rao, Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers, Proceedings of ACM Symposium on Parallel Algorithms and Architectures (SPAA) 5 (1993) 300-309. (see the journal version)

1992

1990

  • L.A. Henderson, R.E. Hiromoto, O.M. Lubeck, and M.L. Simmons, On the Use of Diagnostic Dependence-Analysis Tools in Parallel Programming: Experiences Using PTOOL, The Journal of Supercomputing 4 (1990) 83--96. http://dx.doi.org/10.1007/BF00162344 (This paper was written when I was an undergraduate student using my original name, Leslie Ann Henderson)