| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Orhan Kislal, Piotr Berman, Mahmut T. Kandemir |
Improving the performance of k-means clustering through computation skipping and data locality optimizations.  |
Conf. Computing Frontiers  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang 0001, Tom La Porta |
Optimizing sensor movement planning for energy efficiency. |
TOSN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao |
On Approximating Four Covering and Packing Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski |
On Systemic Stability of Banking Networks |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Approximating the Online Set Multicover Problems Via Randomized Winnowing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev |
Improved Approximation for the Directed Spanner Problem. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam |
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs. |
MASCOTS |
2011 |
DBLP DOI BibTeX RDF |
Modeling, Flash Memory, Storage Systems, Capacity Planning |
| 1 | Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam |
O(1)-Approximations for Maximum Movement Problems. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
Steiner Transitive-Closure Spanners of d-Dimensional Posets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky |
Efficient Alignments of Metabolic Networks with Bounded Treewidth. |
ICDM Workshops |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Andrzej Lingas |
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman |
Successes and Failures of Elegant Algorithms in Computational Biology. |
ISBRA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Sofya Raskhodnikova |
Approximation Algorithms for Min-Max Generalization Problems. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Sofya Raskhodnikova, Ge Ruan |
Finding Sparser Directed Spanners. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Jieun K. Jeong |
Consistent Sets of Secondary Structures in Proteins. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Andrzej Lingas |
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao |
On approximating four covering and packing problems. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Marek Karpinski |
Approximating Transitive Reductions for Directed Networks. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller |
Aligning Two Genomic Sequences That Contain Duplications. |
RECOMB-CG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Approximating the online set multicover problems via randomized winnowing. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Marek Karpinski |
Approximating Transitivity in Directed Networks |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka |
Improving Strand Pairing Prediction through Exploring Folding Cooperativity. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2008 |
DBLP DOI BibTeX RDF |
Biology and genetics, Combinatorial algorithms |
| 1 | Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky |
Fast Alignments of Metabolic Networks. |
BIBM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky |
HCV Quasispecies Assembly Using Network Flows. |
ISBRA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang |
On constructing an optimal consensus clustering from multiple clusterings. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Approximating the Online Set Multicover Problems Via Randomized Winnowing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Marek Karpinski |
Approximating Transitive Reductions for Directed Networks. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Yakov Nekrich |
Optimal trade-off for Merkle tree traversal. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Jie Liang |
Foreword. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris |
HomologMiner: looking for homologous genomic groups in whole genomes. |
Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta |
Bidding Protocols for Deploying Mobile Sensors. |
IEEE Trans. Mob. Comput. |
2007 |
DBLP DOI BibTeX RDF |
bidding protocol, distributed algorithm, Mobile sensor networks, sensor deployment |
| 1 | Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag |
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang 0002 |
The inverse protein folding problem on 2D and 3D lattices. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander D. Scott |
Computational complexity of some restricted instances of 3-SAT. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Yakov Nekrich |
Approximating Huffman codes in parallel. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Shiva Prasad Kasiviswanathan |
Faster Approximation of Distances in Graphs. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar |
Packing to angles and sectors. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
geometric covering, approximation algorithms, directional antenna, bin packing |
| 1 | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka |
Bringing Folding Pathways into Strand Pairing Prediction. |
WABI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar |
Packing to angles and sectors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Martin Fürer, Alexander Zelikovsky |
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
parity matroid problem, Steiner trees, matroid, approximation ratio |
| 1 | Piotr Berman, Marek Karpinski |
8/7-approximation algorithm for (1, 2)-TSP. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikola Stojanovic, Piotr Berman |
A Linear-Time Algorithm for Studying Genetic Variation. |
WABI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller |
Controlling Size When Aligning Multiple Genomic Sequences with Duplications. |
WABI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
8/7-Approximation Algorithm for (1,2)-TSP |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao |
Tight approximability results for test set problems in bioinformatics. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta |
Optimizing sensor movement planning for energy efficiency. |
ISLPED |
2005 |
DBLP DOI BibTeX RDF |
energy-efficiency, mobile sensor |
| 1 | Piotr Berman, Surajit K. Das |
On the Vehicle Routing Problem. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Approximating the Online Set Multicover Problems via Randomized Winnowing. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Yakov Nekrich |
Optimal Trade-Off for Merkle Tree Traversal |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alexander D. Scott |
Computational Complexity of Some Restricted Instances of 3SAT |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder |
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. |
Journal of Computational Biology |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao |
Tight Approximability Results for Test Set Problems in Bioinformatics. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang 0002 |
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag |
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Improved Approximation Lower Bounds on Small Occurrence Optimization |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alex D. Scott |
Approximation Hardness of Short Symmetric Instances of MAX-3SAT |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Approximability of Hypergraph Minimum Bisection |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Alex D. Scott |
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
Approximation algorithms for MAX-MIN tiling. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vamsi Veeramachaneni, Piotr Berman, Webb Miller |
Aligning two fragmented sequences. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Piotr Krysta |
Optimizing misdirection. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Yakov Nekrich |
Approximating Huffman Codes in Parallel |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter |
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski |
1.375-Approximation Algorithm for Sorting by Reversals. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Approximating minimum unsatisfiability of linear equations. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
Simple approximation algorithm for nonoverlapping local alignments. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
Slice and dice: a simple, improved approximate tiling recipe. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Yakov Nekrich |
Approximating Huffman Codes in Parallel. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
Parallel Algorithms, Approximation Algorithms, Huffman Codes |
| 1 | Piotr Berman, Marek Karpinski |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vamsi Veeramachaneni, Piotr Berman, Webb Miller |
Aligning Two Fragmented Sequences. (PDF / PS) |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder |
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. |
WABI |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir |
On the Complexity of Positional Sequencing by Hybridization |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski |
1.375-Approximation Algorithm for Sorting by Reversals |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Improved Approximations for General Minimum Cost Scheduling |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Efficient Amplifiers and Bounded Degree Optimization |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski |
Approximating Minimum Unsatisfiability of Linear Equations |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami |
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami |
Improved approximation algorithms for rectangle tiling and packing. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Junichiro Fukuyama |
An Online Algorithm for the Postman Problem with a Small Penalty. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Moses Charikar, Marek Karpinski |
On-Line Load Balancing for Related Machines |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Zheng Zhang 0004, Yuri I. Wolf, Eugene V. Koonin, Webb Miller |
Winnowing Sequences from a Database Search. |
Journal of Computational Biology |
2000 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky |
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Moses Charikar, Marek Karpinski |
On-Line Load Balancing for Related Machines. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman |
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. |
Nord. J. Comput. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman |
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Junichiro Fukuyama |
Variable length sequencing with two lengths. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta |
Improvements in throughout maximization for real-time scheduling. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Zheng Zhang 0004, Piotr Berman, Thomas Wiehe, Webb Miller |
Post-processing long pairwise alignments. |
Bioinformatics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vineet Bafna, Piotr Berman, Toshihiro Fujito |
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Toshihiro Fujito |
On Approximation Properties of the Independent Set Problem for Low Degree Graphs. |
Theory Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Chris Coulston |
Speed is More Powerful than Clairvoyance. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")