| Publication | Date of Publication | Type |
|---|
Low-diameter graph decomposition is in NC
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets
Lecture Notes in Computer Science | 2022-10-14 | Paper |
| Learning the language of viral evolution and escape | 2022-07-25 | Paper |
| A duality-based method for identifying elemental balance violations in metabolic network models | 2022-07-18 | Paper |
Levenshtein Distance, Sequence Comparison and Biological Database Search
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Fast network decomposition
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Efficient design of compact unstructured RNA libraries covering all \(k\)-mers
Lecture Notes in Computer Science | 2017-07-25 | Paper |
| scientific article; zbMATH DE number 5764876 (Why is no real title available?) | 2010-08-06 | Paper |
Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
Proceedings of the National Academy of Sciences | 2009-03-18 | Paper |
Fast and accurate algorithms for protein side-chain packing
Journal of the ACM | 2008-12-21 | Paper |
A Parameterized Algorithm for Protein Structure Alignment
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Reconstructing a three-dimensional model with arbitrary errors
Journal of the ACM | 2005-01-25 | Paper |
Recent developments in computational gene recognition
Documenta Mathematica | 2001-11-11 | Paper |
Recent developments in computational gene recognition
Documenta Mathematica | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1256764 (Why is no real title available?) | 1999-10-04 | Paper |
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing | 1998-09-21 | Paper |
The Fourth Moment Method
SIAM Journal on Computing | 1998-02-10 | Paper |
Nearly optimal algorithms and bounds for multilayer channel routing
Journal of the ACM | 1998-02-02 | Paper |
Tight Bounds for the Maximum Acyclic Subgraph Problem
Journal of Algorithms | 1997-11-25 | Paper |
| scientific article; zbMATH DE number 910860 (Why is no real title available?) | 1996-09-30 | Paper |
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing | 1996-01-01 | Paper |
Scheduling with Concurrency-Based Constraints
Journal of Algorithms | 1995-04-09 | Paper |
Local rule-based theory of virus shell assembly.
Proceedings of the National Academy of Sciences | 1994-10-17 | Paper |
| scientific article; zbMATH DE number 432770 (Why is no real title available?) | 1994-09-19 | Paper |
Simulating (log c n )-wise independence in NC
Journal of the ACM | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 432840 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 432814 (Why is no real title available?) | 1993-10-20 | Paper |
A better performance guarantee for approximate graph coloring
Algorithmica | 1990-01-01 | Paper |
