| 2016 | ICALP | Tolerant Testers of Image Properties. | Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova |
| 2014 | STOC | L | Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2011 | ICALP | Steiner Transitive-Closure Spanners of Low-Dimensional Posets. | Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev |
| 2011 | ICALP | Improved Approximation for the Directed Spanner Problem. | Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2011 | MASCOTS | HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs. | Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam |
| 2010 | COCOON | Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. | Piotr Berman, Marek Karpinski, Andrzej Lingas |
| 2010 | ICDM | Efficient Alignments of Metabolic Networks with Bounded Treewidth. | Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky |
| 2010 | ISAAC | A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
| 2009 | RECOMB | Aligning Two Genomic Sequences That Contain Duplications. | Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller |
| 2009 | WADS | Approximating Transitive Reductions for Directed Networks. | Piotr Berman, Bhaskar DasGupta, Marek Karpinski |
| 2009 | WADS | 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. | Piotr Berman, Marek Karpinski, Alexander Zelikovsky |
| 2007 | SPAA | Packing to angles and sectors. | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar |
| 2007 | WABI | Bringing Folding Pathways into Strand Pairing Prediction. | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka |
| 2007 | WADS | Faster Approximation of Distances in Graphs. | Piotr Berman, Shiva Prasad Kasiviswanathan |
| 2006 | CSR | Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. | Piotr Berman, Martin Frer, Alexander Zelikovsky |
| 2006 | SODA | 8/7-approximation algorithm for (1, 2)-TSP. | Piotr Berman, Marek Karpinski |
| 2006 | WABI | Controlling Size When Aligning Multiple Genomic Sequences with Duplications. | Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller |
| 2006 | WABI | A Linear-Time Algorithm for Studying Genetic Variation. | Nikola Stojanovic, Piotr Berman |
| 2005 | ISLPED | Optimizing sensor movement planning for energy efficiency. | Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta |
| 2005 | WADS | Approximating the Online Set Multicover Problems via Randomized Winnowing. | Piotr Berman, Bhaskar DasGupta |
| 2005 | WADS | On the Vehicle Routing Problem. | Piotr Berman, Surajit K. Das |
| 2004 | CPM | The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. | Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, Gyrgy Turn, Yi Zhang |
| 2004 | WCNC | Power efficient monitoring management in sensor networks. | Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky |
| 2003 | SODA | Optimizing misdirection. | Piotr Berman, Piotr Krysta |
| 2002 | ESA | 1.375-Approximation Algorithm for Sorting by Reversals. | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski |
| 2002 | ICALP | Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. | Piotr Berman, Marek Karpinski |
| 2002 | ICALP | Approximating Huffman Codes in Parallel. | Piotr Berman, Marek Karpinski, Yakov Nekrich |
| 2002 | SODA | Slice and dice: a simple, improved approximate tiling recipe. | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
| 2002 | SODA | Simple approximation algorithm for nonoverlapping local alignments. | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan |
| 2002 | SODA | Approximating minimum unsatisfiability of linear equations. | Piotr Berman, Marek Karpinski |
| 2002 | WABI | Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. | Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder |
| 2001 | SODA | Improved approximation algorithms for rectangle tiling and packing. | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami |
| 2000 | STOC | Improvements in throughout maximization for real-time scheduling. | Piotr Berman, Bhaskar DasGupta |
| 1999 | ICALP | On Some Tighter Inapproximability Results (Extended Abstract). | Piotr Berman, Marek Karpinski |
| 1999 | RECOMB | Winnowing sequences from a database search. | Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller |
| 1999 | WADS | The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. | Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky |
| 1998 | ESA | Adaptability and the Usefulness of Hints (Extended Abstract). | Piotr Berman, Juan A. Garay |
| 1998 | RECOMB | Alignments without low-scoring regions. | Zheng Zhang, Piotr Berman, Webb Miller |
| 1997 | CPM | On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter |
| 1997 | PODC | Competing against Specialists. | Piotr Berman, Juan A. Garay |
| 1997 | STOC | On-Line Algorithms for Steiner Tree Problems (Extended Abstract). | Piotr Berman, Chris Coulston |
| 1997 | WADS | On-line Load Balancing for Related Machines. | Piotr Berman, Moses Charikar, Marek Karpinski |
| 1997 | WADS | A Linear-Time Algorithm for the 1-Mismatch Problem. | Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller |
| 1996 | CPM | Fast Sorting by Reversal. | Piotr Berman, Sridhar Hannenhalli |
| 1996 | SODA | Randomized Robot Navigation Algorithms. | Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosn, Michael E. Saks |
| 1995 | ISAAC | Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. | Vineet Bafna, Piotr Berman, Toshihiro Fujito |
| 1995 | WADS | On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. | Piotr Berman, Toshihiro Fujito |
| 1994 | ESA | Approaching the 5/4-Approximation for Rectilinear Steiner Trees. | Piotr Berman, Ulrich Fmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky |
| 1994 | SODA | Approximating Maximum Independent Set in Bounded Degree Graphs. | Piotr Berman, Martin Frer |
| 1992 | SODA | On-Line Navigation in a Room. | Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan |
| 1992 | SODA | Improved Approximations for the Steiner Tree Problem. | Piotr Berman, Viswanathan Ramaiyer |
| 1990 | SODA | A Competitive 3-Server Algorithm. | Piotr Berman, Howard J. Karloff, Gbor Tardos |
| 1990 | SRDS | Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. | Mirjana Obradovic, Piotr Berman |
| 1989 | FOCS | Towards Optimal Distributed Consensus (Extended Abstract) | Piotr Berman, Juan A. Garay, Kenneth J. Perry |
| 1989 | ICALP | Asymptotically Optimal Distributed Consensus (Extended Abstract). | Piotr Berman, Juan A. Garay |
| 1989 | ICPP | Efficient Agreement on Bounded-Degree Networks. | Piotr Berman, Juan A. Garay |
| 1989 | STACS | On the Complexity of Approximating the Independent Set Problem. | Piotr Berman, Georg Schnitger |
| 1988 | STOC | Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) | Piotr Berman, Janos Simon |
| 1987 | FOCS | Learning One-Counter Languages in Polynomial Time (Extended Abstract) | Piotr Berman, Robert Roos |
| 1987 | ISMIS | A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract). | Piotr Berman, Robert Roos |
| 1983 | FCT | Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. | Piotr Berman |
| 1983 | FOCS | Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) | Piotr Berman, Janos Simon |
| 1982 | ICALP | On the Power of Nondeterminism in Dynamic Logic. | Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn |
| 1980 | ICALP | A Note on Sweeping Automata. | Piotr Berman |
| 1978 | ICALP | Relationship Between Density and Deterministic Complexity of NP-Complete Languages. | Piotr Berman |