|
Search the dblp DataBase
Z. Sweedyk:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations [Citation Graph (1, 0)][DBLP] FOCS, 1993, pp:724-733 [Conf]
- Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk
On the complexity and approximation of syntenic distance. [Citation Graph (0, 0)][DBLP] RECOMB, 1997, pp:99-108 [Conf]
- Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
Counting and Random Generation of Strings in Regular Languages. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:551-557 [Conf]
- Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:134, n:1, pp:59-74 [Journal]
- Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:317-331 [Journal]
- Z. Sweedyk
A 2½-Approximation Algorithm for Shortest Superstring. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:3, pp:954-986 [Journal]
Search in 0.001secs, Finished in 0.001secs
|