Piotr Berman

ORCID

Publication Activity (10 Years)

Years Active: 1978-2023
Publications (10 Years): 10

Top Venues

CoRR

ACM Trans. Algorithms

Algorithmica

APPROX/RANDOM

Publications

Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache
Testing Connectedness of Images. CoRR (2023)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache
Testing Connectedness of Images. APPROX/RANDOM (2023)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
Tolerant Testers of Image Properties. ACM Trans. Algorithms 18 (4) (2022)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
The Power and Limitations of Uniform Samples in Testing Properties of Figures. Algorithmica 81 (3) (2019)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
Testing convexity of figures under the uniform distribution. Random Struct. Algorithms 54 (3) (2019)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
The Power and Limitations of Uniform Samples in Testing Properties of Figures. FSTTCS (2016)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
Testing Convexity of Figures Under the Uniform Distribution. SoCG (2016)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
Tolerant Testers of Image Properties. ICALP (2016)
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
Constant-Time Testing and Learning of Image Properties. CoRR (2015)
Piotr Berman, Junichiro Fukuyama
The Distributed Selection Problem and the AKS Sorting Network. CoRR (2015)
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70 (4) (2014)
Piotr Berman, Sofya Raskhodnikova
Approximation Algorithms for Min-Max Generalization Problems. ACM Trans. Algorithms 11 (1) (2014)
Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev
-testing. STOC (2014)
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
Steiner transitive-closure spanners of low-dimensional posets. Comb. 34 (3) (2014)
Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam
HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems. J. Supercomput. 67 (1) (2014)
Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222 (2013)
Piotr Berman, Grigory Yaroslavtsev
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. APPROX-RANDOM (2012)
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)
Piotr Berman, Marek Karpinski, Andrzej Lingas
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64 (2) (2012)
Guiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang, Tom La Porta
Optimizing sensor movement planning for energy efficiency. ACM Trans. Sens. Networks 7 (4) (2011)
Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs. MASCOTS (2011)
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) (2011)
Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM (2011)
Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
Improved Approximation for the Directed Spanner Problem. ICALP (1) (2011)
Piotr Berman, Bhaskar DasGupta
Approximating the Online Set Multicover Problems Via Randomized Winnowing CoRR (2011)
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)
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski
On Systemic Stability of Banking Networks CoRR (2011)
Piotr Berman
Successes and Failures of Elegant Algorithms in Computational Biology. ISBRA (2010)
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 (1) (2010)
Piotr Berman, Sofya Raskhodnikova
Approximation Algorithms for Min-Max Generalization Problems. APPROX-RANDOM (2010)
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
Steiner Transitive-Closure Spanners of d-Dimensional Posets CoRR (2010)
Piotr Berman, Sofya Raskhodnikova, Ge Ruan
Finding Sparser Directed Spanners. FSTTCS (2010)
Piotr Berman, Marek Karpinski, Andrzej Lingas
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON (2010)
Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky
Efficient Alignments of Metabolic Networks with Bounded Treewidth. ICDM Workshops (2010)
Piotr Berman, Marek Karpinski, Andrzej Lingas
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications CoRR (2009)
Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller
Aligning Two Genomic Sequences That Contain Duplications. RECOMB-CG (2009)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. WADS (2009)
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
Approximating Transitive Reductions for Directed Networks. WADS (2009)
Piotr Berman, Jieun K. Jeong
Consistent Sets of Secondary Structures in Proteins. Algorithmica 53 (1) (2009)
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. 75 (5) (2009)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two CoRR (2008)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. Electron. Colloquium Comput. Complex. 15 (094) (2008)
Jieun K. Jeong, Piotr Berman
On cycles in the transcription network of Saccharomyces cerevisiae. BMC Syst. Biol. 2 (2008)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two CoRR (2008)
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
Approximating Transitivity in Directed Networks CoRR (2008)
Kelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky
HCV Quasispecies Assembly Using Network Flows. ISBRA (2008)
Piotr Berman, Bhaskar DasGupta
Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393 (1-3) (2008)
Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky
Fast Alignments of Metabolic Networks. BIBM (2008)
Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE ACM Trans. Comput. Biol. Bioinform. 5 (4) (2008)
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. 104 (4) (2007)
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
Approximating Transitive Reductions for Directed Networks. Electron. Colloquium Comput. Complex. 14 (119) (2007)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372 (1) (2007)
Piotr Berman, Bhaskar DasGupta
Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electron. Colloquium Comput. Complex. 14 (092) (2007)
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
Packing to angles and sectors. SPAA (2007)
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155 (6-7) (2007)
Piotr Berman, Marek Karpinski, Alexander D. Scott
Computational complexity of some restricted instances of 3-SAT. Discret. Appl. Math. 155 (5) (2007)
Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta
Bidding Protocols for Deploying Mobile Sensors. IEEE Trans. Mob. Comput. 6 (5) (2007)
Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris
HomologMiner: looking for homologous genomic groups in whole genomes. Bioinform. 23 (8) (2007)
Piotr Berman, Shiva Prasad Kasiviswanathan
Faster Approximation of Distances in Graphs. WADS (2007)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Approximating Huffman codes in parallel. J. Discrete Algorithms 5 (3) (2007)
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discret. Appl. Math. 155 (6-7) (2007)
Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
Bringing Folding Pathways into Strand Pairing Prediction. WABI (2007)
Piotr Berman, Bhaskar DasGupta, Jie Liang
Foreword. Algorithmica 48 (4) (2007)
Piotr Berman, Martin Fürer, Alexander Zelikovsky
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR (2006)
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
Packing to angles and sectors. Electron. Colloquium Comput. Complex. 13 (030) (2006)
Nikola Stojanovic, Piotr Berman
A Linear-Time Algorithm for Studying Genetic Variation. WABI (2006)
Piotr Berman, Marek Karpinski
8/7-approximation algorithm for (1, 2)-TSP. SODA (2006)
Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller
Controlling Size When Aligning Multiple Genomic Sequences with Duplications. WABI (2006)
Piotr Berman, Marek Karpinski
8/7-Approximation Algorithm for (1,2)-TSP Electron. Colloquium Comput. Complex. (069) (2005)
Piotr Berman, Surajit K. Das
On the Vehicle Routing Problem. WADS (2005)
Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta
Optimizing sensor movement planning for energy efficiency. ISLPED (2005)
Piotr Berman, Bhaskar DasGupta
Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS (2005)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Optimal Trade-Off for Merkle Tree Traversal. ICETE (Selected Papers) (2005)
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71 (2) (2005)
Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky
Power efficient monitoring management in sensor networks. WCNC (2004)
Piotr Berman, Marek Karpinski, Alexander D. Scott
Computational Complexity of Some Restricted Instances of 3SAT Electron. Colloquium Comput. Complex. (111) (2004)
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM (2004)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Optimal Trade-Off for Merkle Tree Traversal Electron. Colloquium Comput. Complex. (049) (2004)
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. J. Comput. Biol. 11 (4) (2004)
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)
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT (2004)
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
Aligning two fragmented sequences. Discret. Appl. Math. 127 (1) (2003)
Piotr Berman, Marek Karpinski, Alex D. Scott
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT Electron. Colloquium Comput. Complex. 10 (022) (2003)
Piotr Berman, Marek Karpinski, Alex D. Scott
Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electron. Colloquium Comput. Complex. (049) (2003)
Piotr Berman, Piotr Krysta
Optimizing misdirection. SODA (2003)
Piotr Berman, Marek Karpinski
Improved Approximation Lower Bounds on Small Occurrence Optimization Electron. Colloquium Comput. Complex. 10 (008) (2003)
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
Approximation algorithms for MAX-MIN tiling. J. Algorithms 47 (2) (2003)
Piotr Berman, Marek Karpinski
Approximability of Hypergraph Minimum Bisection. Electron. Colloquium Comput. Complex. (056) (2003)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Approximating Huffman Codes in Parallel Electron. Colloquium Comput. Complex. (018) (2002)
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15 (2) (2002)
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
Aligning Two Fragmented Sequences. IPDPS (2002)
Piotr Berman, Marek Karpinski, Yakov Nekrich
Approximating Huffman Codes in Parallel. ICALP (2002)
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
Slice and dice: a simple, improved approximate tiling recipe. SODA (2002)
Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
1.375-Approximation Algorithm for Sorting by Reversals. ESA (2002)
Piotr Berman, Marek Karpinski
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP (2002)
Piotr Berman, Marek Karpinski
Approximating minimum unsatisfiability of linear equations. SODA (2002)
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)
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. 65 (2) (2002)
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
Simple approximation algorithm for nonoverlapping local alignments. SODA (2002)
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41 (2) (2001)

Piotr Berman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Piotr Berman