| 1999 |
|---|
| 6 | | Z. Sweedyk:
A 2½-Approximation Algorithm for Shortest Superstring.
SIAM J. Comput. 29(3): 954-986 (1999) |
| 1997 |
|---|
| 5 | EE | Bhaskar DasGupta,
Tao Jiang,
Sampath Kannan,
Ming Li,
Z. Sweedyk:
On the complexity and approximation of syntenic distance.
RECOMB 1997: 99-108 |
| 4 | | Vivek Gore,
Mark Jerrum,
Sampath Kannan,
Z. Sweedyk,
Stephen R. Mahaney:
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language.
Inf. Comput. 134(1): 59-74 (1997) |
| 3 | | Sanjeev Arora,
László Babai,
Jacques Stern,
Z. Sweedyk:
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.
J. Comput. Syst. Sci. 54(2): 317-331 (1997) |
| 1995 |
|---|
| 2 | | Sampath Kannan,
Z. Sweedyk,
Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages.
SODA 1995: 551-557 |
| 1993 |
|---|
| 1 | | Sanjeev Arora,
László Babai,
Jacques Stern,
Z. Sweedyk:
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
FOCS 1993: 724-733 |
