Z. Sweedyk

University of the Sciences — United States

Computer Science · Physical Sciences

6h-index696citations7works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Algorithms and Data Compression(4), Machine Learning and Algorithms(4), Complexity and Algorithms in Graphs(2), DNA and Biological Computing(2), Cryptography and Data Security(1)

Publications7 total

CONSENSUS OF TREES : DESIRABLE PROPERTIES AND COMPUTATIONAL METHODS
2013
The hardness of approximate optima in lattices, codes, and systems of linear equations
2002· 183 cited
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing·2000· 78 cited
A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language
Information and Computation·1997· 40 cited
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
Journal of Computer and System Sciences·1997· 339 cited
On the complexity and approximation of syntenic distance
1997· 16 cited
Counting and random generation of strings in regular languages
Symposium on Discrete Algorithms·1995· 40 cited

Frequent Co-authors

Sampath Kannan(3), Sanjeev Arora(2), László Babai(2), Jacques Stern(2), Steve Mahaney(2), Vivek Gore(1), Mark Jerrum(1), Bhaskar Dasgupta(1), Tao Jiang(1), Senthil Kannan(1), M. Li(1)